49 search results - page 1 / 10 » Symbolic Model Checking of Finite Precision Timed Automata |
118
Voted
ICTAC
2005
Springer
15 years 6 months ago
2005
Springer
Abstract. This paper introduces the notion of finite precision timed automata (FPTAs) and proposes a data structure to represent its symbolic states. To reduce the state space, FP...
128
click to vote
FORMATS
2004
Springer
15 years 6 months ago
2004
Springer
Probabilistic timed automata are timed automata extended with discrete probability distributions, and can be used to model timed randomised protocols or faulttolerant systems. We ...
125
Voted
CAV
2003
Springer
15 years 6 months ago
2003
Springer
109
Voted
FORMATS
2004
Springer
15 years 6 months ago
2004
Springer
We study the model-checking problem for weighted timed automata and the weighted CTL logic by the bisimulation approach. Weighted timed automata are timed automata extended with co...
128
Voted
FORMATS
2006
Springer
15 years 4 months ago
2006
Springer
In this paper we describe an extension of timed automata with priorities, and efficient algorithms to compute subtraction on DBMs (difference bounded matrices), needed in symbolic ...