Modeling and Verification of Time Dependent Systems Using Time Petri Nets
IEEE Transactions on Software Engineering
Model checking using net unfoldings
TAPSOFT '93 Selected papers of the colloquium on Formal approaches of software engineering
What's decidable about hybrid automata?
Journal of Computer and System Sciences
A causal semantics for time Petri nets
Theoretical Computer Science
An Improvement of McMillan's Unfolding Algorithm
Formal Methods in System Design
An Improvement of McMillan's Unfolding Algorithm
TACAs '96 Proceedings of the Second International Workshop on Tools and Algorithms for Construction and Analysis of Systems
Unfolding and Finite Prefix for Nets with Read Arcs
CONCUR '98 Proceedings of the 9th International Conference on Concurrency Theory
Functorial Concurrent Semantics for Petri Nets with Read and Inhibitor Arcs
CONCUR '00 Proceedings of the 11th International Conference on Concurrency Theory
Timing Assumptions and Verification of Finite-State Concurrent Systems
Proceedings of the International Workshop on Automatic Verification Methods for Finite State Systems
Unfoldings of Unbounded Petri Nets
CAV '00 Proceedings of the 12th International Conference on Computer Aided Verification
Using Unfoldings to Avoid the State Explosion Problem in the Verification of Asynchronous Circuits
CAV '92 Proceedings of the Fourth International Workshop on Computer Aided Verification
A study of the recoverability of computing systems.
A study of the recoverability of computing systems.
A Translation Based Method for the Timed Analysis of Scheduling Extended Time Petri Nets
RTSS '04 Proceedings of the 25th IEEE International Real-Time Systems Symposium
Distributed Monitoring of Concurrent and Asynchronous Systems*
Discrete Event Dynamic Systems
Model Checking of Time Petri Nets Using the State Class Timed Automaton
Discrete Event Dynamic Systems
State space computation and analysis of Time Petri Nets
Theory and Practice of Logic Programming
Reachability Problems and Abstract State Spaces for Time Petri Nets with Stopwatches
Discrete Event Dynamic Systems
On the well-foundedness of adequate orders used for construction of complete unfolding prefixes
Information Processing Letters
Unfoldings: A Partial-Order Approach to Model Checking (Monographs in Theoretical Computer Science. An EATCS Series)
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
Branching processes of high-level Petri nets
TACAS'03 Proceedings of the 9th international conference on Tools and algorithms for the construction and analysis of systems
Diagnosis using unfoldings of parametric time Petri nets
FORMATS'10 Proceedings of the 8th international conference on Formal modeling and analysis of timed systems
Symbolic unfolding of parametric stopwatch Petri nets
ATVA'10 Proceedings of the 8th international conference on Automated technology for verification and analysis
Complete finite prefixes of symbolic unfoldings of safe time petri nets
ICATPN'06 Proceedings of the 27th international conference on Applications and Theory of Petri Nets and Other Models of Concurrency
Timed unfoldings for networks of timed automata
ATVA'06 Proceedings of the 4th international conference on Automated Technology for Verification and Analysis
Symbolic unfoldings for networks of timed automata
ATVA'06 Proceedings of the 4th international conference on Automated Technology for Verification and Analysis
Blending Timed Formal Models with Clock Transition Systems
Fundamenta Informaticae - Dedicated to the Memory of Professor Manfred Kudlek
| Hi-index | 0.00 |
We address the problem of unfolding safe parametric stopwatch time Petri nets (PSwPNs), i.e., safe time Petri nets (TPNs) possibly extended with time parameters and stopwatches. We extend the notion of branching process to account for the dates of the occurrences of events and thus define a symbolic unfolding for PSwPNs. In the case of TPNs we also propose a method based on our so-called time branching processes to compute a finite complete prefix of the symbolic unfolding. The originality of our work relies on a precise handling of direct conflicts between events, and the analysis of their effects on the constraints between the firing dates of those events.