Skip to main content
SpringerLink
Log in

Labels from Reductions: Towards a General Theory

  • Conference paper
Algebra and Coalgebra in Computer Science (CALCO 2005)

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

Included in the following conference series:

Abstract

We consider open terms and parametric rules in the context of the systematic derivation of labelled transitions from reduction systems.

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 re writing. In: Walukiewicz, I. (ed.) FOSSACS 2004. LNCS, vol. 2987, pp. 151–166. Springer, Heidelberg (2004)

    Chapter  Google Scholar 

  2. Gadducci, F., Montanari, U.: The tile model. In: Plotkin, G., Stirling, C., Tofte, M. (eds.) Proof, Language and Interaction: Essays in Honour of Robin Milner, pp. 133–166. MIT Press, Cambridge (2000)

    Google Scholar 

  3. Jensen, O.H., Milner, R.: Bigraphs and mobile processes. Technical Report 570, University of Cambridge (2003)

    Google Scholar 

  4. 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 

  5. Mac Lane, S.: Categorical algebra. Bulletin of the American Mathematical Society 71, 40–106 (1965)

    Article  MathSciNet  Google Scholar 

  6. Mac Lane, S.: Categories for the Working Mathematician, 2nd edn. Graduate Texts in Mathematics. Springer, Heidelberg (1992)

    Google Scholar 

  7. Milner, R.: Calculi for interaction. Acta Informatica 33(8), 707–737 (1996)

    Article  MathSciNet  Google Scholar 

  8. Milner, R.: Bigraphical reactive systems. In: Larsen, K.G., Nielsen, M. (eds.) CONCUR 2001. LNCS, vol. 2154, pp. 16–35. Springer, Heidelberg (2001)

    Chapter  Google Scholar 

  9. Milner, R.: Bigraphs for petri nets. In: Desel, J., Reisig, W., Rozenberg, G. (eds.) Lectures on Concurrency and Petri Nets. LNCS, vol. 3098, pp. 686–701. Springer, Heidelberg (2004)

    Chapter  Google Scholar 

  10. Plotkin, G.: A structural approach to operational semantics. Technical Report DAIMI FN-19, Aarhus University, Computer Science Department (1981)

    Google Scholar 

  11. Sassone, V., Sobociński, P.: Deriving bisimulation congruences using 2-categories. Nordic Journal of Computing 10(2), 163–183 (2003)

    MATH  MathSciNet  Google Scholar 

  12. Sassone, V., Sobociński, P.: A congruence for Petri nets. In: Workshop on Petri Nets and Graph Transformation. ENTCS, vol. 127, pp. 107–120 (2005)

    Google Scholar 

  13. Sassone, V., Sobociński, P.: Locating reaction with 2-categories. Theoretical Computer Science 333(1-2), 297–327 (2005)

    Article  MATH  MathSciNet  Google Scholar 

  14. Sassone, V., Sobociński, P.: Reactive systems over cospans. In: Proceedings of Logics in Computer Science. LICS 2005. IEEE Press, Los Alamitos (2005)

    Google Scholar 

  15. Sewell, P.: Working notes PS15–PS19, Unpublished notes (2000)

    Google Scholar 

  16. Sewell, P.: From rewrite rules to bisimulation congruences. Theoretical Computer Science 274(1–2), 183–230 (2002)

    Article  MATH  MathSciNet  Google Scholar 

  17. Sobociński, P.: Deriving process congruences from reaction rules. PhD thesis, BRICS, University of Aarhus (2004)

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Warsaw University, University of Sussex, and PPS – Université Paris VII,  

    Bartek Klin, Vladimiro Sassone & Paweł Sobociński

Authors
  1. Bartek Klin
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Vladimiro Sassone
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Paweł Sobociński
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

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

    José Luiz Fiadeiro

  2. Department of Computer Science, University of Wales Swansea, SA2 8PP, Swansea, UK

    Neil Harman

  3. University of Wales Swansea, United Kingdom

    Markus Roggenbach

  4. CWI and Vrije Universiteit Amsterdam,  

    Jan Rutten

Rights and permissions

Reprints and permissions

Copyright information

© 2005 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Klin, B., Sassone, V., Sobociński, P. (2005). Labels from Reductions: Towards a General Theory. In: Fiadeiro, J.L., Harman, N., Roggenbach, M., Rutten, J. (eds) Algebra and Coalgebra in Computer Science. CALCO 2005. Lecture Notes in Computer Science, vol 3629. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11548133_2

Download citation

  • DOI: https://doi.org/10.1007/11548133_2

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-28620-2

  • Online ISBN: 978-3-540-31876-7

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation