Results 1 
2 of
2
Behavioural Equivalence, Bisimulation, and Minimal Realisation
 Recent Trends in Data Type Specifications
, 1996
"... . This paper examines three important topics in computer science: behavioural equivalence, bisimulation, and minimal realisation of automata, and discusses the relationships that hold between them. Central to all three topics is a notion of equivalence of behaviour, and by taking a coalgebraic a ..."
Abstract

Cited by 10 (2 self)
 Add to MetaCart
(Show Context)
. This paper examines three important topics in computer science: behavioural equivalence, bisimulation, and minimal realisation of automata, and discusses the relationships that hold between them. Central to all three topics is a notion of equivalence of behaviour, and by taking a coalgebraic approach to algebraic specifications we show that bisimulation is `the same as' behavioural equivalence. Moreover, we show that a particular construction for minimal realisation of behaviour corresponds to a proof technique for proving behavioural equivalence. We also argue that it is useful to consider algebraic specifications of objects as having both algebraic and coalgebraic aspects. 1 Introduction This paper links three major notions from different areas of computer science. Behavioural equivalence seems to have first arisen in the work of Reichel [32, 33], and has gradually grown in importance in the field of algebraic specification, particularly in allowing subtle changes of rep...
Interconnection of Object Specifications
 Formal Methods and Object Technology
, 1996
"... ing yet further from reality, we might proscribe the simultaneous effect of two or more methods on an object's state; doing so, we impose a monoid structure on the fixed set of methods proper to an object class. Applying methods one after the other corresponds to multiplication in the monoid, a ..."
Abstract

Cited by 8 (2 self)
 Add to MetaCart
(Show Context)
ing yet further from reality, we might proscribe the simultaneous effect of two or more methods on an object's state; doing so, we impose a monoid structure on the fixed set of methods proper to an object class. Applying methods one after the other corresponds to multiplication in the monoid, and applying no methods corresponds to the identity of the monoid. A monoid is a set M with an associative binary operation ffl M : M \ThetaM ! M , usually referred to as `multiplication', which has an identity element e M 2 M . If M = (M; ffl M ; e M ) is a monoid, we often write just M for M, and e for e M ; moreover for m;m 0 2 M , we usually write mm 0 instead of m ffl M m 0 . For example, A , the set of lists containing elements of A, together with concatenation ++ : A \ThetaA ! A and the empty list [ ] 2 A , is a monoid. This example is especially important for the material in later sections. A monoid homomorphism is a structure preserving map between the carriers of ...