Automated Technology for Verification and Analysis

DOI10.1007/11562948zbMath1170.68539MaRDI QIDQ5491869

Sven Schewe, Bernd Finkbeiner

Publication date: 10 October 2006

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

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

Mathematics Subject Classification ID

68Q25: Analysis of algorithms and problem complexity

68Q45: Formal languages and automata

68Q60: Specification and verification (program logics, model checking, etc.)

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

Related Items

Unnamed Item, Unnamed Item, Unnamed Item, Unnamed Item, Automated Synthesis: a Distributed Viewpoint, Complexity of synthesis of composite service with correctness guarantee, Synchronous counting and computational algorithm design, Controlling loosely cooperating processes, Hierarchical information and the synthesis of distributed strategies, Canonical representations for direct generation of strategies in high-level Petri games, The synthesis problem for repeatedly communicating Petri games, Solving high-level Petri games, Distributed synthesis for regular and contextfree specifications, Synthesis from hyperproperties, Graph Games and Reactive Synthesis, Efficient Trace Encodings of Bounded Synthesis for Asynchronous Distributed Systems, Program Repair for Hyperproperties, Automated Synthesis of Distributed Controllers, Bounded Synthesis for Petri Games, Distributed Synthesis for Alternating-Time Logics, On Distributed Program Specification and Synthesis in Architectures with Cycles, Synthesis of Fault-Tolerant Distributed Systems