Finite transition systems: semantics of communicating systems
Finite transition systems: semantics of communicating systems
Theoretical Computer Science
Complexity results for 1-safe nets
Theoretical Computer Science
Characterization of the expressive power of silent transitions in timed automata
Fundamenta Informaticae
Process semantics for place/transition nets with inhibitor and read arcs
Fundamenta Informaticae - Special issue prepared in tribute to Peter Ernst on the occasion of his retirement
Partial order semantics and read arcs
Theoretical Computer Science
From timed Petri nets to timed LOTOS
Proceedings of the IFIP WG6.1 Tenth International Symposium on Protocol Specification, Testing and Verification X
CMC: A Tool for Compositional Model-Checking of Real-Time Systems
FORTE XI / PSTV XVIII '98 Proceedings of the FIP TC6 WG6.1 Joint International Conference on Formal Description Techniques for Distributed Systems and Communication Protocols (FORTE XI) and Protocol Specification, Testing and Verification (PSTV XVIII)
STACS '03 Proceedings of the 20th Annual Symposium on Theoretical Aspects of Computer Science
Compositional Specification of Timed Systems (Extended Abstract)
STACS '96 Proceedings of the 13th Annual Symposium on Theoretical Aspects of Computer Science
Modeling Urgency in Timed Systems
COMPOS'97 Revised Lectures from the International Symposium on Compositionality: The Significant Difference
On Model Checking Durational Kripke Structures
FoSSaCS '02 Proceedings of the 5th International Conference on Foundations of Software Science and Computation Structures
Properties of Distributed Timed-Arc Petri Nets
FST TCS '01 Proceedings of the 21st Conference on Foundations of Software Technology and Theoretical Computer Science
Kronos: A Model-Checking Tool for Real-Time Systems
CAV '98 Proceedings of the 10th International Conference on Computer Aided Verification
ICATPN '01 Proceedings of the 22nd International Conference on Application and Theory of Petri Nets
Analysis of Place/Transition Nets with Timed Arcs and its Application to Batch Process Control
Proceedings of the 14th International Conference on Application and Theory of Petri Nets
Non Equivalence between Time Petri Nets and Time Stream Petri Nets
PNPM '99 Proceedings of the The 8th International Workshop on Petri Nets and Performance Models
On Non-Decidability of Reachability for Timed-Arc Petri Nets
PNPM '99 Proceedings of the The 8th International Workshop on Petri Nets and Performance Models
Equivalence of Timed State Machines and Safe TPN
WODES '02 Proceedings of the Sixth International Workshop on Discrete Event Systems (WODES'02)
Lower bounds for natural proof systems
SFCS '77 Proceedings of the 18th Annual Symposium on Foundations of Computer Science
Decidability of properties of timed-arc Petri nets
ICATPN'00 Proceedings of the 21st international conference on Application and theory of petri nets
Timed Petri nets and timed automata: On the discriminating power of zeno sequences
Information and Computation
Comparing the Expressiveness of Timed Automata and Timed Extensions of Petri Nets
FORMATS '08 Proceedings of the 6th international conference on Formal Modeling and Analysis of Timed Systems
On the Compared Expressiveness of Arc, Place and Transition Time Petri Nets
Fundamenta Informaticae - PETRI NETS 2007
TAPAAL: Editor, Simulator and Verifier of Timed-Arc Petri Nets
ATVA '09 Proceedings of the 7th International Symposium on Automated Technology for Verification and Analysis
An Efficient Translation of Timed-Arc Petri Nets to Networks of Timed Automata
ICFEM '09 Proceedings of the 11th International Conference on Formal Engineering Methods: Formal Methods and Software Engineering
Comparison of the expressiveness of arc, place and transition time Petri nets
ICATPN'07 Proceedings of the 28th international conference on Applications and theory of Petri nets and other models of concurrency
A framework for relating timed transition systems and preserving TCTL model checking
EPEW'10 Proceedings of the 7th European performance engineering conference on Computer performance engineering
Verification of timed-arc Petri nets
SOFSEM'11 Proceedings of the 37th international conference on Current trends in theory and practice of computer science
Timed petri nets and timed automata: on the discriminating power of zeno sequences
ICALP'06 Proceedings of the 33rd international conference on Automata, Languages and Programming - Volume Part II
TAPAAL 2.0: integrated development environment for timed-arc petri nets
TACAS'12 Proceedings of the 18th international conference on Tools and Algorithms for the Construction and Analysis of Systems
On the Compared Expressiveness of Arc, Place and Transition Time Petri Nets
Fundamenta Informaticae - PETRI NETS 2007
| Hi-index | 0.00 |
We establish mutual translations between the classes of 1-safe timed-arc Petri nets (and its extension with testing arcs) and networks of timed automata (and its subclass where every clock used in the guard has to be reset). The presented translations are very tight (up to isomorphism of labelled transition systems with time). This provides a convenient characterization from the theoretical point of view but is not always satisfactory from the practical point of view because of the possible non-polynomial blow up in the size (in the direction from automata to nets). Hence we relax the isomorphism requirement and provide efficient (polynomial time) reductions between networks of timed automata and 1-safe timed-arc Petri nets preserving the answer to the reachability question. This makes our techniques suitable for automatic translation into a format required by tools like UPPAAL and KRONOS. A direct corollary of the presented reductions is a new PSPACE-completeness result for reachability in 1-safe timed-arc Petri nets, reusing the region/zone techniques already developed for timed automata.