Towards an algebra of hybrid systems

Authors:
Peter Höfner;Bernhard Möller
Affiliations:
Institut für Informatik, Universität Augsburg, Augsburg, Germany;Institut für Informatik, Universität Augsburg, Augsburg, Germany
Venue:
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
Year:
2005

Citing 5
Cited 4

Kleene algebra with tests

ACM Transactions on Programming Languages and Systems (TOPLAS)
Separation and Reduction

MPC '00 Proceedings of the 5th International Conference on Mathematics of Program Construction
The theory of hybrid automata

LICS '96 Proceedings of the 11th Annual IEEE Symposium on Logic in Computer Science
Hybrid I/O automata

Information and Computation
Kleene algebra with domain

ACM Transactions on Computational Logic (TOCL)

Kleene getting lazy

Science of Computer Programming
Semiring Neighbours: An Algebraic Embedding and Extension of Neighbourhood Logic

Electronic Notes in Theoretical Computer Science (ENTCS)
Automated reasoning for hybrid systems: two case studies

RelMiCS'08/AKA'08 Proceedings of the 10th international conference on Relational and kleene algebra methods in computer science, and 5th international conference on Applications of kleene algebra
Lazy semiring neighbours and some applications

RelMiCS'06/AKA'06 Proceedings of the 9th international conference on Relational Methods in Computer Science, and 4th international conference on Applications of Kleene Algebra

Quantified Score

Hi-index	0.00

Visualization

Abstract

We present a trajectory-based model for describing hybrid systems. For this we use left quantales and left semirings, thus providing a new application for these algebraic structures. Furthermore, we sketch a connection between game theory and hybrid systems.