RAIRO-Theor. Inf. Appl.
Volume 35, Number 1, January/February 2001Coalgebraic Methods in Computer Science
|Page(s)||1 - 29|
|Published online||15 April 2002|
Integrating Observational and Computational Features in the Specification of State-Based, Dynamical Systems
Oxford University Computing Laboratory, Wolfson Building, Parks Road,
Oxford OX1 3QD, U.K.; e-mail: firstname.lastname@example.org
Accepted: 25 April 2001
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.
Mathematics Subject Classification: 18C10 / 03C65 / 68Q55 / 68N30
© EDP Sciences, 2001
Current usage metrics show cumulative count of Article Views (full-text article views including HTML views, PDF and ePub downloads, according to the available data) and Abstracts Views on Vision4Press platform.
Data correspond to usage on the plateform after 2015. The current usage metrics is available 48-96 hours after online publication and is updated daily on week days.
Initial download of the metrics may take a while.