Asynchronous distributed automata: a characterization of the modal -fragment

DOI10.4230/LIPICS.ICALP.2017.100zbMATH Open1442.68096arXiv1611.08554MaRDI QIDQ5111432FDOQ5111432

Authors: Fabian Reiter 

Publication date: 27 May 2020

Full work available at URL: https://arxiv.org/abs/1611.08554

Recommendations

• Modal logic and distributed message passing automata
• Fundamentals of Computation Theory
• scientific article; zbMATH DE number 1497793
• Distributed graph automata
• Distributed Asynchronous Automata

zbMATH Keywords

distributed computingfinite automatamodal logic\(\mu\)-calculus

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Modal logic (including the logic of norms) (03B45) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)

Cited In (11)

• Communicating finite-state machines, first-order logic, and star-free propositional dynamic logic
• Introduction to local certification
• Bounded game-theoretic semantics for modal mu-calculus
• Weak models of distributed computing, with connections to modal logic
• Constant space and non-constant time in distributed computing
• Counter machines and distributed automata -- a story about exchanging space and time
• Modal logic and distributed message passing automata
• Title not available (Why is that?)
• Emptiness problems for distributed automata
• Emptiness problems for distributed automata
• Communicating finite-state machines and two-variable logic

This page was built for publication: Asynchronous distributed automata: a characterization of the modal \(\mu\)-fragment

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5111432)