Integrating observational and computational features in the specification of state-based, dynamical systems

Corina Cîrstea

RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications (2001)

  • Volume: 35, Issue: 1, page 1-29
  • ISSN: 0988-3754

Abstract

top
We present an abstract equational framework for the specification of systems having both observational and computational features. Our approach is based on a clear separation between the two categories of features, and uses algebra, respectively coalgebra to formalise them. This yields a coalgebraically-defined notion of observational indistinguishability, as well as an algebraically-defined notion of reachability under computations. The relationship between the computations yielding new system states and the observations that can be made about these states is specified using liftings of the coalgebraic structure of state spaces to a coalgebraic structure on computations over these state spaces. Also, correctness properties of system behaviour are formalised using equational sentences, with the associated notions of satisfaction abstracting away observationally indistinguishable, respectively unreachable states, and with the resulting proof techniques employing coinduction, respectively induction.

How to cite

top

Cîrstea, Corina. "Integrating observational and computational features in the specification of state-based, dynamical systems." RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications 35.1 (2001): 1-29. <http://eudml.org/doc/92653>.

@article{Cîrstea2001,
abstract = {We present an abstract equational framework for the specification of systems having both observational and computational features. Our approach is based on a clear separation between the two categories of features, and uses algebra, respectively coalgebra to formalise them. This yields a coalgebraically-defined notion of observational indistinguishability, as well as an algebraically-defined notion of reachability under computations. The relationship between the computations yielding new system states and the observations that can be made about these states is specified using liftings of the coalgebraic structure of state spaces to a coalgebraic structure on computations over these state spaces. Also, correctness properties of system behaviour are formalised using equational sentences, with the associated notions of satisfaction abstracting away observationally indistinguishable, respectively unreachable states, and with the resulting proof techniques employing coinduction, respectively induction.},
author = {Cîrstea, Corina},
journal = {RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications},
keywords = {state-based dynamical systems; equational specifications},
language = {eng},
number = {1},
pages = {1-29},
publisher = {EDP-Sciences},
title = {Integrating observational and computational features in the specification of state-based, dynamical systems},
url = {http://eudml.org/doc/92653},
volume = {35},
year = {2001},
}

TY - JOUR
AU - Cîrstea, Corina
TI - Integrating observational and computational features in the specification of state-based, dynamical systems
JO - RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications
PY - 2001
PB - EDP-Sciences
VL - 35
IS - 1
SP - 1
EP - 29
AB - We present an abstract equational framework for the specification of systems having both observational and computational features. Our approach is based on a clear separation between the two categories of features, and uses algebra, respectively coalgebra to formalise them. This yields a coalgebraically-defined notion of observational indistinguishability, as well as an algebraically-defined notion of reachability under computations. The relationship between the computations yielding new system states and the observations that can be made about these states is specified using liftings of the coalgebraic structure of state spaces to a coalgebraic structure on computations over these state spaces. Also, correctness properties of system behaviour are formalised using equational sentences, with the associated notions of satisfaction abstracting away observationally indistinguishable, respectively unreachable states, and with the resulting proof techniques employing coinduction, respectively induction.
LA - eng
KW - state-based dynamical systems; equational specifications
UR - http://eudml.org/doc/92653
ER -

References

top
  1. [1] F. Borceux, Handbook of Categorial Algebra, Vol. II. CUP, Cambridge (1994). Zbl0911.18001
  2. [2] C. Cîrstea, A Coequational Approach to Specifying Behaviours, edited by B. Jacobs and J. Rutten, Coalgebraic Methods in Computer Science. Elsevier Science, Electron. Notes Theor. Comput. Sci. 19 (1999) 173-194. Zbl0918.68063MR1689455
  3. [3] C. Cîrstea, An Algebra-Coalgebra Framework for System Specification, edited by H. Reichel, Coalgebraic Methods in Computer Science. Elsevier Science, Electron. Notes Theor. Comput. Sci. 33 (2000) 81-112. Zbl0966.68129MR1787575
  4. [4] C. Cîrstea, Integrating Observations and Computations in the Specification of State-Based, Dynamical Systems, Ph.D. Thesis. University of Oxford (2000) http://www.comlab.ox.ac.uk/oucl/work/corina.cirstea/thesis.html 
  5. [5] A. Corradini, A Completeness Result for Equational Deduction in Coalgebraic Specification, edited by F. Parisi–Presicce, Recent Trends in Algebraic Development Techniques. Springer, Lecture Notes in Comput. Sci. 1376 (1998) 190-205. Zbl0903.08007
  6. [6] A. Corradini, R. Heckel and U. Montanari, From SOS Specifications to Structured Coalgebras: How to Make Bisimulation a Congruence, edited by B. Jacobs and J. Rutten, Coalgebraic Methods in Computer Science. Elsevier Science, Electron. Notes Theor. Comput. Sci. 19 (1999) 149-172. Zbl0918.68065MR1689454
  7. [7] R. Diaconescu, Behavioural Coherence in Object-Oriented Algebraic Specification, Technical Report IS-RR-98-0017F. Japan Advanced Institute for Science and Technology (1998). Zbl0963.68104
  8. [8] J. Goguen and R. Burstall, Institutions: Abstract Model Theory for Specification and Programming. J. ACM 39 (1992) 95-146. Zbl0799.68134MR1147298
  9. [9] J. Goguen and G. Malcolm, A Hidden Agenda. Theoret. Comput. Sci. 245 (2000) 55-101. Zbl0946.68070MR1784537
  10. [10] R. Hennicker and M. Bidoit, Observational Logic, in Proc. AMAST ’98. Springer, Lecture Notes in Comput. Sci. 1548 (1999) 263-277. Zbl1088.68112
  11. [11] R. Hennicker and A. Kurz, ( Ω , Ξ ) -Logic: On the Algebraic Extension of Coalgebraic Specifications, edited by B. Jacobs, L. Moss, H. Reichel and J. Rutten, Coalgebraic Methods in Computer Science. Elsevier Science, Electron. Notes Theor. Comput. Sci. 19 (1999) 195-211. Zbl0918.68064MR1689456
  12. [12] B. Jacobs, Objects and Classes, Coalgebraically, edited by B. Freitag, C.B. Jones, C. Lengauer and H.-J. Schek, Object Orientation with Parallelism and Persistence. Kluwer Academic Publishers (1996) 83-103. 
  13. [13] B. Jacobs, Invariants, Bisimulations and the Correctness of Coalgebraic Refinements, edited by M. Johnson, Algebraic Methodology and Software Technology. Springer, Lecture Notes in Comput. Sci. 1349 (1997) 276-291. 
  14. [14] P. Padawitz, Swinging Types = Functions + Relations + Transition Systems. Theoret. Comput. Sci. 243 (2000) 93-165. Zbl0947.68098MR1776158
  15. [15] H. Reichel, An Approach to Object Semantics Based on Terminal Coalgebras. Math. Structures Comput. Sci. 5 (1995) 129-152. Zbl0854.18006MR1368919
  16. [16] G. Roşu and J. Goguen, Hidden Congruent Deduction, edited by R. Caferra and G. Salzer, Automated Deduction in Classical and Non-Classical Logics. Springer, Lecture Notes in Comput. Sci. 1761 (2000) 251-266. Zbl0964.68083MR1790867
  17. [17] J. Rutten, Universal Coalgebra: A Theory of Systems. Theoret. Comput. Sci. 249 (2000) 3-80. Zbl0951.68038MR1791953
  18. [18] D. Turi and G. Plotkin, Towards a Mathematical Operational Semantics, in Proc. LICS (1997) 280-291. 

NotesEmbed ?

top

You must be logged in to post comments.