259 search results - page 14 / 52 » Bounded Model Checking for Timed Automata |
ATAL
2005
Springer
15 years 3 months ago
2005
Springer
We present an approach to the verification of temporal epistemic properties in synchronous multi-agent systems (MAS) via bounded model checking (BMC). Based on the semantics of s...
ECBS
2010
IEEE
15 years 4 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...
ATVA
2007
Springer
15 years 1 months ago
2007
Springer
FORMATS
2003
Springer
15 years 2 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...
FUIN
2006
14 years 9 months ago
2006
Abstract. We analyse different versions of the Dining Cryptographers protocol by means of automatic verification via model checking. Specifically we model the protocol in terms of ...