Skip to main content
SpringerLink
Log in

Refusal Simulation and Interactive Games

  • Conference paper
  • First Online:
Algebraic Methodology and Software Technology (AMAST 2002)

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

Abstract

We present refusal simulation relation as a candidate for the finest branching time relation that is solely based on all locally observable and testable properties of processes, and no other properties. Apart from several known characterisations, we introduce a new one in terms of interactive games. Two general formats of transition rules, based on the new Ordered Structural Operational Semantics approach [20], are given such that refusal simulation and its rooted version are preserved in arbitrary process languages definable within the respective formats.

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 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.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. S. Abramsky. Observation equivalence as a testing equivalence. Theoretical Computer Science, 53:225–241, 1987.

    Article  MATH  MathSciNet  Google Scholar 

  2. L. Aceto, W. Fokkink, R. van Glabbeek, and A. Ingólfsdóttir. Axiomatizing prefix iteration with silent steps. Information and Computation, 127:1–52, 1996.

    Article  MathSciNet  Google Scholar 

  3. J. C. M. Baeten and W. P. Weijland. Process Algebra, volume 18 of Cambridge Tracts in Theoretical Computer Science. Cambridge University Press, 1990.

    Google Scholar 

  4. B. Bloom. Structural operational semantics for weak bisimulations. Theoretical Computer Science, 146:27–68, 1995.

    Article  MathSciNet  Google Scholar 

  5. B. Bloom, S. Istrail, and A. R. Meyer. Bisimulation can’t be traced. Journal of the ACM, 42(1):232–268, 1995.

    Article  MATH  MathSciNet  Google Scholar 

  6. J. F. Groote. Transition system specifications with negative premises. Theoretical Computer Science, 118(2):263–299, 1993.

    Article  MATH  MathSciNet  Google Scholar 

  7. C. A. R. Hoare. Communicating Sequential Processes. Prentice Hall, 1985.

    Google Scholar 

  8. K. G. Larsen and A. Skou. Bisimulation through probabilistic testing. Information and Computation, 94(1):1–28, 1992.

    Article  MathSciNet  Google Scholar 

  9. R. Milner. Communication and Concurrency. Prentice Hall, 1989.

    Google Scholar 

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

    Article  MATH  MathSciNet  Google Scholar 

  11. D. M. Park. Concurrency on automata and infinite sequences. In P. Deussen, editor, Conference on Theoretical Computer Science, volume 104 of LNCS. Springer, 1981.

    Google Scholar 

  12. I. C. C. Phillips. Refusal testing. Theoretical Computer Science, 50:241–284, 1987.

    Article  MATH  MathSciNet  Google Scholar 

  13. G. Plotkin. A structural approach to operational semantics. Technical Report DAIMI FN-19, Aarhus University, 1981.

    Google Scholar 

  14. A. W. Roscoe. The Theory and Practice of Concurrency. Prentice Hall, 1998.

    Google Scholar 

  15. R. de Simone. Higher-level synchronising devices in MEIJE-SCCS. Theoretical Computer Science, 37:245–267, 1985.

    Article  MATH  MathSciNet  Google Scholar 

  16. C. Stirling. Modal and Temporal Properties of Processes. Graduate Texts in Computer Science. Springer, 2001.

    Google Scholar 

  17. I. Ulidowski. Equivalences on observable processes. In Proceedings of the 7th IEEE Symposium on Logic in Computer Science LICS’92, pages 148–159. IEEE, Computer Science Press, 1992.

    Google Scholar 

  18. I. Ulidowski. Local Testing and Implementable Concurrent Processes. PhD thesis, Imperial College, University of London, 1994.

    Google Scholar 

  19. I. Ulidowski. Finite axiom systems for testing preorder and De Simone process languages. Theoretical Computer Science, 239(1):97–139, 2000.

    Article  MATH  MathSciNet  Google Scholar 

  20. I. Ulidowski and I. C. C. Phillips. Ordered SOS rules and process languages for branching and eager bisimulations. Technical Report 1999/15, Deptartment of Mathematics and Computer Science, Leicester University, 1999. To appear in Information and Computation.

    Google Scholar 

  21. I. Ulidowski and S. Yuen. Process languages for rooted eager bisimulation. In D. Miller and C. Palamidessi, editors, Proceedings of the 11th Conference on Concurrency Theory CONCUR 2000, volume 1877 of LNCS. Springer, 2000.

    Google Scholar 

  22. J. van Benthem. Language in Action: Categories, Lambdas and Dynamic Logic, volume 130 of Studies in Logic. North-Holland, 1991.

    Google Scholar 

  23. R. J. van Glabbeek. The linear time— branching time spectrum I. In J. A. Bergstra, A. Ponse, and S. A. Smolka, editors, Handbook of Process Algebra, pages 3–99. Elsevier Science, 2001.

    Google Scholar 

  24. C. Verhoef. A congruence theorem for structured operational semantics with predicates and negative premises. Nordic Journal of Computing, 2(2):274–302, 1995.

    MATH  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Mathematics and Computer Science, University of Leicester, University Road, LE1 7RH, Leicester, UK

    Irek Ulidowski

Authors
  1. Irek Ulidowski
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. LORIA - CNRS & INRIA, Campus Scientifique, Bâtiment LORIA, BP 239, 54506, Vandoeuvre-lès-Nancy, France

    Hélène Kirchner

  2. LORIA - INRIA, 615, rue du Jardin Botanique, 54602, Villers-lès-Nancy, France

    Christophe Ringeissen

Rights and permissions

Reprints and permissions

Copyright information

© 2002 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Ulidowski, I. (2002). Refusal Simulation and Interactive Games. In: Kirchner, H., Ringeissen, C. (eds) Algebraic Methodology and Software Technology. AMAST 2002. Lecture Notes in Computer Science, vol 2422. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-45719-4_15

Download citation

  • DOI: https://doi.org/10.1007/3-540-45719-4_15

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

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

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

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation