585 search results - page 4 / 117 » Better Abstractions for Timed Automata |
126
click to vote
FORMATS
2010
Springer
14 years 10 months ago
2010
Springer
Abstract. Probabilistic timed automata are an extension of timed automata with discrete probability distributions. Simulation and bisimulation relations are widely-studied in the c...
126
click to vote
TCS
2010
14 years 7 months ago
2010
We are interested in describing timed systems that exhibit probabilistic behaviour. To this purpose, we consider a model of Probabilistic Timed Automata and introduce a concept of ...
94
Voted
WIA
2000
Springer
15 years 3 months ago
2000
Springer
Abstract. We describe a general automata-theoretic approach for analyzing the verification problems (binary reachability, safety, etc.) of discrete timed automata augmented with va...
95
Voted
ICALP
2007
Springer
15 years 6 months ago
2007
Springer
d Abstract) Marcin Jurdzi´nski and Ashutosh Trivedi Department of Computer Science, University of Warwick, UK In a reachability-time game, players Min and Max choose moves so that...
FOSSACS
2009
Springer
15 years 7 months ago
2009
Springer
Abstract. In this work, we introduce the class of Interrupt Timed Automata (ITA), which are well suited to the description of multi-task systems with interruptions in a single proc...