The existence of refinement mappings
Theoretical Computer Science
Preserving liveness: comments on “safety and liveness from a methodological point of view”
Information Processing Letters
Theoretical Computer Science
Proceedings of the 8th European software engineering conference held jointly with 9th ACM SIGSOFT international symposium on Foundations of software engineering
Symbolic Algorithms for Infinite-State Games
CONCUR '01 Proceedings of the 12th International Conference on Concurrency Theory
Proceedings of the International Workshop on Automatic Verification Methods for Finite State Systems
EMSOFT '02 Proceedings of the Second International Conference on Embedded Software
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
Timed I/O Automata: A Mathematical Framework for Modeling and Analyzing Real-Time Systems
RTSS '03 Proceedings of the 24th IEEE International Real-Time Systems Symposium
Efficient on-the-fly algorithms for the analysis of timed games
CONCUR 2005 - Concurrency Theory
Automatically transforming and relating Uppaal models of embedded systems
EMSOFT '08 Proceedings of the 8th ACM international conference on Embedded software
Timed I/O automata: a complete specification theory for real-time systems
Proceedings of the 13th ACM international conference on Hybrid systems: computation and control
UPPAAL-Tiga: time for playing games!
CAV'07 Proceedings of the 19th international conference on Computer aided verification
ECDAR: an environment for compositional design and analysis of real time systems
ATVA'10 Proceedings of the 8th international conference on Automated technology for verification and analysis
Invited contribution: sociable interfaces
FroCoS'05 Proceedings of the 5th international conference on Frontiers of Combining Systems
New results for Constraint Markov Chains
Performance Evaluation
Analyzing an embedded sensor with timed automata in uppaal
ACM Transactions on Embedded Computing Systems (TECS)
| Hi-index | 0.00 |
Recently, we have proposed a new design theory for timed systems. This theory, building on Timed I/O Automata with game semantics, includes classical operators like satisfaction, consistency, logical composition and structural composition. This paper presents a new efficient algorithm for checking Büchi objectives of timed games. This new algorithm can be used to enforce liveness in an interface, or to guarantee that the interface can indeed be implemented. We illustrate the framework with an infrared sensor case study.