Parametric real-time reasoning
STOC '93 Proceedings of the twenty-fifth annual ACM symposium on Theory of computing
Theoretical Computer Science
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
Parametric Temporal Logic for "Model Measuring"
ICAL '99 Proceedings of the 26th International Colloquium on Automata, Languages and Programming
Durations, Parametric Model-Checking in Timed Automata with Presburger Arithmetic
STACS '03 Proceedings of the 20th Annual Symposium on Theoretical Aspects of Computer Science
Parametric Model-Checking of Time Petri Nets with Stopwatches Using the State-Class Graph
FORMATS '08 Proceedings of the 6th international conference on Formal Modeling and Analysis of Timed Systems
Comparison of the expressiveness of timed automata and time petri nets
FORMATS'05 Proceedings of the Third international conference on Formal Modeling and Analysis of Timed Systems
Bridging the gap between timed automata and bounded time petri nets
FORMATS'06 Proceedings of the 4th international conference on Formal Modeling and Analysis of Timed Systems
| Hi-index | 0.00 |
The intention of the paper is to develop an algorithm for parametric timing behaviour verification of real-time and concurrent systems represented by prioritized time Petri nets (PrTPNs). To achieve the purpose, we introduce a notion of the parametric PrTPN which is a modification of the PrTPN by using parameter variables in specification of timing constraints on transition firings. System properties are given as formulae of a parametric extension of the real-time branching time temporal logic TCTL, PTCTL. The verification algorithm consists in constructing conditions on timing parameter variables under which the PrTPN with bounded parameters works w.r.t. the checked PTCTL-formula. It is also shown the correctness and evaluated the complexity of the algorithm proposed.