Introduction to algorithms
Parametric real-time reasoning
STOC '93 Proceedings of the twenty-fifth annual ACM symposium on Theory of computing
Theoretical Computer Science
The Bounded Retransmission Protocol Must Be on Time!
TACAS '97 Proceedings of the Third International Workshop on Tools and Algorithms for Construction and Analysis of Systems
Timing Assumptions and Verification of Finite-State Concurrent Systems
Proceedings of the International Workshop on Automatic Verification Methods for Finite State Systems
Partition Refinement in Real-Time Model Checking
FTRTFT '98 Proceedings of the 5th International Symposium on Formal Techniques in Real-Time and Fault-Tolerant Systems
Kronos: A Model-Checking Tool for Real-Time Systems
CAV '98 Proceedings of the 10th International Conference on Computer Aided Verification
Symbolic Techniques for Parametric Reasoning about Counter and Clock Systems
CAV '00 Proceedings of the 12th International Conference on Computer Aided Verification
Lectures on Embedded Systems, European Educational Forum, School on Embedded Systems
ARTS '99 Proceedings of the 5th International AMAST Workshop on Formal Methods for Real-Time and Probabilistic Systems
HYTECH: A Model Checker for Hybrid Systems
CAV '97 Proceedings of the 9th International Conference on Computer Aided Verification
General distributions in process algebra
Lectures on formal methods and performance analysis
Verification of timed circuits with symbolic delays
Proceedings of the 2004 Asia and South Pacific Design Automation Conference
Reachability solution characterization of parametric real-time systems
Theoretical Computer Science - Implementation and application of automata
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
Event order abstraction for parametric real-time system verification
EMSOFT '08 Proceedings of the 8th ACM international conference on Embedded software
Robust safety of timed automata
Formal Methods in System Design
An Inverse Method for Parametric Timed Automata
Electronic Notes in Theoretical Computer Science (ENTCS)
Machine-Assisted Parameter Synthesis of the Biphase Mark Protocol Using Event Order Abstraction
FORMATS '09 Proceedings of the 7th International Conference on Formal Modeling and Analysis of Timed Systems
IMITATOR: A Tool for Synthesizing Constraints on Timing Bounds of Timed Automata
ICTAC '09 Proceedings of the 6th International Colloquium on Theoretical Aspects of Computing
Timing parameter characterization of real-time systems
CIAA'03 Proceedings of the 8th international conference on Implementation and application of automata
Verification and improvement of the sliding window protocol
TACAS'03 Proceedings of the 9th international conference on Tools and algorithms for the construction and analysis of systems
Bounded Parametric Verification for Distributed Time Petri Nets with Discrete-Time Semantics
Fundamenta Informaticae - Concurrency Specification and Programming (CS&P)
Bounded parametric model checking for elementary net systems
Transactions on Petri nets and other models of concurrency IV
Parametric model checking with verICS
Transactions on Petri nets and other models of concurrency IV
Enabling parametric feasibility analysis in real-time calculus driven performance evaluation
CASES '11 Proceedings of the 14th international conference on Compilers, architectures and synthesis for embedded systems
Template-Based controller synthesis for timed systems
TACAS'12 Proceedings of the 18th international conference on Tools and Algorithms for the Construction and Analysis of Systems
Automated analysis of parametric timing-based mutual exclusion algorithms
NFM'12 Proceedings of the 4th international conference on NASA Formal Methods
Formal Validation of a Deterministic MAC Protocol
ACM Transactions on Embedded Computing Systems (TECS) - Special Issue on Modeling and Verification of Discrete Event Systems
ACM Computing Surveys (CSUR)
Discrete Event Dynamic Systems
Information and Computation
| Hi-index | 0.00 |
We present an extension of the model checker UPPAAL capable of synthesize linear parameter constraints for the correctness of parametric timed automata. The symbolic representation of the (parametric) state-space is shown to be correct. A second contribution of this paper is the identification of a subclass of parametric timed automata (L/U automata), for which the emptiness problem is decidable, contrary to the full class where it is know to be undecidable. Also we present a number of lemmas enabling the verification effort to be reduced for L/U automata in some cases. We illustrate our approach by deriving linear parameter constraints for a number of well-known case studies from the literature (exhibiting a flaw in a published paper).