Object-oriented hybrid systems of coalgebras plus monoid actions

DOI10.1016/S0304-3975(99)00213-3zbMath0944.68122MaRDI QIDQ1575271

Bart Jacobs

Publication date: 21 August 2000

Published in: Theoretical Computer Science (Search for Journal in Brave)

Mathematics Subject Classification ID

Semantics in the theory of computing (68Q55)

Related Items (4)

Continuity as a computational effect ⋮ Hybrid Automata as Coalgebras ⋮ A Single Complete Relational Rule for Coalgebraic Refinement ⋮ Languages and models for hybrid automata: a coalgebraic perspective

Uses Software

• Eiffel

Cites Work

• The algorithmic analysis of hybrid systems
• CONCUR '90. Theories of concurrency: unification and extension. Amsterdam, The Netherlands, August 1990. Proceedings
• Discrete-time machines in closed monoidal categories. I
• Minimal realization of machines in closed categories
• An approach to object semantics based on terminal co-algebras
• Proving the correctness of behavioural implementations
• Mongruences and cofree coalgebras
• A Common Framework for Automata Theory and Control Theory
• Realization is universal
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Object-oriented hybrid systems of coalgebras plus monoid actions