Efficient on-the-fly Algorithm for Checking Alternating Timed Simulation

DOI10.1007/978-3-642-04368-0_8zbMath1262.68105OpenAlexW1937686558MaRDI QIDQ3648824

Thomas Chatain, Alexandre David, P. E. Bulychev, Kim Guldstrand Larsen

Publication date: 1 December 2009

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

Full work available at URL: https://doi.org/10.1007/978-3-642-04368-0_8

Mathematics Subject Classification ID

Applications of game theory (91A80) Formal languages and automata (68Q45) Specification and verification (program logics, model checking, etc.) (68Q60)

Related Items (7)

Robust Specification of Real Time Components ⋮ Robust synthesis for real-time systems ⋮ Accuracy of Message Counting Abstraction in Fault-Tolerant Distributed Algorithms ⋮ Modal event-clock specifications for timed component-based design ⋮ On timed alternating simulation for concurrent timed games ⋮ An axiomatic semantics for \(\mathsf{ioco} \underline{\mathsf{s}}\) conformance relation ⋮ Methodologies for Specification of Real-Time Systems Using Timed I/O Automata

Uses Software

• Kronos
• Uppaal

Cites Work

• Unnamed Item
• Unnamed Item
• Model-checking in dense real-time
• A theory of timed automata
• Uppaal in a nutshell
• Alternating-time temporal logic
• Timed Control with Observation Based and Stuttering Invariant Strategies
• Branching time and abstraction in bisimulation semantics
• On the synthesis of discrete controllers for timed systems
• Fair Simulation Relations, Parity Games, and State Space Reduction for Büchi Automata
• Lectures on Concurrency and Petri Nets
• CONCUR 2005 – Concurrency Theory
• CONCUR 2003 - Concurrency Theory

This page was built for publication: Efficient on-the-fly Algorithm for Checking Alternating Timed Simulation