171 search results - page 1 / 35 » Hypervolume Approximation in Timed Automata Model Checking |
FORMATS
2007
Springer
13 years 11 months ago
2007
Springer
Dierence Bound Matrices (DBMs) are the most commonly used data structure for model checking timed automata. Since long they are being used in successful tools like Kronos or UPPAA...
QEST
2008
IEEE
13 years 11 months ago
2008
IEEE
In [3] a probabilistic semantics for timed automata has been defined in order to rule out unlikely (sequences of) events. The qualitative model-checking problem for LTL propertie...
FORMATS
2004
Springer
13 years 10 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...
IJCSA
2007
13 years 4 months ago
2007
Timed Concurrent State Machines are an application of Alur’s Timed Automata concept to coincidence-based (rather than interleaving) CSM modeling technique. TCSM support the idea...
ENTCS
2006
13 years 4 months ago
2006
In this paper, we present weighted/priced timed automata, an extension of timed automaton with costs, and solve several interesting problems on that model. Key words: Weighted/pri...