Object-oriented hybrid systems of coalgebras plus monoid actions

Abstract Hybrid systems combine discrete and continuous dynamics. We introduce a semantics for such systems consisting of a coalgebra together with a monoid action. The coalgebra captures the (discrete) operations on a state space that can be used by a client (like in the semantics of ordinary (non-temporal) object-oriented systems). The monoid action captures the influence of time on the state space, where the monoids that we consider are the natural numbers monoid ( N ,0,+) of discrete time, and the positive reals monoid ( R ⩾0 ,0,+) of real time. Based on this semantics we develop a hybrid specification formalism with timed method applications: it involves expressions like s . meth @α , with the following meaning: in state s let the state evolve for α units of time (according to the monoid action), and then apply the (coalgebraic) method meth . In this formalism we specify various (elementary) hybrid systems, investigate their correctness, and display their behaviour in simulations. We further define a suitable notion of homomorphism between our hybrid models (of coalgebras plus monoid actions), in such a way that minimal realizations (of the specified behaviour) appear as terminal models. We identify the terminal models of our example specifications, and give general constructions. This leads to an investigation of various topics related to terminality: bisimilarity, invariance, refinement and behaviour-realization adjunctions. In a final section we briefly discuss non-homogeneous hybrid systems (with continuous inputs).

[1]  Bart Jacobs,et al.  Automata and behaviours in categories of processes , 1996 .

[2]  Bernt Nilsson Dynamic Modeling of Chemical Processes using OMOLA , 1994 .

[3]  Hartmut Ehrig,et al.  Fundamentals of Algebraic Specification 1: Equations and Initial Semantics , 1985 .

[4]  Oliver Schoett,et al.  Behavioural Correctness of Data Representations , 1990, Sci. Comput. Program..

[5]  Joseph A. Goguen,et al.  Discrete-Time Machines in Closed Monoidal Categories. I , 1975, J. Comput. Syst. Sci..

[6]  Thomas A. Henzinger,et al.  Timed Transition Systems , 1991, REX Workshop.

[7]  Bart Jacobs,et al.  Objects and Classes, Co-Algebraically , 1995, Object Orientation with Parallelism and Persistence.

[8]  J. Rutten A calculus of transition systems (towards universal coalgebra) , 1995 .

[9]  簡聰富,et al.  物件導向軟體之架構(Object-Oriented Software Construction)探討 , 1989 .

[10]  M. Hirsch,et al.  Differential Equations, Dynamical Systems, and Linear Algebra , 1974 .

[11]  Mats Andersson,et al.  Object-Oriented Modeling and Simulation of Hybrid Systems , 1994 .

[12]  Martin Wirsing,et al.  Algebraic Specification , 1991, Handbook of Theoretical Computer Science, Volume B: Formal Models and Sematics.

[13]  Joseph A. Goguen,et al.  Proof of correctness of object representations , 1994 .

[14]  Horst Reichel,et al.  An approach to object semantics based on terminal co-algebras , 1995, Mathematical Structures in Computer Science.

[15]  Joseph Sifakis,et al.  An Approach to the Description and Analysis of Hybrid Systems , 1992, Hybrid Systems.

[16]  A classical mind: essays in honour of C. A. R. Hoare , 1994 .

[17]  S.E. Mattsson,et al.  OmSim/spl minus/an integrated interactive environment for object-oriented modeling and simulation , 1994, Proceedings of IEEE Symposium on Computer-Aided Control Systems Design (CACSD).

[18]  J. Van Leeuwen,et al.  Handbook of theoretical computer science - Part A: Algorithms and complexity; Part B: Formal models and semantics , 1990 .

[19]  Grant Malcolm,et al.  Behavioural Equivalence, Bisimulation, and Minimal Realisation , 1995, COMPASS/ADT.

[20]  Bart Jacobs,et al.  Mongruences and Cofree Coalgebras , 1995, AMAST.

[21]  P. Krishnaprasad System theory: A unified state-space approach to continuous and discrete-time systems , 1978 .

[22]  W. Wonham,et al.  Topics in mathematical system theory , 1972, IEEE Transactions on Automatic Control.

[23]  Michael Barr,et al.  Category theory for computing science , 1995, Prentice Hall International Series in Computer Science.

[24]  Peter Aczel,et al.  Non-well-founded sets , 1988, CSLI lecture notes series.

[25]  Bart Jacobs,et al.  Inheritance and Cofree Constructions , 1996, ECOOP.

[26]  Michel Bidoit,et al.  Proving the Correctness of Behavioural Implementations , 1995, AMAST.

[27]  Hans-Jörg Schek,et al.  Object Orientation with Parallelism and Persistence , 1996 .

[28]  Bart Jacobs,et al.  Reasonong about Classess in Object-Oriented Languages: Logical Models and Tools , 1998, ESOP.

[29]  Ruurd Kuiper,et al.  Paradigms for Real-time Systems , 1988, FTRTFT.

[30]  Bart Jacobs,et al.  Behaviour-Refinement of Coalgebraic Specifications with Coinductive Correctness Proofs , 1997, TAPSOFT.

[31]  Bart Jacobs Coalgebraic Specifications and Models of Determinatistic Hybrid Systems , 1996, AMAST.

[32]  Răzvan Diaconescu,et al.  Hiding and behaviour: an institutional approach , 1994 .

[33]  J. Goguen Minimal realization of machines in closed categories , 1972 .

[34]  Jan J. M. M. Rutten,et al.  Initial Algebra and Final Coalgebra Semantics for Concurrency , 1993, REX School/Symposium.

[35]  Wang Yi,et al.  Real-Time Behaviour of Asynchronous Agents , 1990, CONCUR.

[36]  Thomas A. Henzinger,et al.  The Algorithmic Analysis of Hybrid Systems , 1995, Theor. Comput. Sci..

[37]  Bart Jacobs,et al.  Invariants, Bisimulations and the Correctness of Coalgebraic Refinements , 1997, AMAST.

[38]  M. Arbib A Common Framework for Automata Theory and Control Theory , 1965 .

[39]  Robin Milner,et al.  Communication and concurrency , 1989, PHI Series in computer science.

[40]  Joseph A. Goguen,et al.  Towards an Algebraic Semantics for the Object Paradigm , 1992, COMPASS/ADT.