Skip to main content

Advertisement

SpringerLink
Log in
Menu
Find a journal Publish with us
Search
Cart
Book cover

IFIP International Conference on Theoretical Computer Science

TCS 2012: Theoretical Computer Science pp 134–148Cite as

  1. Home
  2. Theoretical Computer Science
  3. Conference paper
A Modular LTS for Open Reactive Systems

A Modular LTS for Open Reactive Systems

  • Fabio Gadducci18,
  • Giacoma Valentina Monreale18 &
  • Ugo Montanari18 
  • Conference paper
  • 788 Accesses

  • 1 Citations

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

Abstract

The theory of reactive systems (RSs) represents a fruitful proposal for deriving labelled transition systems (LTSs) from unlabelled ones. The synthesis of an LTS allows for the use of standard techniques in the analysis of systems, as witnessed by the widespread adoption of behavioral semantics. Recent proposals addressed one of the main drawbacks of RSs, namely, its restriction to the analysis of ground (i.e., completely specified) systems. A still unresolved issue concerns the lack of a presentation via inference rules for the derived LTS, thus hindering the modularity of the presentation. Our paper considers open RSs. We first introduce a variant of the current proposal based on “luxes”: our technique is applicable to a larger number of case studies and, under some conditions, it synthesises a smaller LTS. Then, we illustrate how the LTS derived by using our approach can be equipped with a SOS-like presentation via an encoding into tile systems.

Keywords

  • Open reactive systems
  • labelled transitions
  • tile systems

Partly supported by the EU FP7-ICT IP ASCEns and by the MIUR PRIN SisteR.

Download conference paper PDF

References

  1. Bonchi, F., Gadducci, F., Monreale, G.V.: Labelled Transitions for Mobile Ambients (As Synthesized Via a Graphical Encoding). In: EXPRESS 2008. ENTCS, vol. 242(1), pp. 73–98. Elsevier, Amsterdam (2009)

    Google Scholar 

  2. Bonchi, F., Gadducci, F., Monreale, G.V.: Reactive Systems, Barbed Semantics, and the Mobile Ambients. In: de Alfaro, L. (ed.) FOSSACS 2009. LNCS, vol. 5504, pp. 272–287. Springer, Heidelberg (2009)

    CrossRef  Google Scholar 

  3. Bruni, R., Gadducci, F., Montanari, U., Sobociński, P.: Deriving Weak Bisimulation Congruences from Reduction Systems. In: Abadi, M., de Alfaro, L. (eds.) CONCUR 2005. LNCS, vol. 3653, pp. 293–307. Springer, Heidelberg (2005)

    CrossRef  Google Scholar 

  4. Bruni, R., Meseguer, J., Montanari, U.: Symmetric Monoidal and Cartesian Double Categories as a Semantics Framework for tile Logic. MSCS 12(1), 53–90 (2002)

    MathSciNet  MATH  Google Scholar 

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

    CrossRef  MathSciNet  MATH  Google Scholar 

  6. Gadducci, F., Montanari, U.: The Tile Model. In: Proof, Language and Interaction: Essays in Honour of Robin Milner, pp. 133–166. MIT Press, Cambridge (2000)

    Google Scholar 

  7. Kelly, G.M., Street, R.: Review of the Elements of 2-Categories. In: Sydney Category Seminar. LNM, vol. 420, pp. 75–103. Springer, Heidelberg (1974)

    CrossRef  Google Scholar 

  8. Klin, B., Sassone, V., Sobociński, P.: Labels from Reductions: Towards a General Theory. In: Fiadeiro, J.L., Harman, N.A., Roggenbach, M., Rutten, J. (eds.) CALCO 2005. LNCS, vol. 3629, pp. 30–50. Springer, Heidelberg (2005)

    CrossRef  Google Scholar 

  9. Leifer, J.J., Milner, R.: Deriving Bisimulation Congruences for Reactive Systems. In: Palamidessi, C. (ed.) CONCUR 2000. LNCS, vol. 1877, pp. 243–258. Springer, Heidelberg (2000)

    CrossRef  Google Scholar 

  10. MacLane, S.: Categorical Algebra. Bull. Amer. Math. Soc. 71, 40–106 (1965)

    CrossRef  MathSciNet  MATH  Google Scholar 

  11. Merro, M., Zappa Nardelli, F.: Behavioral Theory for Mobile Ambients. Journal of the ACM 52(6), 961–1023 (2005)

    CrossRef  MathSciNet  Google Scholar 

  12. Meseguer, J.: Conditional Rewriting Logic as a Unified Model of Concurrency. TCS 96(1), 73–155 (1992)

    CrossRef  MathSciNet  MATH  Google Scholar 

  13. Palmquist, P.H.: The Double Category of Adjoint Squares. In: Midwest Category Seminar. LNM, vol. 195, pp. 123–153. Springer, Heidelberg (1971)

    CrossRef  Google Scholar 

  14. Power, A.J.: An Abstract Formulation for Rewrite Systems. In: Dybjer, P., Pitts, A.M., Pitt, D.H., Poigné, A., Rydeheard, D.E. (eds.) CTCS 1989. LNCS, vol. 389, pp. 300–312. Springer, Heidelberg (1989)

    CrossRef  Google Scholar 

  15. Rathke, J., Sobociński, P.: 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)

    CrossRef  Google Scholar 

  16. Sassone, V., Sobocinski, P.: Deriving Bisimulation Congruences Using 2-Categories. Nordic Journal of Computing 10(2), 163–183 (2003)

    MathSciNet  MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Dipartimento di Informatica, Università di Pisa, Italy

    Fabio Gadducci, Giacoma Valentina Monreale & Ugo Montanari

Authors
  1. Fabio Gadducci
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Giacoma Valentina Monreale
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Ugo Montanari
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Centrum Wiskunde & Informatica (CWI), Science Park 123, 1098 XG, Amsterdam, The Netherlands

    Jos C. M. Baeten & Frank S. de Boer & 

  2. Microsoft Research, One Microsoft Way, 98052, Redmond, WA, USA

    Tom Ball

Rights and permissions

Reprints and Permissions

Copyright information

© 2012 IFIP International Federation for Information Processing

About this paper

Cite this paper

Gadducci, F., Monreale, G.V., Montanari, U. (2012). A Modular LTS for Open Reactive Systems. In: Baeten, J.C.M., Ball, T., de Boer, F.S. (eds) Theoretical Computer Science. TCS 2012. Lecture Notes in Computer Science, vol 7604. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-33475-7_10

Download citation

  • .RIS
  • .ENW
  • .BIB
  • DOI: https://doi.org/10.1007/978-3-642-33475-7_10

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-33474-0

  • Online ISBN: 978-3-642-33475-7

  • eBook Packages: Computer ScienceComputer Science (R0)

Share this paper

Anyone you share the following link with will be able to read this content:

Sorry, a shareable link is not currently available for this article.

Provided by the Springer Nature SharedIt content-sharing initiative

Search

Navigation

  • Find a journal
  • Publish with us

Discover content

  • Journals A-Z
  • Books A-Z

Publish with us

  • Publish your research
  • Open access publishing

Products and services

  • Our products
  • Librarians
  • Societies
  • Partners and advertisers

Our imprints

  • Springer
  • Nature Portfolio
  • BMC
  • Palgrave Macmillan
  • Apress
  • Your US state privacy rights
  • Accessibility statement
  • Terms and conditions
  • Privacy policy
  • Help and support

167.114.118.210

Not affiliated

Springer Nature

© 2023 Springer Nature