Skip to main content
SpringerLink
Log in

Congruence Results of Weak Equivalence for a Graph Rewriting Model of Concurrent Programs with Higher-Order Communication

  • Conference paper
Advances in Wireless, Mobile Networks and Applications (ICCSEA 2011, WiMoA 2011)

Part of the book series: Communications in Computer and Information Science ((CCIS,volume 154))

  • 568 Accesses

Abstract

This paper presents congruence results of a weak equivalence on a graph rewriting model of concurrent processes with higher-order communication. A bipartite directed acyclic graph represents a concurrent system that consists of a number of processes and messages in our model. The model presented here makes it possible to represent local names that their scopes are not nested. We show that weak bisimulation equivalence is a congruence relation w.r.t. operations that correspond to τ-prefix, input prefix, new-name, replication, composition and application respectively.

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. Ehrig, H., König, B.: Deriving Bisimulation Congruences in the DPO Approach to Graph Rewriting with Borrowed Contexts. Mathematical Structures in Computer Science 16(6), 1133–1163 (2006)

    Article  MathSciNet  MATH  Google Scholar 

  2. Gadducci, F.: Term Graph rewriting for the π-calculus. In: Ohori, A. (ed.) APLAS 2003. LNCS, vol. 2895, pp. 37–54. Springer, Heidelberg (2003)

    Chapter  Google Scholar 

  3. König, B.: A Graph Rewriting Semantics for the Polyadic π-Calculus. In: Proc. of GT-VMT 2000, Workshop on Graph Transformation and Visual Modeling Techniques, pp. 451–458 (2000)

    Google Scholar 

  4. Milner, R.: The Space and Motion of Communicating Systems. Cambridge University Press, Cambridge (2009)

    Book  MATH  Google Scholar 

  5. Murakami, M.: A Formal Model of Concurrent Systems Based on Bipartite Directed Acyclic Graph. Science of Computer Programming 61, 38–47 (2006)

    Article  MathSciNet  MATH  Google Scholar 

  6. Murakami, M.: Congruence Results of Behavioral Equivalence for A Graph Rewriting Model of Concurrent Programs. In: Proc of ICITA 2008, pp. 636–641 (2008)

    Google Scholar 

  7. Murakami, M.: A Graph Rewriting Model of Concurrent Programs with Higher-Order Communication. In: Proc. of TMFCS 2008, pp.80–87 (2008)

    Google Scholar 

  8. Murakami, M.: Congruence Results of Scope Equivalence for a Graph Rewriting Model of Concurrent Programs. In: Fitzgerald, J.S., Haxthausen, A.E., Yenigun, H. (eds.) ICTAC 2008. LNCS, vol. 5160, pp. 243–257. Springer, Heidelberg (2008)

    Chapter  Google Scholar 

  9. Murakami, M.: On Congruence Property of Scope Equivalence for Concurrent Programs with Higher-Order Communication. In: Proc of CPA 2009, pp. 49–66. IOS Press, Amsterdam (2009)

    Google Scholar 

  10. Murakami, M.: Congruence Results of Behavioral Equivalence for A Graph Rewriting Model of Concurrent Programs with Higher-Order Communication. Journal of Networking Technology 1(3), 106–112 (2010)

    Google Scholar 

  11. Sangiorgi, D., Walker, D.: The π-calculus, A Theory of Mobile Processes. Cambridge University Press, Cambridge (2001)

    MATH  Google Scholar 

  12. Sangiorgi, D.: Asynchronous Process Calculi: The First- and Higher-order Paradigms. Theoretical Computer Science 253, 311–350 (2001)

    Article  MathSciNet  MATH  Google Scholar 

  13. Sassone, V., Sobociński, P.: Reactive systems over cospans. In: Proc. of LICS 2005, pp. 311–320. IEEE, Los Alamitos (2005)

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Computer Science, Graduate School of Natural Science and Technology, Okayama University, 3-1-1, Tsushima-Naka, Kita-ku, Okayama, 700-0082, Japan

    Masaki Murakami

Authors
  1. Masaki Murakami
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. University of Essex, Colchester, UK

    Salah S. Al-Majeed

  2. National Central University, Jung-li City, Taoyuan, Taiwan

    Chih-Lin Hu

  3. Wireilla Net Solutions PTY Ltd, Melbourne, Victoria, Australia

    Dhinaharan Nagamalai

Rights and permissions

Reprints and permissions

Copyright information

© 2011 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Murakami, M. (2011). Congruence Results of Weak Equivalence for a Graph Rewriting Model of Concurrent Programs with Higher-Order Communication. In: Al-Majeed, S.S., Hu, CL., Nagamalai, D. (eds) Advances in Wireless, Mobile Networks and Applications. ICCSEA WiMoA 2011 2011. Communications in Computer and Information Science, vol 154. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-21153-9_16

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-21153-9_16

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-21152-2

  • Online ISBN: 978-3-642-21153-9

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation