321 search results - page 23 / 65 » Symbolic Model Checking for Probabilistic Timed Automata |
FORMATS
2009
Springer
14 years 18 days 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...
RTSS
1999
IEEE
14 years 1 months ago
1999
IEEE
This paper presents a process algebra for specifying soft real-time constraints in a compositional way. For these soft constraints we take a stochastic point of view and allow arb...
ENTCS
2006
13 years 8 months ago
2006
In previous work we have developed a syntactic reduction of repeated reachability to reachability for finite state systems. This may lead to simpler and more uniform proofs for mo...
FDL
2003
IEEE
14 years 2 months ago
2003
IEEE
Assuring correctness of digital designs is one of the major tasks in the system design flow. Formal methods have been proposed to accompany commonly used simulation approaches. I...
CAV
2003
Springer
14 years 11 days ago
2003
Springer
Thispapergivesashort overviewofa model checking tool forreal-time systems. The modeling language are timed automata extended with concepts for modular modeling. The tool provides r...