Distributed Graph Automata
From MaRDI portal
Publication:4635803
DOI10.1109/LICS.2015.27zbMath1401.68166arXiv1404.6503OpenAlexW3103882277MaRDI QIDQ4635803
Publication date: 23 April 2018
Published in: 2015 30th Annual ACM/IEEE Symposium on Logic in Computer Science (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1404.6503
Formal languages and automata (68Q45) Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10) Automata and formal grammars in connection with logical questions (03D05)
Related Items (8)
What can be verified locally? ⋮ Constant space and non-constant time in distributed computing ⋮ Communicating Finite-State Machines and Two-Variable Logic ⋮ Relating Paths in Transition Systems: The Fall of the Modal Mu-Calculus ⋮ Emptiness problems for distributed automata ⋮ Communicating finite-state machines, first-order logic, and star-free propositional dynamic logic ⋮ Unnamed Item ⋮ A hierarchy of local decision
This page was built for publication: Distributed Graph Automata