FSTTCS 2005: Foundations of Software Technology and Theoretical Computer Science

DOI10.1007/11590156zbMath1172.68556OpenAlexW2484051058MaRDI QIDQ5897770

P. S. Thiagarajan, Shaofa Yang, P. Madhusudan

Publication date: 14 November 2006

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/11590156

Mathematics Subject Classification ID

Specification and verification (program logics, model checking, etc.) (68Q60) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85) Decidability of theories and sets of sentences (03B25)

Related Items (22)

Distributed Asynchronous Games With Causal Memory are Undecidable ⋮ Automated Synthesis of Distributed Controllers ⋮ Bounded Synthesis for Petri Games ⋮ Distributed synthesis for well-connected architectures ⋮ On Distributed Monitoring and Synthesis ⋮ The synthesis problem for repeatedly communicating Petri games ⋮ Solving high-level Petri games ⋮ High-level representation of benchmark families for Petri games ⋮ Controlling loosely cooperating processes ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Efficient Trace Encodings of Bounded Synthesis for Asynchronous Distributed Systems ⋮ Distributed Control of Discrete-Event Systems: A First Step ⋮ Petri games: synthesis of distributed systems with causal memory ⋮ Rabin's theorem in the concurrency setting: a conjecture ⋮ A Nice labelling for tree-like event structures of degree 3 ⋮ Natural Specifications Yield Decidability for Distributed Synthesis of Asynchronous Systems ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Synthesis in presence of dynamic links ⋮ Automated Synthesis: a Distributed Viewpoint ⋮ Canonical representations for direct generation of strategies in high-level Petri games

This page was built for publication: FSTTCS 2005: Foundations of Software Technology and Theoretical Computer Science