An algebra of hybrid systems
From MaRDI portal
Publication:1001892
DOI10.1016/j.jlap.2008.08.005zbMath1161.68032OpenAlexW2135318248WikidataQ114851554 ScholiaQ114851554MaRDI QIDQ1001892
Publication date: 19 February 2009
Published in: The Journal of Logic and Algebraic Programming (Search for Journal in Brave)
Full work available at URL: https://opus.bibliothek.uni-augsburg.de/opus4/files/39741/39741.pdf
Related Items (9)
Modelling and analysing neural networks using a hybrid process algebra ⋮ Convolution as a Unifying Concept ⋮ An algebraic approach to computations with progress ⋮ Unifying Lazy and Strict Computations ⋮ Towards an Algebra for Real-Time Programs ⋮ Automated Reasoning for Hybrid Systems — Two Case Studies — ⋮ Unifying theories of time with generalised reactive processes ⋮ Fixing Zeno gaps ⋮ Unnamed Item
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- The algorithmic analysis of hybrid systems
- Fixed-point calculus
- The inverse semigroup of a sum-ordered semiring
- Kleene getting lazy
- A theory of timed automata
- Process algebra with propositional signals
- Hybrid I/O automata.
- Process algebra for hybrid systems
- Process algebra with timing
- HyTech: A model checker for hybrid systems
- On the regularization of Zeno hybrid automata
- Specification and Development of Interactive Systems
- Automated Reasoning for Hybrid Systems — Two Case Studies —
- Automated Reasoning in Kleene Algebra
- Quantales and Temporal Logics
- Process Algebra
- Temporal algebra
- Kleene algebra with domain
- Hybrid Systems: Computation and Control
- Formal Methods for Components and Objects
- Iterative Synthesis of Control Guards Ensuring Invariance and Inevitability in Discrete-Decision Games
- Relational Methods in Computer Science
- Relational Methods in Computer Science
This page was built for publication: An algebra of hybrid systems
