Sciweavers

352 search results - page 2 / 71
» Extended Timed Automata and Time Petri Nets
Sort
View
FSTTCS
2005
Springer
13 years 11 months ago
When Are Timed Automata Weakly Timed Bisimilar to Time Petri Nets?
In this paper4 , we compare Timed Automata (TA) and Time Petri Nets (TPN) with respect to weak timed bisimilarity. It is already known that the class of bounded TPNs is strictly in...
Béatrice Bérard, Franck Cassez, Serg...
CORR
2011
Springer
191views Education» more  CORR 2011»
12 years 9 months ago
Computing Optimal Coverability Costs in Priced Timed Petri Nets
—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...
Parosh Aziz Abdulla, Richard Mayr
ATVA
2009
Springer
142views Hardware» more  ATVA 2009»
13 years 9 months ago
TAPAAL: Editor, Simulator and Verifier of Timed-Arc Petri Nets
TAPAAL is a new platform independent tool for modelling, simulation and verification of timed-arc Petri nets. TAPAAL provides a stand-alone editor and simulator, while the verifica...
Joakim Byg, Kenneth Yrke Jørgensen, Jir&iac...
TACAS
2007
Springer
131views Algorithms» more  TACAS 2007»
13 years 11 months ago
From Time Petri Nets to Timed Automata: An Untimed Approach
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...
Davide D'Aprile, Susanna Donatelli, Arnaud Sangnie...
FORMATS
2005
Springer
13 years 11 months ago
Comparison of the Expressiveness of Timed Automata and Time Petri Nets
Béatrice Bérard, Franck Cassez, Serg...