321 search results - page 6 / 65 » Symbolic Model Checking for Probabilistic Timed Automata |
ETFA
2006
IEEE
14 years 2 months ago
2006
IEEE
New technological trends lead to the increasing use of network technologies in automation. Especially the Ethernet with TCP/IP and wireless networks find growing acceptance. The r...
ECBS
2009
IEEE
14 years 3 months ago
2009
IEEE
Probabilistic models are useful for analyzing systems which operate under the presence of uncertainty. In this paper, we present a technique for verifying safety and liveness prop...
CAV
2005
Springer
14 years 2 months ago
2005
Springer
In this work we study hybrid approaches to LTL symbolic model checking; that is, approaches that use explicit representations of the property automaton, whose state space is often ...
ATVA
2006
Springer
14 years 15 days ago
2006
Springer
Generic representatives have been proposed for the effective combination of symmetry reduction and symbolic representation with BDDs in non-probabilistic model checking. This appro...
LICS
1998
IEEE
14 years 11 days ago
1998
IEEE
Probabilistic I/O automata (PIOA) constitute a model for distributed or concurrent systems that incorporates a notion of probabilistic choice. The PIOA model provides a notion of ...