9 search results - page 1 / 2 » Efficient Computation and Representation of Large Reachabili... |
DEDS
2002
13 years 7 months ago
2002
We propose an approach that integrates and extends known techniques from different areas to handle and analyze a complex and large system described as a network of synchronized com...
FORMATS
2009
Springer
13 years 11 months ago
2009
Springer
Probabilistic timed automata (PTAs) are used for formal modelling and verification of systems with probabilistic, nondeterministic and real-time behaviour. For non-probabilistic ti...
CAV
2004
Springer
13 years 11 months ago
2004
Springer
Abstract. The existence of functional dependency among the state variables of a state transition system was identified as a common cause of inefficient BDD representation in formal...
ASMTA
2008
Springer
13 years 9 months ago
2008
Springer
The solution of continuous and discrete-time Markovian models is still challenging mainly when we model large complex systems, for example, to obtain performance indexes of paralle...
CAV
2005
Springer
14 years 29 days 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 ...