On timed alternating simulation for concurrent timed games

DOI10.1007/s00236-012-0158-yzbMath1277.68165OpenAlexW1985744311MaRDI QIDQ715043

Sophie Pinchinat, Laura Bozzelli, Axel Legay

Publication date: 15 October 2012

Published in: Acta Informatica (Search for Journal in Brave)

Full work available at URL: https://drops.dagstuhl.de/opus/volltexte/2009/2309/

Mathematics Subject Classification ID

(n)-person games, (n>2) (91A06) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Temporal logic (03B44)

Cites Work

• Unnamed Item
• Unnamed Item
• A complete axiomatization of timed bisimulation for a class of timed regular behaviours
• Model-checking in dense real-time
• A complete axiomatisation for observational congruence of finite-state behaviours
• A theory of timed automata
• Alternating-time temporal logic
• Timed Alternating-Time Temporal Logic
• Timed Concurrent Game Structures
• Efficient on-the-fly Algorithm for Checking Alternating Timed Simulation
• “Sometimes” and “not never” revisited
• Frontiers of Combining Systems
• Model Checking Probabilistic Timed Automata with One or Two Clocks
• Foundations of Software Science and Computation Structures
• CONCUR 2003 - Concurrency Theory