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
Transactions on Petri Nets and Other Models of Concurrency I
Towards Building the State Class Graph of the TSPN Model
Fundamenta Informaticae
Protocol Performance Analysis Using a Timed Extension for an Object Oriented Petri Net Language
Electronic Notes in Theoretical Computer Science (ENTCS)
Using time stream Petri nets over a service architecture for workflow modelling and enactment
SpringSim '10 Proceedings of the 2010 Spring Simulation Multiconference
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
Towards Building the State Class Graph of the TSPN Model
Fundamenta Informaticae
| Hi-index | 0.00 |
It had been shown that Merlin's Time Petri Nets are a special case of Time Stream Petri Nets. In this paper, we show that it does not exist a time equivalence between both models. We extend first this result to the nonequivalence of Timed Automata and Time Petri Nets and second to the nonequivalence of Timed Link Petri Net and Timed Transition Petri Net.