A fast mutual exclusion algorithm
ACM Transactions on Computer Systems (TOCS)
Minimal solutions of linear diophantine systems: bounds and algorithms
RTA-91 Proceedings of the 4th international conference on Rewriting techniques and applications
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
The benefits of relaxing punctuality
Journal of the ACM (JACM)
Parametric timing analysis for real-time systems
Information and Computation
What's decidable about hybrid automata?
Journal of Computer and System Sciences
Parametric temporal logic for “model measuring”
ACM Transactions on Computational Logic (TOCL)
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 Quantitative Temporal Reasoning
LICS '99 Proceedings of the 14th Annual IEEE Symposium on Logic in Computer Science
The temporal logic of programs
SFCS '77 Proceedings of the 18th Annual Symposium on Foundations of Computer Science
Parametric identification of temporal properties
RV'11 Proceedings of the Second international conference on Runtime verification
| Hi-index | 0.00 |
We investigate a class of parametric timed automata, called lower bound/upper bound (L/U) automata, where each parameter occurs in the timing constraints either as a lower bound or as un upper bound. For such automata, we show that checking if for a parameter valuation (resp., all parameter valuations) there is an infinite accepting run is PSPACE-complete. We extend these results by allowing the specification of constraints on parameters as a linear system. We show that the considered decision problems are still PSPACE-complete, if the lower bound parameters are not compared to the upper bound parameters in the linear system, and are undecidable in general. Finally, we consider a parametric extension of MITL0,∞, and prove that the related satisfiability and model checking (w.r.t. L/U automata) problems are PSPACE-complete.