171 search results - page 9 / 35 » Hypervolume Approximation in Timed Automata Model Checking |
161
Voted
STACS
2001
Springer
15 years 10 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 ...
144
Voted
FORMATS
2005
Springer
15 years 11 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...
170
Voted
ECBS
2010
IEEE
16 years 21 days 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...
187
Voted
FORMATS
2003
Springer
15 years 11 months 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...
177
Voted
ASWEC
2007
IEEE
16 years 5 days 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...