171 search results - page 9 / 35 » Hypervolume Approximation in Timed Automata Model Checking |
STACS
2001
Springer
13 years 12 months ago
2001
Springer
Using an automata-theoretic approach, we investigate the decidability of liveness properties (called Presburger liveness properties) for timed automata when Presburger formulas on ...
FORMATS
2005
Springer
14 years 1 months ago
2005
Springer
Timed automata (TA) are a widely used model for real-time systems. Several tools are dedicated to this model, and they mostly implement a forward analysis for checking reachability...
ECBS
2010
IEEE
14 years 2 months ago
2010
IEEE
—One of the key challenges in modern real-time embedded systems is safe composition of different software components. Formal verification techniques provide the means for design...
FORMATS
2003
Springer
14 years 23 days ago
2003
Springer
Probabilistic timed automata, a variant of timed automata extended with discrete probability distributions, is a specification formalism suitable for describing both nondeterminis...
ASWEC
2007
IEEE
14 years 1 months ago
2007
IEEE
Behavior Trees (BTs) are a graphical notation used for formalising functional requirements and have been successfully applied to several case studies. However, the notation curren...