An Exercise on Transition Systems

Authors:
Paula R. Ribeiro;L. S. Barbosa;Shuling Wang
Affiliations:
Department of Informatics, Minho University, Portugal;Department of Informatics, Minho University, Portugal;LMAM and Department of Informatics, School of Mathematical Sciences, Peking University, Beijing, China
Venue:
Electronic Notes in Theoretical Computer Science (ENTCS)
Year:
2008

Citing 13
Cited 1

Bisimulation through probabilistic testing

Information and Computation
A calculus of mobile processes, I

Information and Computation
Algebra of programming

Algebra of programming
Communication and Concurrency

Communication and Concurrency
Functional Programming with Bananas, Lenses, Envelopes and Barbed Wire

Proceedings of the 5th ACM Conference on Functional Programming Languages and Computer Architecture
Final Universes of Processes

Proceedings of the 9th International Conference on Mathematical Foundations of Programming Semantics
Coinductive Interpreters for Process Calculi

FLOPS '02 Proceedings of the 6th International Symposium on Functional and Logic Programming
Hybrid Automata with Finite Bisimulatioins

ICALP '95 Proceedings of the 22nd International Colloquium on Automata, Languages and Programming
Galois Connections and Fixed Point Calculus

Revised Lectures from the International Summer School and Workshop on Algebraic and Coalgebraic Methods in the Mathematics of Program Construction
Elements of a Relational Theory of Datatypes

Proceedings of the IFIP TC2/WG 2.1 State-of-the-Art Report on Formal Program Development
Concurrency and Automata on Infinite Sequences

Proceedings of the 5th GI-Conference on Theoretical Computer Science
A Typed Lambda Calculus with Categorical Type Constructors

Category Theory and Computer Science
Weak Bisimulation for Action-Type Coalgebras

Electronic Notes in Theoretical Computer Science (ENTCS)

A perspective on service orchestration

Science of Computer Programming

Quantified Score

Hi-index	0.00

Visualization

Abstract

Labelled transition systems admit different but equivalent characterizations either as relational structures or coalgebras for the powerset functor, each of them with their own merits. Notions of simulation and bisimulation, for example, are expressed in the pointfree relational calculus in a very concise and precise way. On the other hand, the coalgebraic perspective regards processes as inhabitants of a final universe and allows for an intuitive definition of the semantics of process' combinators. This paper is an exercise on such a dual characterisation. In particular, it discusses how a notion of weak bisimilarity can be lifted from the relational to the coalgebraic level, to become an effective reasoning tool on coinductively defined process algebras.