Publication:5009419
From MaRDI portal
DOI10.4230/LIPIcs.CONCUR.2018.7zbMath1487.68163arXiv1804.10076MaRDI QIDQ5009419
Paul Gastin, Benedikt Bollig, Marie Fortin
Publication date: 4 August 2021
Full work available at URL: https://arxiv.org/abs/1804.10076
68Q45: Formal languages and automata
03B70: Logic in computer science
68Q85: Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.)
Related Items
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A guide to completeness and complexity for modal logics of knowledge and belief
- Propositional dynamic logic of regular programs
- Bounded MSC communication
- Regular sets of infinite message sequence charts
- On logics with two variables
- Model checking propositional dynamic logic with all extras
- A Kleene theorem and model checking algorithms for existentially bounded communicating automata
- Message-passing automata are expressively equivalent to EMSO logic
- An expressively complete linear time temporal logic for Mazurkiewicz traces
- A theory of regular MSC languages
- Propositional Dynamic Logic for Message-Passing Systems
- Weak Second‐Order Arithmetic and Finite Automata
- Communicating Finite-State Machines and Two-Variable Logic
- PDL with intersection and converse: satisfiability and infinite-state model checking
- On Communicating Finite-State Machines
- Notes on finite asynchronous automata
- Decision Problems of Finite Automata Design and Related Arithmetics
- Time, clocks, and the ordering of events in a distributed system
- 2-Exp Time lower bounds for propositional dynamic logics with intersection
- Finite automata and the logic of one-place predicates
- Propositional Dynamic Logic with Converse and Repeat for Message-Passing Systems
