Controlling loosely cooperating processes

DOI10.1016/j.tcs.2015.07.044zbMath1332.68015OpenAlexW1025231194MaRDI QIDQ896910

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

zbMATH Keywords

controlgamesloosely cooperating processesZielonka automata

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Distributed systems (68M14)

Cites Work

• Unnamed Item
• Unnamed Item
• Mixed languages
• Optimal Zielonka-Type Construction of Deterministic Asynchronous Automata
• Synthesis of Asynchronous Systems
• Notes on finite asynchronous automata
• Parallel Program Schemata and Maximal Parallelism I. Fundamental Results
• Automated Technology for Verification and Analysis
• FSTTCS 2005: Foundations of Software Technology and Theoretical Computer Science

This page was built for publication: Controlling loosely cooperating processes