Automata and Logics for Concurrent Systems: Five Models in Five Pages
DOI10.1007/978-3-319-22360-5_1zbMATH Open1465.68133OpenAlexW2239010912MaRDI QIDQ2947404FDOQ2947404
Authors: Benedikt Bollig 
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
- Title not available (Why is that?)
- Adding nesting structure to words
- On Communicating Finite-State Machines
- Two-variable logic on data words
- Weak Second‐Order Arithmetic and Finite Automata
- Notes on finite asynchronous automata
- A unifying approach for multistack pushdown automata
- 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
- Scope-bounded pushdown languages
- On notions of regularity for data languages
- A Kleene theorem and model checking algorithms for existentially bounded communicating automata
- A theory of regular MSC languages
- Message-passing automata are expressively equivalent to EMSO logic
- MSO decidability of multi-pushdown systems via split-width
- The tree width of auxiliary storage
- Title not available (Why is that?)
- Finite automata and the logic of one-place predicates
- Title not available (Why is that?)
This page was built for publication: Automata and Logics for Concurrent Systems: Five Models in Five Pages
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2947404)
