Controlling loosely cooperating processes
From MaRDI portal
Publication:896910
DOI10.1016/J.TCS.2015.07.044zbMATH Open1332.68015OpenAlexW1025231194MaRDI QIDQ896910FDOQ896910
Authors: Anca Muscholl, Sven Schewe
Publication date: 15 December 2015
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.tcs.2015.07.044
Recommendations
Formal languages and automata (68Q45) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Distributed systems (68M14)
Cites Work
- Notes on finite asynchronous automata
- Synthesis of Asynchronous Systems
- Optimal Zielonka-type construction of deterministic asynchronous automata
- Automated Technology for Verification and Analysis
- FSTTCS 2005: Foundations of Software Technology and Theoretical Computer Science
- Title not available (Why is that?)
- Title not available (Why is that?)
- Parallel Program Schemata and Maximal Parallelism I. Fundamental Results
- Mixed languages
Cited In (1)
This page was built for publication: Controlling loosely cooperating processes
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q896910)