Time Recursive Petri Nets

Authors:
Djaouida Dahmani;Jean-Michel Ilié;Malika Boukala
Affiliations:
LSI, Computer Science Department, USTHB, Algiers, Algeria;LIP6 Laboratory UPMC, Universite Paris-Descartes, France;LSI, Computer Science Department, USTHB, Algiers, Algeria
Venue:
Transactions on Petri Nets and Other Models of Concurrency I
Year:
2008

Citing 9
Cited 0

Modeling and Verification of Time Dependent Systems Using Time Petri Nets

IEEE Transactions on Software Engineering
Theoretical Aspects of Recursive Petri Nets

Proceedings of the 20th 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
Semantics of Control-Flow in UML 2.0 Activities

VLHCC '04 Proceedings of the 2004 IEEE Symposium on Visual Languages - Human Centric Computing
State space computation and analysis of Time Petri Nets

Theory and Practice of Logic Programming
Extended Timed Automata and Time Petri Nets

ACSD '06 Proceedings of the Sixth International Conference on Application of Concurrency to System Design
Recursive Petri nets: Theory and application to discrete event systems

Acta Informatica
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
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

Quantified Score

Hi-index	0.00

Visualization

Abstract

We propose an extension of Recursive Petri Nets (TRPNs) based on the semantics of the Time Petri Nets (TPNs). TRPNs are well suited for analyzing and modeling timing requirements of complex discrete event system and allow to represent a model at different levels of abstraction. We give a formal semantics of this extended model and show that TRPNs are more expressive than TPNs. Moreover, we propose a method for building a specific state class graph that can be used to analyze timing properties efficiently.