Realizability of Concurrent Recursive Programs

DOI10.1007/978-3-642-00596-1_29zbMath1234.68071OpenAlexW2105145723MaRDI QIDQ3617744

Peter Habermehl, Benedikt Bollig, Manuela-Lidia Grindei

Publication date: 31 March 2009

Published in: Foundations of Software Science and Computational Structures (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-00596-1_29

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Specification and verification (program logics, model checking, etc.) (68Q60) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85) Mathematical aspects of software engineering (specification, verification, metrics, requirements, etc.) (68N30)

Related Items

Realizability of concurrent recursive programs, Automated Synthesis of Distributed Controllers, On Distributed Monitoring and Synthesis, A survey on automata with translucent letters, Temporal logics for concurrent recursive programs: satisfiability and model checking

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Weighted asynchronous cellular automata
• Using branching time temporal logic to synthesize synchronization skeletons
• An algorithmic approach for checking closure properties of temporal logic specifications and \(\omega\)-regular languages
• LTL is expressively complete for Mazurkiewicz traces
• A Kleene theorem and model checking algorithms for existentially bounded communicating automata
• A theory of regular MSC languages
• Unfolding Synthesis of Asynchronous Automata
• Visibly pushdown languages
• Constructing Exponential-Size Deterministic Zielonka Automata
• Adding Nesting Structure to Words
• First-Order and Temporal Logics for Nested Words
• On the Expressive Power of 2-Stack Visibly Pushdown Automata
• Notes on finite asynchronous automata
• Context-Bounded Analysis of Concurrent Queue Systems
• A Generic Approach to the Static Analysis of Concurrent Programs with Procedures
• Tools and Algorithms for the Construction and Analysis of Systems
• Model Checking Multithreaded Programs with Asynchronous Atomic Methods
• CONCUR 2003 - Concurrency Theory