Skip to main content
SpringerLink
Log in

Weak semantics based on lighted button pressing experiments

An alternative characterization of the readiness semantics

  • Conference paper
  • First Online:
Computer Science Logic (CSL 1996)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 1258))

Included in the following conference series:

  • 3135 Accesses

Abstract

Imposing certain restrictions on the transition system that defines the behaviour of a process allows us to characterize the readiness semantics of [OH86] by means of black-box testing experiments, or more precisely by lighted button testing experiments [BM92]. As divergence is considered we give the semantics as a preorder, the readiness preorder, which kernel coincides with the readiness equivalence of [OH86]. This leads to a bisimulation like characterization and a modal characterization of the semantics. A concrete language, recursive free CCS without τ, is introduced, a proof system defined and it is shown to be sound and complete with respect to the readiness preorder. In the completeness proof the modal characterization plays an important role as it allows us to prove algebraicity of the preorder purely operationally. Foundation.

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

Access this chapter

Log in via an institution

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. S. Abramsky. A domain equation for bisimulation. Information and Computation, 92:161–218, 1991.

    Google Scholar 

  2. L. Aceto and M. Hennessy. Termination, deadlock and divergence. Journal of the ACM, 39(1):147–187, January 1992.

    Google Scholar 

  3. J.A. Bergstra, J.W. Klop, and E.-R. Olderog. Readies and failures in the algebra of communicating processes. SIAM Journal on Computing, 17(6):1134–1177, 1988.

    Google Scholar 

  4. B. Bloom and A.R. Meyer. Experimenting with process equivalence. Theoretical Computer Science, 101(2):223–237, 1992.

    Google Scholar 

  5. DeNicola, R. and M. Hennessy. Testing equivalences for processes. Theoretical Computer Science, 34:83–133, 1984.

    Google Scholar 

  6. R.J. van Glabbeek. The linear time — branching time spectrum. In J.C.M. Baeten and J.W. Klop, editors, Proceedings CONCUR 90, Amsterdam, volume 458 of Lecture Notes in Computer Science, pages 278–297. Springer-Verlag, 1990.

    Google Scholar 

  7. Robert Jan van Glabbeek. The linear time — branching time spectrum II: the semantics of sequential processes with silent moves. In E. Best, editor, Proceedings CONCUR 93, Hildesheim, Germany, volume 715 of Lecture Notes in Computer Science, pages 66–81. Springer-Verlag, 1993.

    Google Scholar 

  8. M. Hennessy. Algebraic Theory of Processes. MIT Press, Cambridge, Massachusetts, 1988.

    Google Scholar 

  9. M. Hennessy and A. Ingólfsdóttir. A theory of communicating processes with value-passing. Information and Computation, 107(2):202–236, 1993.

    Google Scholar 

  10. A. Ingólfsdóttir. A semantic theory for value-passing processes late approach — Part II: A behavioural semantics and full abstractness. Report RS-95-22, BRICS (Basic Research in Computer Science, Centre of the Danish National Research Foundation), Institute for Electronic Systems, Department of Mathematics and Computer Science, Aalborg University Centre, April 1995.

    Google Scholar 

  11. A. Ingólfsdóttir. Weak Semantics Based on Lighted Button Pressing Experiments — An Alternative Characterization of the Readiness Semantics. Report RS-96-43, BRICS (Basic Research in Computer Science, Centre of the Danish National Research Foundation), Institute for Electronic Systems, Department of Computer Science, Aalborg University, 1996.

    Google Scholar 

  12. R. Milner. A Calculus of Communicating Systems, volume 92 of Lecture Notes in Computer Science. Springer-Verlag, 1980.

    Google Scholar 

  13. E.-R. Olderog and C.A.R. Hoare. Specification-oriented semantics for communicating processes. Acta Informatica, 23:9–66, 1986.

    Google Scholar 

  14. Bernhard Steffen and Anna Ingólfsdóttir. Characteristic formulae for processes with divergence. Information and Computation, 110(1):149–163, April 1994.

    Google Scholar 

  15. A. Tarski. A lattice-theoretical fixpoint theorem and its applications. Pacific Journal of Mathematics, 5, 1955.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Basic Research in Computer Science, Centre of the Danish National Research, Department of Computer Science, Aalborg University, Denmark

    Anna Ingólfsdóttir

Authors
  1. Anna Ingólfsdóttir
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Dirk van Dalen Marc Bezem

Rights and permissions

Reprints and permissions

Copyright information

© 1997 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Ingólfsdóttir, A. (1997). Weak semantics based on lighted button pressing experiments. In: van Dalen, D., Bezem, M. (eds) Computer Science Logic. CSL 1996. Lecture Notes in Computer Science, vol 1258. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-63172-0_42

Download citation

  • DOI: https://doi.org/10.1007/3-540-63172-0_42

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-63172-9

  • Online ISBN: 978-3-540-69201-0

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation