Recommendations
Cites work
- scientific article; zbMATH DE number 941396 (Why is no real title available?)
- scientific article; zbMATH DE number 3266604 (Why is no real title available?)
- A Kleene theorem and model checking algorithms for existentially bounded communicating automata
- A generalization of Ehrenfeucht's game and some applications
- A theory of regular MSC languages
- Asynchronous cellular automata for infinite traces
- Asynchronous cellular automata for pomsets
- Decision Problems of Finite Automata Design and Related Arithmetics
- Deterministic asynchronous automata for infinite traces
- Elements of finite model theory.
- Generalized quantifiers and well orderings
- Logical definability on infinite traces
- Message-passing automata are expressively equivalent to EMSO logic
- On Communicating Finite-State Machines
- Regular sets of infinite message sequence charts
- Theories of automata on \(\omega\)-tapes: a simplified approach
- Weak Second‐Order Arithmetic and Finite Automata
Cited in
(8)- Modal logic and distributed message passing automata
- CONCUR 2004 - Concurrency Theory
- Communicating finite-state machines, first-order logic, and star-free propositional dynamic logic
- Message-passing automata are expressively equivalent to EMSO logic
- Synthesis and Analysis of Petri Nets from Causal Specifications
- An optimal construction of Hanf sentences
- Weighted automata and logics on infinite graphs
- Propositional Dynamic Logic for Message-Passing Systems
This page was built for publication: Muller message-passing automata and logics
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q948076)