A fast mutual exclusion algorithm
ACM Transactions on Computer Systems (TOCS)
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
Minimal Solutions of Linear Diophantine Systems: Bounds and Algorithms
RTA '91 Proceedings of the 4th International Conference on Rewriting Techniques and Applications
Parametric Quantitative Temporal Reasoning
LICS '99 Proceedings of the 14th Annual IEEE Symposium on Logic in Computer Science
LICS '07 Proceedings of the 22nd 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 metric interval temporal logic
LATA'10 Proceedings of the 4th international conference on Language and Automata Theory and Applications
Integer parameter synthesis for timed automata
TACAS'13 Proceedings of the 19th international conference on Tools and Algorithms for the Construction and Analysis of Systems
Automata-theoretic decision of timed games
Theoretical Computer Science
| 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 an upper bound. For such automata, we show that basic decision problems, such as emptiness, finiteness and universality of the set of parameter valuations for which there is a corresponding infinite accepting run of the automaton, 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 with the upper bound parameters in the linear system, and are undecidable in general. Finally, we consider a parametric extension of $\mathsf{MITL}$ 0,驴, and prove that the related satisfiability and model checking (w.r.t. L/U automata) problems are Pspace-complete.