Automata and Logics for Concurrent Systems: Five Models in Five Pages
From MaRDI portal
Publication:2947404
DOI10.1007/978-3-319-22360-5_1zbMath1465.68133OpenAlexW2239010912MaRDI QIDQ2947404
Publication date: 23 September 2015
Published in: Implementation and Application of Automata (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-319-22360-5_1
Formal languages and automata (68Q45) Automata and formal grammars in connection with logical questions (03D05) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- On notions of regularity for data languages
- A Kleene theorem and model checking algorithms for existentially bounded communicating automata
- Message-passing automata are expressively equivalent to EMSO logic
- A theory of regular MSC languages
- MSO Decidability of Multi-Pushdown Systems via Split-Width
- A Unifying Approach for Multistack Pushdown Automata
- Two-variable logic on data words
- Weak Second‐Order Arithmetic and Finite Automata
- Adding nesting structure to words
- Emptiness of Multi-pushdown Automata Is 2ETIME-Complete
- The Language Theory of Bounded Context-Switching
- On the Expressive Power of 2-Stack Visibly Pushdown Automata
- On Communicating Finite-State Machines
- Notes on finite asynchronous automata
- The tree width of auxiliary storage
- Finite automata and the logic of one-place predicates
- Scope-Bounded Pushdown Languages
