What’s decidable about parametric timed automata?
Author:
- 29 July 2017
- journal article
- research article
- Published by Springer Nature in International Journal on Software Tools for Technology Transfer
- Vol. 21 (2) , 203-219
Abstract
No abstract availableKeywords
All Related Versions
This publication has 35 references indexed in Scilit:
- Modeling and verifying hierarchical real-time systems using stateful timed CSPACM Transactions on Software Engineering and Methodology, 2013
- The expressive power of time Petri netsTheoretical Computer Science, 2012
- The Parma Polyhedra Library: Toward a complete set of numerical abstractions for the analysis and verification of hardware and software systemsScience of Computer Programming, 2008
- Robust parametric reachability for timed automataInformation Processing Letters, 2007
- Real-Time Model-Checking: Parameters everywhereLogical Methods in Computer Science, 2007
- Structural translation from Time Petri Nets to Timed AutomataJournal of Systems and Software, 2006
- What's Decidable about Hybrid Automata?Journal of Computer and System Sciences, 1998
- HYTECH: a model checker for hybrid systemsInternational Journal on Software Tools for Technology Transfer, 1997
- The algorithmic analysis of hybrid systemsTheoretical Computer Science, 1995
- A theory of timed automataTheoretical Computer Science, 1994