Modeling and Verification of Time Dependent Systems Using Time Petri Nets
IEEE Transactions on Software Engineering
Finite transition systems: semantics of communicating systems
Finite transition systems: semantics of communicating systems
Model-checking in dense real-time
Information and Computation - Special issue: selections from 1990 IEEE symposium on logic in computer science
Symbolic model checking for real-time systems
Information and Computation
Static Analysis and Dynamic Steering of Time-Dependent Systems
IEEE Transactions on Software Engineering
Compositional Specification of Timed Systems (Extended Abstract)
STACS '96 Proceedings of the 13th Annual Symposium on Theoretical Aspects of Computer Science
Time Stream Petri Nets: A Model for Timed Multimedia Information
Proceedings of the 15th International Conference on Application and Theory of Petri Nets
Model-Checking for Real-Time Systems
FCT '95 Proceedings of the 10th International Symposium on Fundamentals of Computation Theory
Time Constraints Verification Methods Based on Time Petri Nets
FTDCS '97 Proceedings of the 6th IEEE Workshop on Future Trends of Distributed Computing Systems
Multi-Workshop on Formal Methods in Performance Evaluation and Applications
PNPM '99 Proceedings of the The 8th International Workshop on Petri Nets and Performance Models
Reducing the number of clock variables of timed automata
RTSS '96 Proceedings of the 17th IEEE Real-Time Systems Symposium
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.
State space computation and analysis of Time Petri Nets
Theory and Practice of Logic Programming
Decidability of properties of timed-arc Petri nets
ICATPN'00 Proceedings of the 21st international conference on Application and theory of petri nets
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
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
Fundamenta Informaticae - Application of Concurrency to System Design, the Sixth Special Issue
Formal verification of real-time systems with preemptive scheduling
Real-Time Systems
From time Petri nets to timed automata: an untimed approach
TACAS'07 Proceedings of the 13th international conference on Tools and algorithms for the construction and analysis of systems
Modeling and verification of hybrid dynamic systems using multisingular hybrid Petri nets
Theoretical Computer Science
A concurrency-preserving translation from time Petri nets to networks of timed automata
Formal Methods in System Design
Fundamenta Informaticae - Application of Concurrency to System Design, the Sixth Special Issue
Robustness of time petri nets under guard enlargement
RP'12 Proceedings of the 6th international conference on Reachability Problems
Robustness of time petri nets under architectural constraints
FORMATS'12 Proceedings of the 10th international conference on Formal Modeling and Analysis of Timed Systems
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
Symbolic unfolding of parametric stopwatch Petri nets
Formal Methods in System Design
| Hi-index | 0.00 |
In this paper, we propose a method for building the state class graph of a bounded time Petri net (TPN) as a timed automaton (TA), which we call the state class timed automaton. We consider bounded TPN, whose underlying net is not necessarily bounded. We prove that our translation preserves the behavioral semantics of the TPN (the initial TPN and the obtained TA are proved timed-bisimilar). It allows us to check real-time properties on TPN by using the state class TA. This can be done efficiently thanks to a reduction of the number of clocks. We have implemented the method, and give some experimental results illustrating the efficiency of the translation algorithm in terms of number of clocks. Using the state class TA, we also give a framework for expressing and efficiently verifying TCTL properties on the initial TPN.