Muller message-passing automata and logics
DOI10.1016/J.IC.2008.03.010zbMATH Open1154.68064OpenAlexW1973172637MaRDI QIDQ948076FDOQ948076
Authors: Benedikt Bollig, Dietrich Kuske 
Publication date: 8 October 2008
Published in: Information and Computation (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ic.2008.03.010
Recommendations
concurrencymonadic second-order logicinfinite message sequence chartsmessage-passing automataMuller automata
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?)
- Elements of finite model theory.
- On Communicating Finite-State Machines
- Weak Second‐Order Arithmetic and Finite Automata
- Decision Problems of Finite Automata Design and Related Arithmetics
- Title not available (Why is that?)
- Logical definability on infinite traces
- Theories of automata on \(\omega\)-tapes: a simplified approach
- 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
- Deterministic asynchronous automata for infinite traces
- Asynchronous cellular automata for infinite traces
- Regular sets of infinite message sequence charts
- Asynchronous cellular automata for pomsets
- A generalization of Ehrenfeucht's game and some applications
- Generalized quantifiers and well orderings
Cited In (8)
- Communicating finite-state machines, first-order logic, and star-free propositional dynamic logic
- CONCUR 2004 - Concurrency Theory
- Propositional Dynamic Logic for Message-Passing Systems
- An optimal construction of Hanf sentences
- Weighted automata and logics on infinite graphs
- Modal logic and distributed message passing automata
- Synthesis and Analysis of Petri Nets from Causal Specifications
- Message-passing automata are expressively equivalent to EMSO logic
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)
