Automated Technology for Verification and Analysis
From MaRDI portal
Publication:5491869
DOI10.1007/11562948zbMath1170.68539OpenAlexW4300912265MaRDI QIDQ5491869
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
Analysis of algorithms and problem complexity (68Q25) Formal languages and automata (68Q45) Specification and verification (program logics, model checking, etc.) (68Q60) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)
Related Items
Hierarchical information and the synthesis of distributed strategies, Automated Synthesis of Distributed Controllers, Bounded Synthesis for Petri Games, Graph Games and Reactive Synthesis, The synthesis problem for repeatedly communicating Petri games, Solving high-level Petri games, Synchronous counting and computational algorithm design, Controlling loosely cooperating processes, Distributed Synthesis for Alternating-Time Logics, Compositional safety rules for inter-triggering hybrid automata, Complexity of synthesis of composite service with correctness guarantee, Unnamed Item, Efficient Trace Encodings of Bounded Synthesis for Asynchronous Distributed Systems, Program Repair for Hyperproperties, Distributed synthesis for regular and contextfree specifications, On Distributed Program Specification and Synthesis in Architectures with Cycles, Synthesis from hyperproperties, Synthesis of Fault-Tolerant Distributed Systems, Unnamed Item, Unnamed Item, Unnamed Item, Automated Synthesis: a Distributed Viewpoint, Canonical representations for direct generation of strategies in high-level Petri games
