Communicating sequential processes
Communicating sequential processes
Initial computability, algebraic specifications, and partial algebras
Initial computability, algebraic specifications, and partial algebras
Initial behavior semantics for algebraic specifications
Lecture notes in Computer Science on Recent trends in data type specification
Categories, types, and structures: an introduction to category theory for the working computer scientist
Behavioural and abstractor specifications
ESOP '94 Selected papers of ESOP '94, the 5th European symposium on Programming
Objects and classes, co-algebraically
Object orientation with parallelism and persistence
Communicating and mobile systems: the &pgr;-calculus
Communicating and mobile systems: the &pgr;-calculus
Theoretical Computer Science
Universal coalgebra: a theory of systems
Theoretical Computer Science - Modern algebra and its applications
A Calculus of Communicating Systems
A Calculus of Communicating Systems
Fundamentals of Algebraic Specification I
Fundamentals of Algebraic Specification I
Open maps as a bridge between algebraic observational equivalence and bisimilarity
WADT '97 Selected papers from the 12th International Workshop on Recent Trends in Algebraic Development Techniques
Behavioural Equivalence, Bisimulation, and Minimal Realisation
Selected papers from the 11th Workshop on Specification of Abstract Data Types Joint with the 8th COMPASS Workshop on Recent Trends in Data Type Specification
AMAST '98 Proceedings of the 7th International Conference on Algebraic Methodology and Software Technology
A Kernel Language for Algebraic Specification and Implementation - Extended Abstract
Proceedings of the 1983 International FCT-Conference on Fundamentals of Computation Theory
Selected Papers from Automated Deduction in Classical and Non-Classical Logics
Observational logic, constructor-based logic, and their duality
Theoretical Computer Science - Foundations of software science and computation structures
Coalgebra, concurrency, and control
Coalgebra, concurrency, and control
A calculus of transition systems (towards universal coalgebra)
A calculus of transition systems (towards universal coalgebra)
Bisimulation relations for weighted automata
Theoretical Computer Science
| Hi-index | 0.00 |
Observability concepts allow to focus on the observable behaviour of a system while abstracting internal details of implementation. In this context, formal verification techniques use behavioural equivalence notions formalizing the idea of indistinguishability of system states. In this paper, we investigate the relation between two behavioural equivalences: the algebraic observational equivalence in the framework of observational algebras with many hidden sorts and automata bisimulation. For that purpose, we propose a transformation of an observational algebra into an infinite deterministic automaton. Consequently, we obtain a subclass of deterministic automata, equivalent to (infinite) Mealy automata, which we call Observational Algebra Automata (OAA). We use a categorical setting to show the equivalence between bisimulation on OAA and algebraic observational equivalence. Therefore we extend the hidden algebras result concerning observational equivalence and bisimulation coincidence to the non-monadic case.