scholarly journals Efficient model-checking of dense-time systems with time-convexity analysis

2013 ◽  
Vol 467 ◽  
pp. 89-108 ◽  
Author(s):  
Farn Wang
Keyword(s):  
Model Checking ◽  
Convexity Analysis ◽  
Time Systems

scholarly journals Symbolic Model Checking for Real-Time Systems

1994 ◽  
Vol 111 (2) ◽  
pp. 193-244 ◽  
Author(s):  
T.A. Henzinger ◽  
X. Nicollin ◽  
J. Sifakis ◽  
S. Yovine
Keyword(s):  
Model Checking ◽  
Real Time ◽  
Symbolic Model Checking ◽  
Real Time Systems ◽  
Symbolic Model ◽  
Time Systems

scholarly journals Model Checking via Reachability Testing for Timed Automata

1997 ◽  
Vol 4 (29) ◽  
Author(s):  
Luca Aceto ◽  
Augusto Burgueno ◽  
Kim G. Larsen
Keyword(s):  
Model Checking ◽  
Timed Automata ◽  
Reachability Problem ◽  
Liveness Properties ◽  
Time Logic ◽  
Definition Of ◽  
Reachability Testing ◽  
Time Systems ◽  
Timed Automaton ◽  
Theoretical Side

In this paper we develop an approach to model-checking for timed automata via reachability testing. As our specification formalism, we consider a dense-time logic with clocks. This logic may be used to express safety and bounded liveness properties of real-time systems. We show how to automatically synthesize, for every logical formula phi, a so-called test automaton T_phi in such a way that checking whether a system S satisfies the property phi can be reduced to a reachability question over the system obtained by making T_phi interact with S. <br />The testable logic we consider is both of practical and theoretical interest. On the practical side, we have used the logic, and the associated approach to model-checking via reachability testing it supports, in the specification and verification in Uppaal of a collision avoidance protocol. On the theoretical side, we show that the logic is powerful enough to permit the definition of characteristic properties, with respect to a timed version of<br />the ready simulation preorder, for nodes of deterministic, tau-free timed automata. This allows one to compute behavioural relations via our model-checking technique, therefore effectively reducing the problem of checking the existence of a behavioural relation among states of a timed automaton to a reachability problem.

KRONOS — Model Checking of Real-time Systems

2001 ◽  
pp. 161-168
Author(s):  
Béatrice Bérard ◽  
Michel Bidoit ◽  
Alain Finkel ◽  
François Laroussinie ◽  
Antoine Petit ◽  
...  
Keyword(s):  
Model Checking ◽  
Real Time ◽  
Real Time Systems ◽  
Time Systems

scholarly journals Model Checking Process Algebra of Communicating Resources for Real-Time Systems

2014 ◽  
Author(s):  
A. Jalil Boudjadar ◽  
Jin Hyun Kim ◽  
Kim G. Larsen ◽  
Ulrik Nyman
Keyword(s):  
Model Checking ◽  
Real Time ◽  
Process Algebra ◽  
Real Time Systems ◽  
Time Systems
Sign in / Sign up

Export Citation Format

Share Document