Theory of linear and integer programming
Theory of linear and integer programming
Integer and combinatorial optimization
Integer and combinatorial optimization
Modeling and Verification of Time Dependent Systems Using Time Petri Nets
IEEE Transactions on Software Engineering
Parametric real-time reasoning
STOC '93 Proceedings of the twenty-fifth annual ACM symposium on Theory of computing
Parametric timing analysis for real-time systems
Information and Computation
A Survey of Petri Net Methods for Controlled Discrete EventSystems
Discrete Event Dynamic Systems
Parametric Behaviour Analysis for Time Petri Nets
PaCT '999 Proceedings of the 5th International Conference on Parallel Computing Technologies
Linear Parametric Model Checking of Timed Automata
TACAS 2001 Proceedings of the 7th International Conference on Tools and Algorithms for the Construction and Analysis of Systems
Model-Checking for Real-Time Systems
FCT '95 Proceedings of the 10th International Symposium on Fundamentals of Computation Theory
A study of the recoverability of computing systems.
A study of the recoverability of computing systems.
Reachability Problems and Abstract State Spaces for Time Petri Nets with Stopwatches
Discrete Event Dynamic Systems
Just in Time Control of Constrained (max,+)-Linear Systems
Discrete Event Dynamic Systems
On the Compared Expressiveness of Arc, Place and Transition Time Petri Nets
Fundamenta Informaticae - PETRI NETS 2007
A review of scheduling theory and methods for semiconductor manufacturing cluster tools
Proceedings of the 40th Conference on Winter Simulation
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,
Deadlock Resolution in Automated Manufacturing Systems: A Novel Petri Net Approach
Deadlock Resolution in Automated Manufacturing Systems: A Novel Petri Net Approach
TCTL Model Checking of Time Petri Nets
Journal of Logic and Computation
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
Computers and Industrial Engineering
| Hi-index | 0.00 |
The problem of the synthesis of time bounds enforcing good properties for reactive systems has been much studied in the literature. These works mainly rely on dioid algebra theory and require important restrictions on the structure of the model (notably by restricting to timed event graphs). In this paper, we address the problems of existence and synthesis of shrinkings of the bounds of the time intervals of a time Petri net, such that a given property is verified. We show that this problem is decidable for CTL properties on bounded time Petri nets. We then propose a symbolic algorithm based on the state class graph for a fragment of CTL. If the desired property "includes" k-boundedness, the proposed algorithm terminates even if the net is unbounded. A prototype has been implemented in our tool Romeo and the method is illustrated on a small case study from the literature.