|Home \ Publications \ InProceedings Page||Login|
Towards Bi-Algebraic Semantics for the Linear Time – Branching Time SpectrumAbstract:
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.
@ Recent Trends in Algebraic Development Techniques
Editors: Hans-Jörg Kreowski and Till Mossakowski
Series: Lecture Notes in Computer Science
Publisher: Springer-Verlag ( Germany )
Pages: 209 to 225