Modeling and Verification of Time Dependent Systems Using Time Petri Nets
IEEE Transactions on Software Engineering
Time-based expressivity of timed Petri nets for system specification
Theoretical Computer Science
A causal semantics for time Petri nets
Theoretical Computer Science
Performance Evaluation of Systems Using Nets
Proceedings of the Advanced Course on General Net Theory of Processes and Systems: Net Theory and Applications
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
Multiple Enabledness of Transitions in Petri Nets with Time
PNPM '01 Proceedings of the 9th international Workshop on Petri Nets and Performance Models (PNPM'01)
ANALYSIS OF ASYNCHRONOUS CONCURRENT SYSTEMS BY TIMED PETRI NETS
ANALYSIS OF ASYNCHRONOUS CONCURRENT SYSTEMS BY TIMED PETRI NETS
A study of the recoverability of computing systems.
A study of the recoverability of computing systems.
Decidability of properties of timed-arc Petri nets
ICATPN'00 Proceedings of the 21st international conference on Application and theory of petri nets
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
Comparison of different semantics for time petri nets
ATVA'05 Proceedings of the Third international conference on Automated Technology for Verification and Analysis
Comparison of the expressiveness of timed automata and time petri nets
FORMATS'05 Proceedings of the Third international conference on Formal Modeling and Analysis of Timed Systems
When are timed automata weakly timed bisimilar to time petri nets?
FSTTCS '05 Proceedings of the 25th international conference on Foundations of Software Technology and Theoretical Computer Science
Timed-arc petri nets vs. networks of timed automata
ICATPN'05 Proceedings of the 26th international conference on Applications and Theory of Petri Nets
Weak Time Petri Nets Strike Back!
CONCUR 2009 Proceedings of the 20th International Conference on Concurrency Theory
Expressiveness of Petri Nets with Stopwatches. Dense-time Part
Fundamenta Informaticae
Expressiveness of Petri Nets with Stopwatches. Discrete-time Part
Fundamenta Informaticae
Expressiveness of Petri Nets with Stopwatches. Dense-time Part
Fundamenta Informaticae
Expressiveness of Petri Nets with Stopwatches. Discrete-time Part
Fundamenta Informaticae
Avoiding shared clocks in networks of timed automata
CONCUR'12 Proceedings of the 23rd international conference on Concurrency Theory
The expressive power of time Petri nets
Theoretical Computer Science
Robust control strategies facing disturbances in manufacturing workshops with time constraints
Computers and Industrial Engineering
The right timing: reflections on the modeling and analysis of time
PETRI NETS'13 Proceedings of the 34th international conference on Application and Theory of Petri Nets and Concurrency
On multi-enabledness in time Petri nets
PETRI NETS'13 Proceedings of the 34th international conference on Application and Theory of Petri Nets and Concurrency
Discrete Event Dynamic Systems
| Hi-index | 0.00 |
In this paper, we consider safe Time Petri Nets where time intervals (strict and large) are associated with places (P-TPN), arcs (A-TPN) or transitions (T-TPN). We give the formal strong and weak semantics of these models in terms of Timed Transition Systems. We compare the expressiveness of the six models w.r.t. (weak) timed bisimilarity (behavioral semantics). The main results of the paper are : (i) with strong semantics, A-TPN is strictly more expressive than P-TPN and T-TPN ; (ii) with strong semantics P-TPN and T-TPN are incomparable ; (iii) T-TPN with strong semantics and T-TPN with weak semantics are incomparable. Moreover, we give a complete classification by a set of 9 relations explained in Fig. 19 (p. 247).