Coinduction for preordered algebra

Authors:
Răzvan Diaconescu
Affiliations:
Institute of Mathematics “Simion Stoilow” of the Romanian Academy, Bucureşti, Calea Griviţei 21, Romania
Venue:
Information and Computation
Year:
2011

Citing 8
Cited 0

Initial computability, algebraic specifications, and partial algebras

Initial computability, algebraic specifications, and partial algebras
Conditional rewriting logic as a unified model of concurrency

Selected papers of the Second Workshop on Concurrency and compositionality
Towards an algebraic semantics for the object paradigm

Selected papers from 9th workshop on Specification of abstract data types : recent trends in data type specification: recent trends in data type specification
A hidden agenda

Theoretical Computer Science
Logical foundations of cafeOBJ

Theoretical Computer Science - Rewriting logic and its applications
Observational Logic

AMAST '98 Proceedings of the 7th International Conference on Algebraic Methodology and Software Technology
Institution-independent Model Theory

Institution-independent Model Theory
All about maude - a high-performance logical framework: how to specify, program and verify systems in rewriting logic

All about maude - a high-performance logical framework: how to specify, program and verify systems in rewriting logic

Quantified Score

Hi-index	0.00

Visualization

Abstract

We develop a combination, called hidden preordered algebra, between preordered algebra, which is an algebraic framework supporting specification and reasoning about transitions, and hidden algebra, which is the algebraic framework for behavioural specification. This combination arises naturally within the heterogeneous framework of the modern formal specification language CafeOBJ. The novel specification concept arising from this combination, and which constitutes its single unique feature, is that of behavioural transition. We extend the coinduction proof method for behavioural equivalence to coinduction for proving behavioural transitions.