On Finite Bases for Weak Semantics: Failures Versus Impossible Futures

  • Taolue Chen
  • Wan Fokkink
  • Rob van Glabbeek
Conference paper

DOI: 10.1007/978-3-540-95891-8_18

Part of the Lecture Notes in Computer Science book series (LNCS, volume 5404)
Cite this paper as:
Chen T., Fokkink W., van Glabbeek R. (2009) On Finite Bases for Weak Semantics: Failures Versus Impossible Futures. In: Nielsen M., Kučera A., Miltersen P.B., Palamidessi C., Tůma P., Valencia F. (eds) SOFSEM 2009: Theory and Practice of Computer Science. SOFSEM 2009. Lecture Notes in Computer Science, vol 5404. Springer, Berlin, Heidelberg

Abstract

We provide a finite basis for the (in)equational theory of the process algebra BCCS modulo the weak failures preorder and equivalence. We also give positive and negative results regarding the axiomatizability of BCCS modulo weak impossible futures semantics.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer-Verlag Berlin Heidelberg 2009

Authors and Affiliations

  • Taolue Chen
    • 1
  • Wan Fokkink
    • 1
    • 2
  • Rob van Glabbeek
    • 3
    • 4
  1. 1.CWI, Department of Software EngineeringAmsterdamThe Netherlands
  2. 2.Department of Theoretical Computer ScienceVrije Universiteit AmsterdamAmsterdamThe Netherlands
  3. 3.National ICT AustraliaSydneyAustralia
  4. 4.School of Computer Science and EngineeringThe University of New South WalesSydneyAustralia

Personalised recommendations