Specifying real-time properties with metric temporal logic
Real-Time Systems
Patterns in property specifications for finite-state verification
Proceedings of the 21st international conference on Software engineering
Model Checking via Reachability Testing for Timed Automata
TACAS '98 Proceedings of the 4th International Conference on Tools and Algorithms for Construction and Analysis of Systems
It's About Time: Real-Time Logics Reviewed
CONCUR '98 Proceedings of the 9th International Conference on Concurrency Theory
Fast LTL to Büchi Automata Translation
CAV '01 Proceedings of the 13th International Conference on Computer Aided Verification
The power of reachability testing for timed automata
Theoretical Computer Science
Time Constraints Verification Methods Based on Time Petri Nets
FTDCS '97 Proceedings of the 6th IEEE Workshop on Future Trends of Distributed Computing Systems
A study of the recoverability of computing systems.
A study of the recoverability of computing systems.
Real-time specification patterns
Proceedings of the 27th international conference on Software engineering
IEEE Transactions on Software Engineering
Construction of Büchi Automata for LTL Model Checking Verified in Isabelle/HOL
TPHOLs '09 Proceedings of the 22nd International Conference on Theorem Proving in Higher Order Logics
A passive testing approach based on invariants: application to the WAP
Computer Networks: The International Journal of Computer and Telecommunications Networking
Patterns for Timed Property Specifications
Electronic Notes in Theoretical Computer Science (ENTCS)
On the composition of time Petri nets
Discrete Event Dynamic Systems
Specification patterns from research to industry: a case study in service-based applications
Proceedings of the 34th International Conference on Software Engineering
| Hi-index | 0.00 |
We propose a verified approach to the formal verification of timed properties using model-checking techniques. We focus on properties commonly found during the analysis of reactive systems, expressed using real-time specification patterns. We use observers in order to transform the verification of these timed patterns into the verification of simpler LTL formulas. While the use of observers for model-checking is quite common, our contribution is original in several ways. First, we define a formal framework to verify that observers are correct and non-intrusive. Second, we define different classes of observers for each pattern and use a pragmatic approach in order to select the most efficient candidate in practice. This approach is implemented in an integrated verification tool chain for the Fiacre language.