Skip to main content
SpringerLink
Log in
Book cover

International Conference on Concurrency Theory

CONCUR 2006: CONCUR 2006 – Concurrency Theory pp 406–420Cite as

Generic Forward and Backward Simulations

  • Conference paper

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

Abstract

The technique of forward/backward simulations has been applied successfully in many distributed and concurrent applications. In this paper, however, we claim that the technique can actually have more genericity and mathematical clarity. We do so by identifying forward/backward simulations as lax/oplax morphisms of coalgebras. Starting from this observation, we present a systematic study of this generic notion of simulations. It is meant to be a generic version of the study by Lynch and Vaandrager, covering both non-deterministic and probabilistic systems. In particular we prove soundness and completeness results with respect to trace inclusion: the proof is by coinduction using the generic theory of traces developed by Jacobs, Sokolova and the author. By suitably instantiating our generic framework, one obtains the appropriate definition of forward/backward simulations for various kinds of systems, for which soundness and completeness come for free.

An extended version of this paper appears as [6].

This is a preview of subscription content, 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

Learn about institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Cheung, L.: Reconciling Nondeterministic and Probabilistic Choices. PhD thesis, Radboud Univ. Nijmegen (2006)

    Google Scholar 

  2. Fiore, M.: A coinduction principle for recursive data types based on bisimulation. Inf. & Comp. 127(2), 186–198 (1996)

    Article  MathSciNet  MATH  Google Scholar 

  3. Garland, S., Lynch, N., Vaziri, M.: IOA: a language for specifying, programming, and validating distributed systems. MIT Laboratory for Computer Science, Cambridge (1997)

    Google Scholar 

  4. Hasuo, I., Jacobs, B.: Context-Free Languages via Coalgebraic Trace Semantics. In: Fiadeiro, J.L., Harman, N.A., Roggenbach, M., Rutten, J. (eds.) CALCO 2005. LNCS, vol. 3629, pp. 213–231. Springer, Heidelberg (2005)

    Chapter  Google Scholar 

  5. Hasuo, I., Jacobs, B., Sokolova, A.: Generic trace theory. In: Coalgebraic Methods in Computer Science (CMCS 2006). Elect. Notes in Theor. Comp. Sci. Elsevier, Amsterdam (2006)

    Google Scholar 

  6. Hasuo, I.: Generic forward and backward simulations. Technical report, Research Center for Verification and Semantics, National Institute of Advanced Industrial Science and Technology (AIST), Japan (2006), http://www.cs.ru.nl/ichiro/papers/

  7. Hughes, J., Jacobs, B.: Simulations in coalgebra. Theor. Comp. Sci. 327(1-2), 71–108 (2004)

    Article  MathSciNet  MATH  Google Scholar 

  8. Jou, C., Smolka, S.: Equivalences, congruences and complete axiomatizations for probabilistic processes. In: Baeten, J.C.M., Klop, J.W. (eds.) CONCUR 1990. LNCS, vol. 458, pp. 367–383. Springer, Heidelberg (1990)

    Google Scholar 

  9. Kawabe, Y., Mano, K., Sakurada, H., Tsukada, Y.: Backward simulations for anonymity. In: International Workshop on Issues in the Theory of Security (WITS 2006) (2006)

    Google Scholar 

  10. Kinoshita, Y., Power, J.: Data refinement and algebraic structure. Acta Informatica 36, 693–719 (2000)

    Article  MathSciNet  MATH  Google Scholar 

  11. Klarlund, N., Schneider, F.: Verifying safety properties using infinite-state automata. Technical Report 89-1039, Department of Computer Science, Cornell University, Ithaca, New York (1989)

    Google Scholar 

  12. Lynch, N., Vaandrager, F.: Forward and backward simulations. I. Untimed systems. Inf. & Comp. 121(2), 214–233 (1995)

    Article  MathSciNet  MATH  Google Scholar 

  13. Power, J., Turi, D.: A coalgebraic foundation for linear time semantics. In: Category Theory and Computer Science. Elect. Notes in Theor. Comp. Sci, vol. 29. Elsevier, Amsterdam (1999)

    Google Scholar 

  14. Rutten, J.: Universal coalgebra: a theory of systems. Theor. Comp. Sci. 249, 3–80 (2000)

    Article  MathSciNet  MATH  Google Scholar 

  15. Segala, R., Lynch, N.: Probabilistic simulations for probabilistic processes. Nordic Journ. Comput. 2(2), 250–273 (1995)

    MathSciNet  MATH  Google Scholar 

  16. Sokolova, A.: Coalgebraic Analysis of Probabilistic Systems. PhD thesis, TU Eindhoven (2005)

    Google Scholar 

  17. van Glabbeek, R., Smolka, S., Steffen, B.: Reactive, generative, and stratified models of probabilistic processes. Inf. & Comp. 121, 59–80 (1995)

    Article  MATH  Google Scholar 

  18. Wu, S.H., Smolka, S.A., Stark, E.W.: Composition and behaviors of probabilistic I/O automata. Theor. Comp. Sci. 176(1–2), 1–38 (1997)

    Article  MathSciNet  MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Institute for Computing and Information Sciences, Radboud University Nijmegen, The Netherlands

    Ichiro Hasuo

Authors
  1. Ichiro Hasuo
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Institute for Theoretical Computer Science, Technical University Dresden, Germany

    Christel Baier

  2. INRIA, VASY, Grenoble Rhône-Alpes, France

    Holger Hermanns

Rights and permissions

Reprints and permissions

Copyright information

© 2006 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Hasuo, I. (2006). Generic Forward and Backward Simulations. In: Baier, C., Hermanns, H. (eds) CONCUR 2006 – Concurrency Theory. CONCUR 2006. Lecture Notes in Computer Science, vol 4137. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11817949_27

Download citation

  • DOI: https://doi.org/10.1007/11817949_27

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-37376-6

  • Online ISBN: 978-3-540-37377-3

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation