Designing hybrid automated manufacturing systems: A European perspective
Proceedings of the First International Conference on Ergonomics of Hybrid Automated Systems I
Theoretical Computer Science
The algorithmic analysis of hybrid systems
Theoretical Computer Science - Special issue on hybrid systems
ACM Transactions on Programming Languages and Systems (TOPLAS)
Handbook of Automated Reasoning: Volume 1
Handbook of Automated Reasoning: Volume 1
Calculating Church-Rosser Proofs in Kleene Algebra
ReIMICS '01 Revised Papers from the 6th International Conference and 1st Workshop of COST Action 274 TARSKI on Relational Methods in Computer Science
LICS '96 Proceedings of the 11th Annual IEEE Symposium on Logic in Computer Science
Process algebra for hybrid systems
Theoretical Computer Science - Process algebra
ACM Transactions on Computational Logic (TOCL)
Model Checking Data-Dependent Real-Time Properties of the European Train Control System
FMCAD '06 Proceedings of the Formal Methods in Computer Aided Design
Science of Computer Programming
Towards an algebra of hybrid systems
RelMiCS'05 Proceedings of the 8th international conference on Relational Methods in Computer Science, Proceedings of the 3rd international conference on Applications of Kleene Algebra
Automated verification of refinement laws
Annals of Mathematics and Artificial Intelligence
| Hi-index | 0.00 |
At an abstract level hybrid systems are related to variants of Kleene algebra. Since it has recently been shown that Kleene algebras and their variants, like omega algebras, provide a reasonable base for automated reasoning, the aim of the present paper is to show that automated algebraic reasoning for hybrid system is feasible. We mainly focus on applications. In particular, we present case studies and proof experiments to show how concrete properties of hybrid systems, like safety and liveness, can be algebraically characterised and how off-the-shelf automated theorem provers can be used to verify them.