Skip to main content
SpringerLink
Log in

On Finite Bases for Weak Semantics: Failures Versus Impossible Futures

  • Conference paper
SOFSEM 2009: Theory and Practice of Computer Science (SOFSEM 2009)

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 5404))

  • 647 Accesses

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.

This work is partially supported by the Dutch Bsik project BRICKS.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 84.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 109.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Aceto, L., Fokkink, W.J., van Glabbeek, R.J., Ingólfsdóttir, A.: Nested semantics over finite trees are equationally hard. Information and Computation 191(2), 203–232 (2004)

    Article  MathSciNet  MATH  Google Scholar 

  2. Aceto, L., Fokkink, W.J., Ingólfsdóttir, A.: Ready to preorder: Get your BCCSP axiomatization for free! In: Mossakowski, T., Montanari, U., Haveraaen, M. (eds.) CALCO 2007. LNCS, vol. 4624, pp. 65–79. Springer, Heidelberg (2007)

    Chapter  Google Scholar 

  3. Brookes, S.D., Hoare, C.A.R., Roscoe, A.W.: A theory of communicating sequential processes. Journal of the ACM 31(3), 560–599 (1984)

    Article  MathSciNet  MATH  Google Scholar 

  4. Chen, T., Fokkink, W.J.: On the axiomatizability of impossible futures: Preorder versus equivalence. In: Proc. LICS 2008, pp. 156–165. IEEE, Los Alamitos (2008)

    Google Scholar 

  5. Chen, T., Fokkink, W.J., van Glabbeek, R.J.: On finite bases for weak semantics: Failures versus Impossible futures (2008), http://arxiv.org/abs/0810.4904

  6. Chen, T., Fokkink, W.J., van Glabbeek, R.J.: Ready to preorder: The case of weak process semantics. Information Processing Letters (to appear, 2008), http://www.cwi.nl/~chen/Papers/equational.pdf

  7. Chen, T., Fokkink, W.J., Luttik, B., Nain, S.: On finite alphabets and infinite bases. Information and Computation 206(5), 492–519 (2008)

    Article  MathSciNet  MATH  Google Scholar 

  8. De Nicola, R., Hennessy, M.: Testing equivalences for processes. Theoretical Computer Science 34, 83–133 (1984)

    Article  MathSciNet  MATH  Google Scholar 

  9. Fokkink, W.J., Nain, S.: A finite basis for failure semantics. In: Caires, L., Italiano, G.F., Monteiro, L., Palamidessi, C., Yung, M. (eds.) ICALP 2005. LNCS, vol. 3580, pp. 755–765. Springer, Heidelberg (2005)

    Chapter  Google Scholar 

  10. de Frutos-Escrig, D., Gregorio-Rodriguez, C., Palomino, M.: Ready to preorder: an algebraic and general proof. Journal of Logic and Algebraic Programming (to appear, 2008), http://maude.sip.ucm.es/~miguelpt/

  11. van Glabbeek, R.J.: A complete axiomatization for branching bisimulation congruence of finite-state behaviours. In: Borzyszkowski, A.M., Sokolowski, S. (eds.) MFCS 1993. LNCS, vol. 711, pp. 473–484. Springer, Heidelberg (1993)

    Chapter  Google Scholar 

  12. van Glabbeek, R.J.: The linear time – branching time spectrum II. The semantics of sequential systems with silent moves. In: Best, E. (ed.) CONCUR 1993. LNCS, vol. 715, pp. 66–81. Springer, Heidelberg (1993)

    Google Scholar 

  13. van Glabbeek, R.J.: Notes on the methodology of CCS and CSP. Theoretical Computer Science 177(2), 329–349 (1997)

    Article  MathSciNet  MATH  Google Scholar 

  14. van Glabbeek, R.J.: The linear time – branching time spectrum I. The semantics of concrete, sequential processes. In: Handbook of Process Algebra, pp. 3–99. Elsevier, Amsterdam (2001)

    Chapter  Google Scholar 

  15. van Glabbeek, R.J., Voorhoeve, M.: Liveness, fairness and impossible futures. In: Baier, C., Hermanns, H. (eds.) CONCUR 2006. LNCS, vol. 4137, pp. 126–141. Springer, Heidelberg (2006)

    Chapter  Google Scholar 

  16. Groote, J.F.: A new strategy for proving ω-completeness with applications in process algebra. In: Baeten, J.C.M., Klop, J.W. (eds.) CONCUR 1990. LNCS, vol. 458, pp. 314–331. Springer, Heidelberg (1990)

    Google Scholar 

  17. Hennessy, M.: Algebraic Theory of Processes. MIT Press, Cambridge (1988)

    MATH  Google Scholar 

  18. Milner, R.: A complete axiomatisation for observational congruence of finite-state behaviours. Information and Computation 81, 227–247 (1989)

    Article  MathSciNet  MATH  Google Scholar 

  19. Rensink, A., Vogler, W.: Fair testing. Information and Computation 205(2), 125–198 (2007)

    Article  MathSciNet  MATH  Google Scholar 

  20. Rounds, W.C., Brookes, S.D.: Possible futures, acceptances, refusals and communicating processes. In: Proc. FOCS 1981, pp. 140–149. IEEE, Los Alamitos (1981)

    Google Scholar 

  21. Vogler, W.: Modular Construction and Partial Order Semantics of Petri Nets. LNCS, vol. 625. Springer, Heidelberg (1992)

    MATH  Google Scholar 

  22. Voorhoeve, M., Mauw, S.: Impossible futures and determinism. In: Information Processing Letters, pp. 51–58 (2001)

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. CWI, Department of Software Engineering, P.O. Box 94079, 1090 GB, Amsterdam, The Netherlands

    Taolue Chen & Wan Fokkink

  2. Department of Theoretical Computer Science, Vrije Universiteit Amsterdam, De Boelelaan 1081a, 1081 HV, Amsterdam, The Netherlands

    Wan Fokkink

  3. National ICT Australia, Locked Bag 6016, Sydney, NSW 1466, Australia

    Rob van Glabbeek

  4. School of Computer Science and Engineering, The University of New South Wales, Sydney, NSW 2052, Australia

    Rob van Glabbeek

Authors
  1. Taolue Chen
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Wan Fokkink
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Rob van Glabbeek
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Aarhus Graduate School of Science, University of Aarhus, Ny Munkegade Bldg 1521-110, DK-8000, Aarhus C, Denmark

    Mogens Nielsen

  2. Faculty of Informatics, Masaryk University, Botanická 68a, 60200, Brno, Czech Republic

    Antonín Kučera

  3. Department of Computer Science, University of Aarhus, IT-parken, Aabogade 34, DK-8200, Aarhus N., Denmark

    Peter Bro Miltersen

  4. Ecole Polytechnique, Rue de Saclay, 91128, Palaiseau Cedex, France

    Catuscia Palamidessi  & Frank Valencia  & 

  5. Faculty of Mathematics and Physics, Charles University, Malostranské námestí 25, 118 00, Prague 1, Malá Strana, Czech Republic

    Petr Tůma

Rights and permissions

Reprints and permissions

Copyright information

© 2009 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

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. https://doi.org/10.1007/978-3-540-95891-8_18

Download citation

  • DOI: https://doi.org/10.1007/978-3-540-95891-8_18

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-95890-1

  • Online ISBN: 978-3-540-95891-8

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation