39 search results - page 2 / 8 » Automatic Abstraction Refinement for Timed Automata |
FMSB
2008
13 years 6 months ago
2008
In this work we develop a new technique for over-approximating (in the sense of timed trace inclusion) continuous dynamical systems by timed auThis technique refines commonly-used ...
APN
2005
Springer
13 years 7 months ago
2005
Springer
Abstract. We establish mutual translations between the classes of 1safe timed-arc Petri nets (and its extension with testing arcs) and networks of timed automata (and its subclass ...
HYBRID
2007
Springer
13 years 9 months ago
2007
Springer
Abstract. In this paper, we propose a new approach for formal verification of hybrid systems. To do so, we present a new refinement proof technique, a weak refinement using step in...
NFM
2011
13 years 2 days ago
2011
Abstract. We present a new open source model checker, opaal, for automatic verification of models using lattice automata. Lattice automata allow the users to incorporate abstracti...
ICFEM
2004
Springer
13 years 10 months ago
2004
Springer
Abstract. The integrated logic-based modeling language, Timed Communicating Object Z (TCOZ), is well suited for presenting complete and coherent requirement models for complex real...