Modeling and Verification of Time Dependent Systems Using Time Petri Nets
IEEE Transactions on Software Engineering
Theoretical Computer Science
Modeling Urgency in Timed Systems
COMPOS'97 Revised Lectures from the International Symposium on Compositionality: The Significant Difference
CAV '99 Proceedings of the 11th International Conference on Computer Aided Verification
Model-Checking for Real-Time Systems
FCT '95 Proceedings of the 10th International Symposium on Fundamentals of Computation Theory
Equivalence of Timed State Machines and Safe TPN
WODES '02 Proceedings of the Sixth International Workshop on Discrete Event Systems (WODES'02)
PETRI NET LANGUAGE
The coarsest congruence for timed automata with deadlines contained in bisimulation
CONCUR 2005 - Concurrency Theory
Extended Timed Automata and Time Petri Nets
ACSD '06 Proceedings of the Sixth International Conference on Application of Concurrency to System Design
State class constructions for branching analysis of time Petri nets
TACAS'03 Proceedings of the 9th international conference on Tools and algorithms for the construction and analysis of systems
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
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
Parallel Processes with Real-Time and Data: The ATLANTIF Intermediate Format
IFM '09 Proceedings of the 7th International Conference on Integrated Formal Methods
Towards Parametric Verification of Prioritized Time Petri Nets
PaCT '09 Proceedings of the 10th International Conference on Parallel Computing Technologies
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
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
Expressiveness of Petri Nets with Stopwatches. Dense-time Part
Fundamenta Informaticae
Expressiveness of Petri Nets with Stopwatches. Discrete-time Part
Fundamenta Informaticae
Model checking bounded prioritized time Petri nets
ATVA'07 Proceedings of the 5th international conference on Automated technology for verification and analysis
A framework for relating timed transition systems and preserving TCTL model checking
EPEW'10 Proceedings of the 7th European performance engineering conference on Computer performance engineering
Verification of timed-arc Petri nets
SOFSEM'11 Proceedings of the 37th international conference on Current trends in theory and practice of computer science
On the composition of time Petri nets
Discrete Event Dynamic Systems
Specification and verification of real-time systems using POLA
International Journal of Critical Computer-Based Systems
Compositional specification of real time embedded systems by priority time Petri Nets
The Journal of Supercomputing
Specification and verification of real-time systems using the POLA tool
VECoS'09 Proceedings of the Third international conference on Verification and Evaluation of Computer and Communication Systems
Expressiveness of Petri Nets with Stopwatches. Dense-time Part
Fundamenta Informaticae
Expressiveness of Petri Nets with Stopwatches. Discrete-time Part
Fundamenta Informaticae
Mixing Workflows and Components to Support Evolving Services
International Journal of Adaptive, Resilient and Autonomic Systems
The expressive power of time Petri nets
Theoretical Computer Science
| Hi-index | 0.00 |
Several recent papers investigate the relative expressiveness of Timed Automata and Time Petri Nets, two widespread models for realtime systems. It has been shown notably that Timed Automata and Bounded Time Petri Nets are equally expressive in terms of timed language acceptance, but that Timed Automata are strictly more expressive in terms of weak timed bisimilarity. This paper compares Timed Automata with Bounded Time Petri Nets extended with static Priorities, and shows that two large subsets of these models are equally expressive in terms of weak timed bisimilarity.