58 search results - page 1 / 12 » Comparison of the Expressiveness of Timed Automata and Time ... |
FORMATS
2005
Springer
13 years 10 months ago
2005
Springer
ICFEM
2009
Springer
13 years 2 months ago
2009
Springer
Bounded timed-arc Petri nets with read-arcs were recently proven equivalent to networks of timed automata, though the Petri net model cannot express urgent behaviour and the descri...
FORMATS
2008
Springer
13 years 6 months ago
2008
Springer
Time dependant models have been intensively studied for many reasons, among others because of their applications in software verification and due to the development of embedded pla...
IANDC
2008
13 years 4 months ago
2008
Timed Petri nets and timed automata are two standard models for the analysis of real-time systems. In this paper, we prove that they are incomparable for the timed language equival...
TACAS
2007
Springer
13 years 10 months ago
2007
Springer
Abstract. Time Petri Nets (TPN) and Timed Automata (TA) are widely-used formalisms for the modeling and analysis of timed systems. A recently-developed approach for the analysis of...