On timed alternating simulation for concurrent timed games
DOI10.4230/LIPICS.FSTTCS.2009.2309zbMATH Open1248.68320OpenAlexW1506190616MaRDI QIDQ2920115FDOQ2920115
Authors: Laura Bozzelli, Axel Legay, Sophie Pinchinat
Publication date: 24 October 2012
Full work available at URL: http://subs.emis.de/LIPIcs/frontdoor_3a58.html
Recommendations
Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Specification and verification (program logics, model checking, etc.) (68Q60) (n)-person games, (n>2) (91A06) Temporal logic (03B44)
Cited In (7)
- Efficient on-the-fly algorithm for checking alternating timed simulation
- On timed alternating simulation for concurrent timed games
- A unifying approach to decide relations for timed automata and their game characterization
- CONCUR 2005 – Concurrency Theory
- Timed Alternating-Time Temporal Logic
- Model-Checking Timed ATL for Durational Concurrent Game Structures
- Timed Concurrent Game Structures
This page was built for publication: On timed alternating simulation for concurrent timed games
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2920115)