732 search results - page 74 / 147 » Axiomatising timed automata |
TIME
2007
IEEE
14 years 2 months ago
2007
IEEE
We present a symbolic algorithm for deciding safety (reachability) of timed systems modelled as Timed Automata (TA), under the notion of robustness w.r.t. infinitesimal clock-drif...
CORR
2011
Springer
12 years 11 months ago
2011
Springer
—We consider timed Petri nets, i.e., unbounded Petri nets where each token carries a real-valued clock. Transition arcs are labeled with time intervals, which specify constraints...
ICALP
2000
Springer
13 years 11 months ago
2000
Springer
In this paper we investigate timed polyhedra, i.e. polyhedra which are finite unions of full dimensional simplices of a special kind. Such polyhedra form the basis of timing analys...
TACAS
1999
Springer
13 years 12 months ago
1999
Springer
We consider the problem of computing concrete diagnostics for timed automata and reachability properties. Concrete means containing information both about the discrete state change...
FORMATS
2007
Springer
14 years 1 months ago
2007
Springer
Abstract. We present a systematic translation from timed models of genetic regulatory networks into products of timed automata to which one can apply verification tools in order l...