Model-checking in dense real-time
Information and Computation - Special issue: selections from 1990 IEEE symposium on logic in computer science
Evolving algebras 1993: Lipari guide
Specification and validation methods
What's decidable about hybrid automata?
Journal of Computer and System Sciences
Introduction To Automata Theory, Languages, And Computation
Introduction To Automata Theory, Languages, And Computation
Relating Time Progress and Deadlines in Hybrid Systems
HART '97 Proceedings of the International Workshop on Hybrid and Real-Time Systems
SDL'11 Proceedings of the 15th international conference on Integrating System and Software Modeling
SDL'11 Proceedings of the 15th international conference on Integrating System and Software Modeling
Hi-index | 0.00 |
We describe an approach for the verification of quantitative temporal properties of SDL specifications, which adapts techniques developed for timed automata [2]. With respect to other verification approaches applied to SDL, our approach broadens the class of analyzable specifications and improves the handling of non-deterministic systems, such as open systems communicating with an unspecified environment. Compared to the initial framework of timed automata, the application of these verification techniques to SDL raises two interesting issues, discussed in the paper. They are: expressing the semantics of time in SDL in terms of timed automata concepts, and employing a user friendly automata-based property specification language (GOAL [1]) to express and verify temporal properties. The paper also presents a verification tool prototype for SDL which implements these ideas.