Towards bialgebraic semantics for the linear time --- branching time spectrum

Authors:
Ana Paula Maldonado;Luí/s Monteiro;Markus Roggenbach
Affiliations:
CITI, Departamento de Inform$#225/tica, Faculdade de Ciê/ncias e Tecnologia, Universidade Nova de Lisboa, Caparica, Portugal;CITI, Departamento de Inform$#225/tica, Faculdade de Ciê/ncias e Tecnologia, Universidade Nova de Lisboa, Caparica, Portugal;Swansea University, Wales, UK
Venue:
WADT'10 Proceedings of the 20th international conference on Recent Trends in Algebraic Development Techniques
Year:
2010

Citing 16
Cited 0

Communicating sequential processes

Communicating sequential processes
Structured operational semantics and bisimulation as a congruence

Information and Computation
Bisimulation can't be traced

Journal of the ACM (JACM)
The Theory and Practice of Concurrency

The Theory and Practice of Concurrency
CSP, partial automata, and coalgebras

Theoretical Computer Science
Final Universes of Processes

Proceedings of the 9th International Conference on Mathematical Foundations of Programming Semantics
Initial Algebra and Final Coalgebra Semantics for Concurrency

A Decade of Concurrency, Reflections and Perspectives, REX School/Symposium
Towards a Mathematical Operational Semantics

LICS '97 Proceedings of the 12th Annual IEEE Symposium on Logic in Computer Science
CSP-CASL: a new integration of process algebra and algebraic specification

Theoretical Computer Science - Algebraic methods in language processing
Processes as formal power series: a coinductive approach to denotational semantics

Theoretical Computer Science
Bialgebraic methods and modal logic in structural operational semantics

Information and Computation
A Coalgebraic Characterization of Behaviours in the Linear Time --- Branching Time Spectrum

Recent Trends in Algebraic Development Techniques
Defining Behaviours by Quasi-finality

Formal Methods: Foundations and Applications
Trace Semantics for Coalgebras

Electronic Notes in Theoretical Computer Science (ENTCS)
Structural Operational Semantics and Modal Logic, Revisited

Electronic Notes in Theoretical Computer Science (ENTCS)
Exemplaric Expressivity of Modal Logics

Journal of Logic and Computation

Quantified Score

Hi-index	0.00

Visualization

Abstract

Process algebra, e.g. CSP, offers different semantical observations (e.g. traces, failures, divergences) on a single syntactical system description. These observations are either computed algebraically from the process syntax, or "extracted" from a single operational model. Bialgebras capture both approaches in one framework and characterize their equivalence; however, due to use of finality, lack the capability to simultaneously cater for various semantics. We suggest to relax finality to quasi-finality. This allows for several semantics, which also can be coarser than bisimulation. As a case study, we show that our approach works out in the case of the CSP failures model.