Skip to main content
SpringerLink
Log in

LTS Semantics for Process Calculi from Their Graphical Encodings

  • Conference paper
Graph Transformations (ICGT 2010)

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

Included in the following conference series:

  • 553 Accesses

Abstract

The behaviour of a computational device is often naturally defined by means of reduction semantics: a set representing the possible states of the device, and an unlabelled relation among them, usually inductively defined, representing the possible evolutions of the device. Despite the advantage of conveying the semantics with few compact rewriting rules, freely instantiated and contextualized, the main drawback of reduction-based solutions is that the dynamic behaviour of a system is described in a monolithic way, and so it can be interpreted only by inserting the system in appropriate contexts, where a reduction may take place.

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. Bonchi, F., Gadducci, F., König, B.: Process bisimulation via a graphical encoding. In: Corradini, A., Ehrig, H., Montanari, U., Ribeiro, L., Rozenberg, G. (eds.) ICGT 2006. LNCS, vol. 4178, pp. 168–183. Springer, Heidelberg (2006)

    Chapter  Google Scholar 

  2. Bonchi, F., Gadducci, F., Monreale, G.: Reactive systems, barbed semantics, and the mobile ambients. In: de Alfaro, L. (ed.) FOSSACS 2009. LNCS, vol. 5504, pp. 272–287. Springer, Heidelberg (2009)

    Chapter  Google Scholar 

  3. Bonchi, F., Gadducci, F., Monreale, G.V.: Labelled transitions for mobile ambients. In: EXPRESS 2008. ENTCS, vol. 242(1), pp. 73–98 (2009)

    Google Scholar 

  4. Bonchi, F., Gadducci, F., Monreale, G.V., Montanari, U.: Saturated LTSs for Adhesive Rewriting Systems. In: Ehrig, H., et al. (eds.) ICGT 2010. LNCS, vol. 6372, pp. 122–137. Springer, Heidelberg (2010)

    Google Scholar 

  5. Cardelli, L., Gordon, A.: Mobile ambients. TCS 240(1), 177–213 (2000)

    Article  MATH  MathSciNet  Google Scholar 

  6. Ehrig, H., König, B.: Deriving bisimulation congruences in the DPO approach to graph rewriting with borrowed contexts. MSCS 16(6), 1133–1163 (2006)

    MATH  Google Scholar 

  7. Gadducci, F.: Graph rewriting for the π-calculus. MSCS 17(3), 407–437 (2007)

    MATH  MathSciNet  Google Scholar 

  8. Gadducci, F., Monreale, G.V.: A decentralized implementation of mobile ambients. In: Ehrig, H., Heckel, R., Rozenberg, G., Taentzer, G. (eds.) ICGT 2008. LNCS, vol. 5214, pp. 115–130. Springer, Heidelberg (2008)

    Chapter  Google Scholar 

  9. Gadducci, F., Montanari, U.: A concurrent graph semantics for mobile ambients. In: MFPS 2001. ENTCS, vol. 45. Elsevier, Amsterdam (2001)

    Google Scholar 

  10. Grohmann, D., Miculan, M.: Deriving barbed bisimulations for bigraphical reactive systems. In: ICGT 2008 - Doctoral Symposium. ECEASST, EASST, vol. 16 (2008)

    Google Scholar 

  11. Leifer, J., Milner, R.: Deriving bisimulation congruences for reactive systems. In: Palamidessi, C. (ed.) CONCUR 2000. LNCS, vol. 1877, pp. 243–258. Springer, Heidelberg (2000)

    Chapter  Google Scholar 

  12. Merro, M., Zappa Nardelli, F.: Behavioral theory for mobile ambients. JACM 52(6), 961–1023 (2005)

    Article  MathSciNet  Google Scholar 

  13. Sobociński, P., Rathke, J.: Deriving structural labelled transitions for mobile ambients. In: van Breugel, F., Chechik, M. (eds.) CONCUR 2008. LNCS, vol. 5201, pp. 462–476. Springer, Heidelberg (2008)

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Dipartimento di Informatica, Università di Pisa,  

    Giacoma Valentina Monreale

Authors
  1. Giacoma Valentina Monreale
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Institut für Softwaretechnik und Theoretische Informatik, Technische Universität Berlin, Franklinstr. 28/29, 10587, Berlin, Germany

    Hartmut Ehrig

  2. Afdeling Informatica, Universiteit Twente, Drienerlolaan 5, 7522, Enschede, NB, The Netherlands

    Arend Rensink

  3. Leiden Institute of Advanced Computer Science (LIACS), Universiteit Leiden, Niels Bohrweg 1, 2333, Leiden, CA, The Netherlands

    Grzegorz Rozenberg

  4. Fachgebiet Echtzeitsysteme, Technische Universität Darmstadt, Merckstraße 25, 64283, Darmstadt, Germany

    Andy Schürr

Rights and permissions

Reprints and permissions

Copyright information

© 2010 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Monreale, G.V. (2010). LTS Semantics for Process Calculi from Their Graphical Encodings. In: Ehrig, H., Rensink, A., Rozenberg, G., Schürr, A. (eds) Graph Transformations. ICGT 2010. Lecture Notes in Computer Science, vol 6372. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-15928-2_33

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-15928-2_33

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-15927-5

  • Online ISBN: 978-3-642-15928-2

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation