Parametric real-time reasoning
STOC '93 Proceedings of the twenty-fifth annual ACM symposium on Theory of computing
Theoretical Computer Science
Automatic verification of real-time systems with discrete probability distributions
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 analysis of asynchronous circuits using timed automata
CHARME '95 Proceedings of the IFIP WG 10.5 Advanced Research Working Conference on Correct Hardware Design and Verification Methods
Using HyTech to Synthesize Control Parameters for a Steam Boiler
Formal Methods for Industrial Applications, Specifying and Programming the Steam Boiler Control (the book grow out of a Dagstuhl Seminar, June 1995).
Counterexample-Guided Abstraction Refinement
CAV '00 Proceedings of the 12th International Conference on Computer Aided Verification
TReX: A Tool for Reachability Analysis of Complex Systems
CAV '01 Proceedings of the 13th International Conference on Computer Aided Verification
Verification of Concurrent Systems with Parametric Delays Using Octahedra
ACSD '05 Proceedings of the Fifth International Conference on Application of Concurrency to System Design
The octahedron abstract domain
Science of Computer Programming
Symbolic model checking for probabilistic timed automata
Information and Computation
Principles of Model Checking (Representation and Mind Series)
Principles of Model Checking (Representation and Mind Series)
Spin model checker, the: primer and reference manual
Spin model checker, the: primer and reference manual
A Counterexample-Guided Approach to Parameter Synthesis for Linear Hybrid Automata
HSCC '08 Proceedings of the 11th international workshop on Hybrid Systems: Computation and Control
Timed verification of the generic architecture of a memory circuit using parametric timed automata
Formal Methods in System Design
Apron: A Library of Numerical Abstract Domains for Static Analysis
CAV '09 Proceedings of the 21st International Conference on Computer Aided Verification
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
PRISM: a tool for automatic verification of probabilistic systems
TACAS'06 Proceedings of the 12th international conference on Tools and Algorithms for the Construction and Analysis of Systems
Synthesis of timing parameters satisfying safety properties
RP'11 Proceedings of the 5th international conference on Reachability problems
Parametric verification and test coverage for hybrid automata using the inverse method
RP'11 Proceedings of the 5th international conference on Reachability problems
An extension of the inverse method to probabilistic timed automata
Formal Methods in System Design
| Hi-index | 0.00 |
We aim at finding a set of timing parameters for which a given timed automaton has a "good" behavior. We present here a novel approach based on the decomposition of the parametric space into behavioral tiles, i.e., sets of parameter valuations for which the behavior of the system is uniform. This gives us a behavioral cartography according to the values of the parameters. It is then straightforward to partition the space into a "good" and a "bad" subspace, according to the behavior of the tiles. We extend this method to probabilistic systems, allowing to decompose the parametric space into tiles for which the minimal (resp. maximal) probability of reaching a given location is uniform. An implementation has been made, and experiments successfully conducted.