Timing assumptions and verification of finite-state concurrent systems
Proceedings of the international workshop on Automatic verification methods for finite state systems
Modeling and Verification of Time Dependent Systems Using Time Petri Nets
IEEE Transactions on Software Engineering
Theoretical Computer Science
A causal semantics for time Petri nets
Theoretical Computer Science
Equivalence of Timed State Machines and Safe TPN
WODES '02 Proceedings of the Sixth International Workshop on Discrete Event Systems (WODES'02)
A study of the recoverability of computing systems.
A study of the recoverability of computing systems.
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?
Theoretical Computer Science
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
Testing Real-Time Systems Using TINA
TESTCOM '09/FATES '09 Proceedings of the 21st IFIP WG 6.1 International Conference on Testing of Software and Communication Systems and 9th International FATES Workshop
On the composition of time Petri nets
Discrete Event Dynamic Systems
On the expressive power of timed automata and time petri nets
VECoS'08 Proceedings of the Second international conference on Verification and Evaluation of Computer and Communication Systems
On the Compared Expressiveness of Arc, Place and Transition Time Petri Nets
Fundamenta Informaticae - PETRI NETS 2007
| Hi-index | 0.00 |
In this paper, we compare Timed Automata (TA) with Time Petri Nets (TPN) with respect to weak timed bisimilarity. It is already known that the class of bounded TPNs is included in the class of TA. It is thus natural to try and identify the (strict) subclass ${\cal TA}^{wtb}$ of TA that is equivalent to TPN for the weak time bisimulation relation. We give a characterisation of this subclass and we show that the membership problem and the reachability problem for ${\cal TA}^{wtb}$ are PSPACE-complete. Furthermore we show that for a TA in ${\cal TA}^{wtb}$ with integer constants, an equivalent TPN can be built with integer bounds but with a size exponential w.r.t. the original model. Surprisingly, using rational bounds yields a TPN whose size is linear.