Reduction and covering of infinite reachability trees
Information and Computation
Time-based expressivity of timed Petri nets for system specification
Theoretical Computer Science
Petri Net Theory and the Modeling of Systems
Petri Net Theory and the Modeling of Systems
From timed Petri nets to timed LOTOS
Proceedings of the IFIP WG6.1 Tenth International Symposium on Protocol Specification, Testing and Verification X
On Petri Nets with Stochastic Timing
International Workshop on Timed Petri Nets
TIC: A Timed Calculus for LOTOS
FORTE '89 Proceedings of the IFIP TC/WG6.1 Second International Conference on Formal Description Techniques for Distributed Systems and Communication Protocols
Reset Nets Between Decidability and Undecidability
ICALP '98 Proceedings of the 25th International Colloquium on Automata, Languages and Programming
Fundamental Structures in Well-Structured Infinite Transition Systems
LATIN '98 Proceedings of the Third Latin American Symposium on Theoretical Informatics
Use of Petri Nets for Performance Evaluation
Proceedings of the Third International Symposium on Measuring, Modelling and Evaluating Computer Systems
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
Interval Timed Coloured Petri Nets and their Analysis
Proceedings of the 14th International Conference on Application and Theory of Petri Nets
General decidability theorems for infinite-state systems
LICS '96 Proceedings of the 11th Annual IEEE Symposium on Logic in Computer Science
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
A study of the recoverability of computing systems.
A study of the recoverability of computing systems.
Note on the Tableau Technique for Commutative Transition Systems
FoSSaCS '02 Proceedings of the 5th International Conference on Foundations of Software Science and Computation Structures
Decidability of Safety Properties of Timed Multiset Rewriting
FTRTFT '02 Proceedings of the 7th International Symposium on Formal Techniques in Real-Time and Fault-Tolerant Systems: Co-sponsored by IFIP WG 2.2
Properties of Distributed Timed-Arc Petri Nets
FST TCS '01 Proceedings of the 21st Conference on Foundations of Software Technology and Theoretical Computer Science
ICATPN '01 Proceedings of the 22nd International Conference on Application and Theory of Petri Nets
Towards a Notion of Distributed Time for Petri Nets
ICATPN '01 Proceedings of the 22nd International Conference on Application and Theory of Petri Nets
Translating TPAL Specifications into Timed-Arc Petri Nets
ICATPN '02 Proceedings of the 23rd International Conference on Applications and Theory of Petri Nets
A translation of TPALp into a class of timed-probabilistic Petri nets
Theoretical Computer Science
Model Checking of Time Petri Nets Using the State Class Timed Automaton
Discrete Event Dynamic Systems
State space computation and analysis of Time Petri Nets
Theory and Practice of Logic Programming
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
Minimal Cost Reachability/Coverability in Priced Timed Petri Nets
FOSSACS '09 Proceedings of the 12th International Conference on Foundations of Software Science and Computational Structures: Held as Part of the Joint European Conferences on Theory and Practice of Software, ETAPS 2009
Weak Time Petri Nets Strike Back!
CONCUR 2009 Proceedings of the 20th International Conference on Concurrency Theory
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
Structural Translation from Time Petri Nets to Timed Automata
Electronic Notes in Theoretical Computer Science (ENTCS)
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
Verification of timed-arc Petri nets
SOFSEM'11 Proceedings of the 37th international conference on Current trends in theory and practice of computer science
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
Timed-arc petri nets vs. networks of timed automata
ICATPN'05 Proceedings of the 26th international conference on Applications and Theory of Petri Nets
Decidability of zenoness, syntactic boundedness and token-liveness for dense-timed petri nets
FSTTCS'04 Proceedings of the 24th international conference on Foundations of Software Technology and Theoretical Computer Science
On the Compared Expressiveness of Arc, Place and Transition Time Petri Nets
Fundamenta Informaticae - PETRI NETS 2007
The expressive power of time Petri nets
Theoretical Computer Science
| Hi-index | 0.00 |
Timed-arc Petri nets (TAPN's) are not Turing powerful, because, in particular, they cannot simulate a counter with zero testing. Thus, we could think that this model does not increase significantly the expressiveness of untimed Petri nets. But this is not true; in a previous paper we have shown that the differences between them are big enough to make the reachability problem undecidable. On the other hand, coverability and boundedness are proved now to be decidable. This fact is a consequence of the close interrelationship between TAPN's and transfer nets, for which similar results have been recently proved. Finally, we see that if dead tokens are defined as those that cannot be used for firing any transition in the future, we can detect these kind of tokens in an effective way.