Automata and Logics for Concurrent Systems: Five Models in Five Pages

DOI10.1007/978-3-319-22360-5_1MaRDI QIDQ2947404zbMATH OpenOpenAlexFDO

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

Mathematics Subject Classification ID

Automata and formal grammars in connection with logical questions (03D05) Formal languages and automata (68Q45) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)

Cites work

• A Kleene theorem and model checking algorithms for existentially bounded communicating automata
• A theory of regular MSC languages
• A unifying approach for multistack pushdown automata
• Adding nesting structure to words
• Emptiness of Multi-pushdown Automata Is 2ETIME-Complete
• Finite automata and the logic of one-place predicates
• scientific article; zbMATH DE number 7222494 (Why is no real title available?)
• scientific article; zbMATH DE number 1059319 (Why is no real title available?)
• scientific article; zbMATH DE number 941396 (Why is no real title available?)
• Message-passing automata are expressively equivalent to EMSO logic
• MSO decidability of multi-pushdown systems via split-width
• Notes on finite asynchronous automata
• On Communicating Finite-State Machines
• On notions of regularity for data languages
• On the Expressive Power of 2-Stack Visibly Pushdown Automata
• Scope-bounded pushdown languages
• The language theory of bounded context-switching
• The tree width of auxiliary storage
• Two-variable logic on data words
• Weak Second‐Order Arithmetic and Finite Automata

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)