Object-oriented hybrid systems of coalgebras plus monoid actions

Theoretical Computer Science

Volumn 239, Issue 1, 2000, Pages 41-95

  Jacobs, Bart ^a  

^a RADBOUD UNIVERSITY NIJMEGEN   (Netherlands)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0347937262     PISSN: 03043975     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0304-3975(99)00213-3     Document Type: Article

References (39)

1. P. Aczel, Non-well-founded sets, CSLI Lecture Notes, vol. 14, Stanford, 1988.
2. R. Alur, C. Courcoubetis, N. Halbwachs, T.A. Henzinger, P.-H. Ho, X. Nicollin, A. Olivero, J. Sifakis, S. Yovine, The algorithmic analysis of hybrid systems, Theoret. Comput. Sci. 138(1) (1995) 3-34.
3. M. Andersson, Object-oriented modeling and simulation of hybrid systems, Ph.D. Thesis, Dep. of Automatic Control, Lund Inst. of Techn., 1994.
4. M.A. Arbib, A common framework for automata theory and control theory, SIAM J. Control 3 (1965) 206-222.
5. M. Barr, Ch. Wells, Category Theory for Computing Science, Prentice-Hall, Englewood Cliffs, NJ, 1990.
6. M. Bidoit, R. Hennicker, Proving the correctness of behavioural implementations, in: V.S. Alagar, M. Nivat (Eds.), Algebraic Methods and Software Technology, Lecture Notes in Computer Science, vol. 936, Springer, Berlin, 1995, pp. 152-168.
7. R. Burstall, R. Diaconescu, Hiding and behaviour: an institutional approach, in: A.W. Roscoe (Ed.), A Classical Mind. Essays in honour of C.A.R. Hoare, Prentice-Hall, Englewood Cliffs, NJ, 1994, pp. 75-92.
8. H. Ehrig, B. Mahr, Fundamentals of Algebraic Specification I: Equations and Initial Semantics, EATCS Monographs, vol. 6, Springer, Berlin, 1985.
9. J.A. Goguen, Minimal realization of machines in closed categories, Bull. Amer. Math. Soc. 78(5) (1972) 777-783.
10. J.A. Goguen, Realization is universal, Math. Systems Theory 6(4) (1973) 359-374.
11. J.A. Goguen, Discrete-time machines in closed monoidal categories. I, J. Comput. Systems Sci. 10 (1975) 1-43.
12. J.A. Goguen, R. Diaconescu, Towards an algebraic semantics for the object paradigm, in: H. Ehrig, F. Orejas (Eds.), Recent Trends in Data Type Specification, Lecture Notes in Computer Science, vol. 785, Springer, Berlin, 1994, pp. 1-29.
13. J.A. Goguen, G. Malcolm, Proof of correctness of object representations, in: A.W. Roscoe (Ed.), A Classical Mind. Essays in Honour of C.A.R. Hoare, Prentice-Hall, Englewood Cliffs, NJ, 1994, pp. 119-142.
14. J.A. Goguen, G. Malcolm, An extended abstract of a hidden agenda, in: J. Meystel, A. Meystel, R. Quintero (Eds.), Proc. Conf. on Intelligent Systems: A Semiotic Perspective, Nat. Inst. Stand. & Techn., 1996, pp. 159-167.
15. U. Hensel, M. Huisman, B. Jacobs, H. Tews, Reasoning about classes in object-oriented languages: logical models and tools, in: Ch. Hankin (Ed.), European Symposium on Programming, Lecture Notes in Computer Science, vol. 1381, Springer, Berlin, 1998, pp. 105-121.
16. T.A. Henzinger, Z. Manna, A. Pnueli, Timed transition systems, in: J.W. de Bakker, C. Huizing, W.P. de Roever, G. Rozenberg (Eds.), Real-Time: Theory in Practice, Lecture Notes in Computer Science, vol. 600, Springer, Berlin, 1992, pp. 226-251.
17. M.W. Hirsch, S. Smale, Differential Equations, Dynamical Systems, and Linear Algebra, Academic Press, New York, 1974.
18. B. Jacobs, Mongruences and cofree coalgebras, in: V.S. Alagar, M. Nivat (Eds.), Algebraic Methodology and Software Technology, Lecture Notes in Computer Science, vol. 936, Springer, Berlin, 1995, pp. 245-260.
19. B. Jacobs, Coalgebraic specifications and models of deterministic hybrid systems, in: M. Wirsing, M. Nivat (Eds.), Algebraic Methodology and Software Technology, Lecture Notes in Computer Science, vol. 1101, Springer, Berlin, 1996, pp. 520-535.
20. B. Jacobs, Inheritance and cofree constructions, in: P. Cointe (Ed.), European Conference on Object-Oriented Programming, Lecture Notes in Computer Science, vol. 1098, Springer, Berlin, 1996, pp. 210-231.
21. B. Jacobs, Objects and classes, co-algebraically, in: B. Freitag, C.B. Jones, C. Lengauer, H.-J. Schek (Eds.), Object-Orientation with Parallelism and Persistence, Kluwer Acad. Publ., Dordrecht, 1996, pp. 83-103.
22. B. Jacobs, Behaviour-refinement of coalgebraic specifications with coinductive correctness proofs, in: M. Bidoit, M. Dauchet (Eds.), TAPSOFT'97: Theory and Practice of Software Development, Lecture Notes in Computer Science, vol. 1214, Springer, Berlin, 1997, pp. 787-802.
23. B. Jacobs, Invariants, bisimulations and the correctness of coalgebraic refinements, in: M. Johnson (Ed.), Algebraic Methodology and Software Technology, Lecture Notes in Computer Science, vol. 1349, Springer, Berlin, 1997, pp. 276-291.
24. B. Jacobs, J. Rutten, A tutorial on (co)algebras and (co)induction, EATCS Bull. 62 (1997) 222-259.
25. B. Jacobs, J. van den Berg, M. Huisman, M. van Berkum, U. Hensel, H. Tews, Reasoning about classes in Java (preliminary report), in: Object-Oriented Programming, Systems, Languages and Applications, ACM Press, New York, 1998, pp. 329-340.
26. R.E. Kalman, P.L. Falb, M.A. Arbib, Topics in Mathematical System Theory, McGraw-Hill Int. Series in Pure & Appl. Math., McGraw-Hill, New York, 1969.
27. R. Koymans, R. Kuiper, E. Zijlstra, Paradigms for real-time systems, in: M. Joseph (Ed.), Formal Techniques in Real-Time and Fault-Tolerant Systems, Lecture Notes in Computer Science, vol. 331, Springer, Berlin, 1988, pp. 159-174.
28. G. Malcolm, Behavioural equivalence, bisimulation and minimal realisation, in: M. Haveraaen, O. Owe, O.J. Dahl (Eds.), Recent Trends in Data Type Specification, Lecture Notes in Computer Science, vol. 1130, Springer, Berlin, 1996, pp. 359-378.
29. B. Meyer, Object-Oriented Software Construction, 2nd rev. Edition, Prentice-Hall, Englewood Cliffs, NJ, 1997.
30. R. Milner, Communication and Concurrency, Prentice-Hall, Englewood Cliffs, NJ, 1989.
31. X. Nicollin, A. Olivero, J. Sifakis, S. Yovin, An approach to the description and analysis of hybrid systems, in: R.L. Grossman, A. Nerode, A.P. Ravn, H. Rischel (Eds.), Hybrid Systems, Lecture Notes in Computer Science, vol. 736, Springer, Berlin, 1993, pp. 149-178.
32. X. Nicollin, J. Sifakis, S. Yovine, From ATP to timed graphs and hybrid systems, in: J.W. de Bakker, C. Huizing, W.P. de Roever, G. Rozenberg (Eds.), Real-Time: Theory in Practice, Lecture Notes in Computer Science, vol. 600, Springer, Berlin, 1992, pp. 549-572.
33. B. Nilsson, Dynamic modeling of chemical processes using OMOLA, Trans. Inst. Chem. Eng. 72(A) (1994) 364-370.
34. L. Padulo, M.A. Arbib, System Theory, A Unified State-Space Approach to Continuous and Discrete Time Systems, Saunders, London, 1974.
35. H. Reichel, An approach to object semantics based on terminal co-algebras, Math. Struct. Comput. Sci. 5 (1995) 129-152.
36. J. Rutten, A calculus of transition systems (towards universal coalgebra), in: A. Ponse, M. de Rijke, Y. Venema (Eds.), Modal Logic and Process Algebra, CSLI Lect. Notes, vol. 53, Stanford, 1995, pp. 231-256.
37. J. Rutten, D. Turi, Initial algebra and final coalgebra semantics for concurrency, in: J.W. de Bakker, W.P. de Roever, G. Rozenberg (Eds.), A Decade of Concurrency, Lecture Notes in Computer Science, vol. 803, Springer, Berlin, 1994, pp. 530-582.
38. M. Wirsing, Algebraic specification, in: J. van Leeuwen (Ed.), Handbook of Theoretical Computer Science, vol. B, Elsevier/MIT Press, Cambridge, MA, 1990, pp. 673-788.
39. W. Yi, Real-time behaviour of asynchronous agents, in: J.C.M. Baeten, J.W. Klop (Eds.), CONCUR'90. Theory of Concurrency: Unification and Extension, Lecture Notes in Computer Science, Springer, Berlin, 1990, pp. 502-520.