Modal logic and distributed message passing automata
From MaRDI portal
Decidability of theories and sets of sentences (03B25) Modal logic (including the logic of norms) (03B45) 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)
Recommendations
Cited in
(18)- Counter machines and distributed automata -- a story about exchanging space and time
- A message-passing interpretation of adjoint logic
- Emptiness problems for distributed automata
- Communicating finite-state machines, first-order logic, and star-free propositional dynamic logic
- Message-passing automata are expressively equivalent to EMSO logic
- Distributed first order logics
- Communicating finite-state machines and two-variable logic
- Emptiness problems for distributed automata
- Asynchronous distributed automata: a characterization of the modal \(\mu\)-fragment
- Programming Languages and Systems
- CONCUR 2004 - Concurrency Theory
- Weak models of distributed computing, with connections to modal logic
- Weak models of distributed computing, with connections to modal logic
- Descriptive complexity for neural networks via Boolean networks
- Descriptive complexity for distributed computing with circuits
- A LOCAL view of the polynomial hierarchy
- Descriptive complexity for neural networks via Boolean networks
- Muller message-passing automata and logics
This page was built for publication: Modal logic and distributed message passing automata
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2958538)
