Sciweavers

45 search results - page 1 / 9
» From Time Petri Nets to Timed Automata: An Untimed Approach
Sort
View
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...
ENTCS
2002
91views more  ENTCS 2002»
13 years 4 months ago
Petri nets with causal time for system verification
We present a new approach to the modelling of time constrained systems. It is based on untimed high-level Petri nets using the concept of causal time. With this concept, the progr...
Cécile Bui Thanh, Hanna Klaudel, Franck Pom...
FORMATS
2008
Springer
13 years 6 months ago
Comparing the Expressiveness of Timed Automata and Timed Extensions of Petri Nets
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...
Jirí Srba
ICFEM
2009
Springer
13 years 2 months ago
An Efficient Translation of Timed-Arc Petri Nets to Networks of Timed Automata
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...
Joakim Byg, Kenneth Yrke Jørgensen, Jir&iac...
APN
2005
Springer
13 years 6 months ago
Timed-Arc Petri Nets vs. Networks of Timed Automata
Abstract. We establish mutual translations between the classes of 1safe timed-arc Petri nets (and its extension with testing arcs) and networks of timed automata (and its subclass ...
Jirí Srba