Composability of Infinite-State Activity Automata
- 1 January 2004
- book chapter
- Published by Springer Nature
Abstract
No abstract availableKeywords
This publication has 22 references indexed in Scilit:
- Pushdown timed automata: a binary reachability characterization and safety verificationTheoretical Computer Science, 2003
- Presburger liveness verification of discrete timed automataTheoretical Computer Science, 2003
- Generalized discrete timed automata: decidable approximations for safety verificationTheoretical Computer Science, 2003
- A theory of timed automataPublished by Elsevier ,2002
- Agent-oriented technology in support of e-businessCommunications of the ACM, 2001
- Realizable and unrealizable specifications of reactive systemsPublished by Springer Nature ,1989
- Reversal-Bounded Multicounter Machines and Their Decision ProblemsJournal of the ACM, 1978
- Reversal-bounded multipushdown machinesJournal of Computer and System Sciences, 1974
- Solving sequential conditions by finite-state strategiesTransactions of the American Mathematical Society, 1969
- Semigroups, Presburger formulas, and languagesPacific Journal of Mathematics, 1966