RAIRO-Theor. Inf. Appl.
Volume 35, Number 1, January/February 2001Coalgebraic Methods in Computer Science
|Page(s)||83 - 111|
|Published online||15 April 2002|
Coalgebras for Binary Methods: Properties of Bisimulations and Invariants
Institut für Theoretische Informatik, TU Dresden, D-01062
Dresden, Germany; e-mail: firstname.lastname@example.org
Accepted: 9 March 2001
Coalgebras for endofunctors can be used to model classes of object-oriented languages. However, binary methods do not fit directly into this approach. This paper proposes an extension of the coalgebraic framework, namely the use of extended polynomial functors . This extension allows the incorporation of binary methods into coalgebraic class specifications. The paper also discusses how to define bisimulation and invariants for coalgebras of extended polynomial functors and proves many standard results.
Mathematics Subject Classification: 03E20 / 03G30 / 68Q55 / 68Q65
Key words: Binary method / coalgebra / bisimulation / invariant / object-orientation.
© 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.