Parametric real-time reasoning
STOC '93 Proceedings of the twenty-fifth annual ACM symposium on Theory of computing
Information and Computation
A Classification of Symbolic Transition Systems
STACS '00 Proceedings of the 17th Annual Symposium on Theoretical Aspects of Computer Science
Using Cylindrical Algebraic Decomposition for the Analysis of Slope Parametric Hybrid Automata
FTRTFT '00 Proceedings of the 6th International Symposium on Formal Techniques in Real-Time and Fault-Tolerant Systems
Analysis of Slope-Parametric Rectangular Automata
Hybrid Systems V
A New Class of Decidable Hybrid Systems
HSCC '99 Proceedings of the Second International Workshop on Hybrid Systems: Computation and Control
Analysis of Slope-Parametric Hybrid Automata
HART '97 Proceedings of the International Workshop on Hybrid and Real-Time Systems
Symbolic Techniques for Parametric Reasoning about Counter and Clock Systems
CAV '00 Proceedings of the 12th International Conference on Computer Aided Verification
LICS '96 Proceedings of the 11th Annual IEEE Symposium on Logic in Computer Science
Two examples of verification of multirate timed automata with Kronos
RTSS '95 Proceedings of the 16th IEEE Real-Time Systems Symposium
| Hi-index | 0.00 |
Parametric analysis of hybrid systems consists in computing the parameters that enable a correct behaviour of the specified systems. As most problems are not decidable in the theory of hybrid systems, finding decidable parametric systems is of great interest. The so-called class of weakly controlled hybrid systems is a new class of parametric systems for which a partition of the space of the parameters can be computed. Firstly, this partition is finite. Secondly, the non-parametric automata induced by fixing two values of a same cell of the partition for each parameter are bisimilar. A parametric hybrid system is weakly-controlled whenever all its elementary cycles have an edge that reset all the variables; the parameters could not be modified.