Modeling and Verification of Time Dependent Systems Using Time Petri Nets
IEEE Transactions on Software Engineering
Theoretical Computer Science
Representing and modeling digital circuits
Representing and modeling digital circuits
Ensuring completeness of symbolic verification methods for infinite-state systems
Theoretical Computer Science
Verification of embedded systems using a petri net based representation
ISSS '00 Proceedings of the 13th international symposium on System synthesis
Fundamental Structures in Well-Structured Infinite Transition Systems
LATIN '98 Proceedings of the Third Latin American Symposium on Theoretical Informatics
STACS '03 Proceedings of the 20th Annual Symposium on Theoretical Aspects of Computer Science
Automatic Verification of Timed Circuits
CAV '94 Proceedings of the 6th International Conference on Computer Aided Verification
Time Stream Petri Nets: A Model for Timed Multimedia Information
Proceedings of the 15th International Conference on Application and Theory of Petri Nets
Time Constraints Verification Methods Based on Time Petri Nets
FTDCS '97 Proceedings of the 6th IEEE Workshop on Future Trends of Distributed Computing Systems
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.
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
Model Checking of Time Petri Nets Using the State Class Timed Automaton
Discrete Event Dynamic Systems
Symbolic State Space of Stopwatch Petri Nets with Discrete-Time Semantics (Theory Paper)
PETRI NETS '08 Proceedings of the 29th international conference on Applications and Theory of Petri Nets
Relevant Timed Schedules / Clock Valuations for Constructing Time Petri Net Reachability Graphs
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
Fundamenta Informaticae - Application of Concurrency to System Design, the Sixth Special Issue
Romeo: A Parametric Model-Checker for Petri Nets with Stopwatches
TACAS '09 Proceedings of the 15th International Conference on Tools and Algorithms for the Construction and Analysis of Systems: Held as Part of the Joint European Conferences on Theory and Practice of Software, ETAPS 2009,
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
Relevant Timed Schedules/Clock Vectors for Constructing Time Petri Net Reachability Graphs
Discrete Event Dynamic Systems
Romeo: a tool for analyzing time petri nets
CAV'05 Proceedings of the 17th international conference on Computer Aided Verification
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
Symbolic unfolding of parametric stopwatch Petri nets
Formal Methods in System Design
Hi-index | 0.00 |
The theory of Petri Nets provides a general framework to specify the behaviors of real-time reactive systems and Time Petri Nets were introduced to take also temporal specifications into account. We present in this paper a forward zone-based algorithm to compute the state space of a bounded Time Petri Net: the method is different and more efficient than the classical State Class Graph. We prove the algorithm to be exact with respect to the reachability problem. Furthermore, we propose a translation of the computed state space into a Timed Automaton, proved to be timed bisimilar to the original Time Petri Net. As the method produce a single Timed Automaton, syntactical clocks reduction methods (DAWS and YOVINE for instance) may be applied to produce an automaton with fewer clocks. Then, our method allows to model-check T-TPN by the use of efficient Timed Automata tools.