Model-checking in dense real-time
Information and Computation - Special issue: selections from 1990 IEEE symposium on logic in computer science
Theoretical Computer Science
Branching time and abstraction in bisimulation semantics
Journal of the ACM (JACM)
Efficient Scaling-Invariant Checking of Timed Bisimulation
STACS '97 Proceedings of the 14th Annual Symposium on Theoretical Aspects of Computer Science
Scaling up Uppaal Automatic Verification of Real-Time Systems Using Compositionality and Abstraction
FTRTFT '00 Proceedings of the 6th International Symposium on Formal Techniques in Real-Time and Fault-Tolerant Systems
Kronos: A Model-Checking Tool for Real-Time Systems
CAV '98 Proceedings of the 10th International Conference on Computer Aided Verification
Decidability of Bisimulation Equivalences for Parallel Timer Processes
CAV '92 Proceedings of the Fourth International Workshop on Computer Aided Verification
Timed Modal Specification - Theory and Tools
CAV '93 Proceedings of the 5th International Conference on Computer Aided Verification
Alternating Refinement Relations
CONCUR '98 Proceedings of the 9th International Conference on Concurrency Theory
Alternating-time Temporal Logic
FOCS '97 Proceedings of the 38th Annual Symposium on Foundations of Computer Science
Optimal scheduling using priced timed automata
ACM SIGMETRICS Performance Evaluation Review
Fair Simulation Relations, Parity Games, and State Space Reduction for Büchi Automata
SIAM Journal on Computing
Efficient on-the-fly algorithms for the analysis of timed games
CONCUR 2005 - Concurrency Theory
Timed control with observation based and stuttering invariant strategies
ATVA'07 Proceedings of the 5th international conference on Automated technology for verification and analysis
Guided controller synthesis for climate controller using UPPAAL TIGA
FORMATS'07 Proceedings of the 5th international conference on Formal modeling and analysis of timed systems
Combining symbolic representations for solving timed games
FORMATS'10 Proceedings of the 8th international conference on Formal modeling and analysis of timed systems
Methodologies for specification of real-time systems using timed I/O automata
FMCO'09 Proceedings of the 8th international conference on Formal methods for components and objects
Developing UPPAAL over 15 years
Software—Practice & Experience
Robust specification of real time components
FORMATS'11 Proceedings of the 9th international conference on Formal modeling and analysis of timed systems
Modal event-clock specifications for timed component-based design
Science of Computer Programming
Robust synthesis for real-time systems
Theoretical Computer Science
| Hi-index | 0.00 |
In this paper we focus on property-preserving preorders between timed game automata and their application to control of partially observable systems. We define timed weak alternating simulation as a preorder between timed game automata, which preserves controllability. We define the rules of building a symbolic turn-based two-player game such that the existence of a winning strategy is equivalent to the simulation being satisfied. We also propose an on-the-fly algorithm for solving this game. This simulation checking method can be applied to the case of non-alternating or strong simulations as well. We illustrate our algorithm by a case study and report on results.