321 search results - page 24 / 65 » Symbolic Model Checking for Probabilistic Timed Automata |
107
click to vote
FORMATS
2009
Springer
15 years 8 months ago
2009
Springer
Recently, the model of weighted timed automata has gained interest within the real-time community. In a previous work, we built a bridge to the theory of weighted automata and intr...
114
click to vote
IJFCS
2006
15 years 1 months ago
2006
For successful software verification, model checkers must be capable of handling a large number of program variables. Traditional, BDD-based model checking is deficient in this re...
132
click to vote
RTCSA
1999
IEEE
15 years 6 months ago
1999
IEEE
ASTRAL is a high-level formal specification language for real-time (infinite state) systems. It is provided with structuring mechanisms that allow one to build modularized specifi...
123
click to vote
ICFEM
2009
Springer
14 years 11 months ago
2009
Springer
In this paper we continue the study of a strict extension of the Computation Tree Logic, called graded-CTL, recently introduced by the same authors. This new logic augments the sta...
109
click to vote
FSEN
2007
Springer
15 years 8 months ago
2007
Springer
Abstract. During the last years, timed automata have become a popular model for describing the behaviour of real-time systems. In particular, there has been much research on proble...