Object-oriented hybrid systems of coalgebras plus monoid actions

DOI10.1016/S0304-3975(99)00213-3MaRDI QIDQ1575271zbMATH OpenFDO

Authors 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)

Recommendations

• Hybrid automata as coalgebras
• Hybrid action systems
• scientific article; zbMATH DE number 1617300
• Languages and models for hybrid automata: a coalgebraic perspective
• scientific article; zbMATH DE number 1301627

Cites work

• scientific article; zbMATH DE number 3888893 (Why is no real title available?)
• scientific article; zbMATH DE number 42735 (Why is no real title available?)
• scientific article; zbMATH DE number 42752 (Why is no real title available?)
• scientific article; zbMATH DE number 46995 (Why is no real title available?)
• scientific article; zbMATH DE number 3484411 (Why is no real title available?)
• scientific article; zbMATH DE number 3497683 (Why is no real title available?)
• scientific article; zbMATH DE number 1064116 (Why is no real title available?)
• scientific article; zbMATH DE number 1105469 (Why is no real title available?)
• scientific article; zbMATH DE number 1142323 (Why is no real title available?)
• scientific article; zbMATH DE number 1418819 (Why is no real title available?)
• scientific article; zbMATH DE number 3365976 (Why is no real title available?)
• A Common Framework for Automata Theory and Control Theory
• An approach to object semantics based on terminal co-algebras
• 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
• Mongruences and cofree coalgebras
• Proving the correctness of behavioural implementations
• Realization is universal
• The algorithmic analysis of hybrid systems

Cited in

(4)

• Hybrid automata as coalgebras
• A single complete relational rule for coalgebraic refinement
• Continuity as a computational effect
• Languages and models for hybrid automata: a coalgebraic perspective

Describes a project that uses

Uses Software

• Eiffel

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1575271)