Skip to main content

Dynamic Reactive Modules

  • Conference paper
CONCUR 2011 – Concurrency Theory (CONCUR 2011)

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

Included in the following conference series:

Abstract

State-transition systems communicating by shared variables have been the underlying model of choice for applications of model checking. Such formalisms, however, have difficulty with modeling process creation or death and communication reconfigurability. Here, we introduce “dynamic reactive modules” (DRM), a state-transition modeling formalism that supports dynamic reconfiguration and creation/death of processes. The resulting formalism supports two types of variables, data variables and reference variables. Reference variables enable changing the connectivity between processes and referring to instances of processes. We show how this new formalism supports parallel composition and refinement through trace containment. DRM provide a natural language for modeling (and ultimately reasoning about) biological systems and multiple threads communicating through shared variables.

This work was supported by the ERC Advanced Grant QUAREM, the FWF NFN Grant S11402-N23 (RiSE), and the EU NOE Grant ArtistDesign.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

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. Alur, R., Grosu, R.: Dynamic Reactive Modules. Tech. Rep. 2004/6, Stony Brook (2004)

    Google Scholar 

  2. Alur, R., Henzinger, T.A.: Reactive modules. FMSD 15(1), 7–48 (1999)

    Google Scholar 

  3. Attie, P.C., Lynch, N.A.: Dynamic input/output automata, a formal model for dynamic systems. In: PODC, pp. 314–316 (2001)

    Google Scholar 

  4. Clarke, E.M., Grumberg, O., Peled, D.: Model Checking. MIT Press, Cambridge (1999)

    Google Scholar 

  5. Colaço, J.-L., Girault, A., Hamon, G., Pouzet, M.: Towards a higher-order synchronous data-flow language. In: EmSoft, pp. 230–239. ACM, New York (2004)

    Chapter  Google Scholar 

  6. Damm, W., Josko, B., Pnueli, A., Votintseva, A.: A discrete-time UML semantics for concurrency and communication in safety-critical applications. SCP 55(1-3), 81–115 (2005)

    MathSciNet  MATH  Google Scholar 

  7. Efroni, S., Harel, D., Cohen, I.R.: Toward rigorous comprehension of biological complexity: Modeling, execution, and visualization of thymic T-cell maturation. Genome. Res. 13(11), 2485–2497 (2003)

    Google Scholar 

  8. Efroni, S., Harel, D., Cohen, I.R.: Emergent dynamics of thymocyte development and lineage determination. PLoS Comput. Biol. 3(1), e13 (2007)

    Google Scholar 

  9. Fisher, J., Piterman, N., Hajnal, A., Henzinger, T.A.: Predictive modeling of signaling crosstalk during C. elegans vulval development. PLoS Comput. Biol. 3(5), e92 (2007)

    Article  Google Scholar 

  10. Fisher, J., Piterman, N., Hubbard, E.J.A., Stern, M.J., Harel, D.: Computational insights into Caenorhabditis elegans vulval development. Proc. Natl. Acad. Sci. 102(6), 1951–1956 (2005)

    Article  Google Scholar 

  11. Harel, D.: Statecharts: A visual formalism for complex systems. Sci. Comput. Program. 8(3), 231–274 (1987)

    Article  MathSciNet  MATH  Google Scholar 

  12. Harel, D., Kugler, H.: The rhapsody semantics of statecharts (or, on the executable core of the UML). In: Ehrig, H., Damm, W., Desel, J., Große-Rhode, M., Reif, W., Schnieder, E., Westkämper, E. (eds.) INT 2004. LNCS, vol. 3147, pp. 325–354. Springer, Heidelberg (2004)

    Google Scholar 

  13. Harel, D., Naamad, A.: The STATEMATE semantics of statecharts. ACM Trans. Softw. Eng. Methodol. 5(4), 293–333 (1996)

    Article  Google Scholar 

  14. Kesten, Y., Pnueli, A.: Verification by augmented finitary abstraction. Inf. Comput. 163(1), 203–243 (2000)

    Article  MathSciNet  MATH  Google Scholar 

  15. Kleene, S.C.: Introduction to Mathematics. North-Holland, Amsterdam (1987)

    Google Scholar 

  16. Lynch, N., Tuttle, M.: An introduction to input/output automata. In: Distributed Systems Engineering (1988)

    Google Scholar 

  17. Mandel, L., Pouzet, M.: ReactiveML: a reactive extension to ML. In: PPDP, pp. 82–93. ACM, New York (2005)

    Google Scholar 

  18. Milner, R.: A Calculus of Communication Systems. LNCS, vol. 92. Springer, Heidelberg (1980)

    Book  MATH  Google Scholar 

  19. Milner, R.: The polyadic pi-calculus (abstract). In: Cleaveland, W.R. (ed.) CONCUR 1992. LNCS, vol. 630. Springer, Heidelberg (1992)

    Google Scholar 

  20. Milner, R., Parrow, J., Walker, D.: A calculus of mobile processes, i & ii. Inf. Comput. 100(1), 1–77 (1992)

    Article  MathSciNet  MATH  Google Scholar 

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

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2011 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Fisher, J., Henzinger, T.A., Nickovic, D., Piterman, N., Singh, A.V., Vardi, M.Y. (2011). Dynamic Reactive Modules. In: Katoen, JP., König, B. (eds) CONCUR 2011 – Concurrency Theory. CONCUR 2011. Lecture Notes in Computer Science, vol 6901. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-23217-6_27

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-23217-6_27

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-23216-9

  • Online ISBN: 978-3-642-23217-6

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics