CONCUR 2003 - Concurrency Theory
From MaRDI portal
Publication:5900556
DOI10.1007/b11938zbMath1274.68680OpenAlexW105220891MaRDI QIDQ5900556
Anca Muscholl, Alin Stefanescu, Javier Esparza
Publication date: 30 March 2010
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/b11938
Formal languages and automata (68Q45) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85) Distributed algorithms (68W15)
Related Items (6)
Realizability of concurrent recursive programs ⋮ Distributed synthesis for well-connected architectures ⋮ Answer set programming based on propositional satisfiability ⋮ A quadratic construction for Zielonka automata with acyclic communication structure ⋮ Compositional synthesis of asynchronous automata ⋮ Realizability of Concurrent Recursive Programs
This page was built for publication: CONCUR 2003 - Concurrency Theory
