149 search results - page 10 / 30 » SAT-based Unbounded Model Checking of Timed Automata |
170
click to vote
PRDC
2007
IEEE
16 years 3 days ago
2007
IEEE
Consensus is one of the most fundamental problems in fault-tolerant distributed computing. This paper proposes a mechanical method for analyzing the condition that allows one to s...
144
click to vote
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
click to vote
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
click to vote
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
click to vote
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...