scientific article; zbMATH DE number 1927560

zbMath1012.68118MaRDI QIDQ4484484

P. Madhusudan, P. S. Thiagarajan

Publication date: 12 June 2003

Full work available at URL: http://link.springer.de/link/service/series/0558/bibs/2421/24210145.htm

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

Mathematics Subject Classification ID

Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)

Related Items (11)

Modular strategies for recursive game graphs ⋮ Hierarchical information and the synthesis of distributed strategies ⋮ The computational complexity of scenario-based agent verification and design ⋮ Distributed synthesis for well-connected architectures ⋮ Compositional strategy synthesis for stochastic games with multiple objectives ⋮ Undecidable problems of decentralized observation and control on regular languages ⋮ Unnamed Item ⋮ Efficient Trace Encodings of Bounded Synthesis for Asynchronous Distributed Systems ⋮ Natural Specifications Yield Decidability for Distributed Synthesis of Asynchronous Systems ⋮ On Distributed Program Specification and Synthesis in Architectures with Cycles ⋮ Distributed Synthesis in Continuous Time

This page was built for publication: