921 search results - page 49 / 185 » On Interleaving in Timed Automata |
138
click to vote
CONCUR
2004
Springer
15 years 11 months ago
2004
Springer
In this paper, we study model checking of timed automata (TAs), and more precisely we aim at finding efficient model checking for subclasses of TAs. For this, we consider model ch...
136
click to vote
FMSD
2007
15 years 6 months ago
2007
We study the cost-optimal reachability problem for weighted timed automata such that positive and negative costs are allowed on edges and locations. By optimality, we mean an infi...
150
click to vote
FORMATS
2007
Springer
16 years 11 days 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...
184
click to vote
CONCUR
2005
Springer
15 years 11 months ago
2005
Springer
The context of this study is timed temporal logics for timed automata. In this paper, we propose an extension of the classical logic TCTL with a new Until modality, called “Until...
146
click to vote
MEMOCODE
2006
IEEE
16 years 6 days ago
2006
IEEE
Timed I/O Automata (TIOA) is a mathematical framework for modeling and verification of distributed systems that involve discrete and continuous dynamics. TIOA can be used for exa...