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
Model-checking in dense real-time
Information and Computation - Special issue: selections from 1990 IEEE symposium on logic in computer science
Theoretical Computer Science
Symbolic model checking for real-time systems
Information and Computation
Parametric timing analysis for real-time systems
Information and Computation
Parametric Behaviour Analysis for Time Petri Nets
PaCT '999 Proceedings of the 5th International Conference on Parallel Computing Technologies
Decidability and Complexity Results for Timed Automata and Semi-linear Hybrid Automata
HSCC '00 Proceedings of the Third International Workshop on Hybrid Systems: Computation and Control
Model-Checking for Real-Time Systems
FCT '95 Proceedings of the 10th International Symposium on Fundamentals of Computation Theory
Timed State Space Analysis of Real-Time Preemptive Systems
IEEE Transactions on Software Engineering
Computation: finite and infinite machines
Computation: finite and infinite machines
Robust parametric reachability for timed automata
Information Processing Letters
An Inverse Method for Parametric Timed Automata
Electronic Notes in Theoretical Computer Science (ENTCS)
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,
Decision problems for lower/upper bound parametric timed automata
Formal Methods in System Design
Relationships between nondeterministic and deterministic tape complexities
Journal of Computer and System Sciences
Reachability-time games on timed automata
ICALP'07 Proceedings of the 34th international conference on Automata, Languages and Programming
Hi-index | 0.00 |
We provide a subclass of parametric timed automata (PTA) that we can actually and efficiently analyze, and we argue that it retains most of the practical usefulness of PTA. The currently most useful known subclass of PTA, L/U automata, has a strong syntactical restriction for practical purposes, and we show that the associated theoretical results are mixed. We therefore advocate for a different restriction scheme: since in classical timed automata, real-valued clocks are always compared to integers for all practical purposes, we also search for parameter values as bounded integers. We show that the problem of the existence of parameter values such that some TCTL property is satisfied is PSPACE-complete. In such a setting, we can also of course synthesize all the values of parameters and we give symbolic algorithms, for reachability and unavoidability properties, to do it efficiently, i.e., without an explicit enumeration. This also has the practical advantage of giving the result as symbolic constraints between the parameters. We finally report on a few experimental results to illustrate the practical usefulness of the approach.