Skip to main content

Distribution of Modal Transition Systems

  • Conference paper
FM 2012: Formal Methods (FM 2012)

Part of the book series: Lecture Notes in Computer Science ((LNPSE,volume 7436))

Included in the following conference series:

Abstract

In order to capture all permissible implementations, partial models of component based systems are given as at the system level. However, iterative refinement by engineers is often more convenient at the component level. In this paper, we address the problem of decomposing partial behaviour models from a single monolithic model to a component-wise model. Specifically, given a Modal Transition System (MTS) M and component interfaces (the set of actions each component can control/monitor), can MTSs M 1, …, M n matching the component interfaces be produced such that independent refinement of each M i will lead to a component Labelled Transition Systems (LTS) I i such that composing the I i s result in a system LTS that is a refinement of M? We show that a sound and complete distribution can be built when the MTS to be distributed is deterministic, transition modalities are consistent and the LTS determined by its possible transitions is distributable.

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. Beneš, N., Křetínský, J., Larsen, K.G., Srba, J.: Checking Thorough Refinement on Modal Transition Systems Is EXPTIME-Complete. In: Leucker, M., Morgan, C. (eds.) ICTAC 2009. LNCS, vol. 5684, pp. 112–126. Springer, Heidelberg (2009)

    Chapter  Google Scholar 

  2. Beneš, N., Ketínský, J., Larsen, K.G., Srba, J.: On determinism in modal transition systems. Theor. Comput. Sci. 410(41), 4026–4043 (2009)

    Article  MATH  Google Scholar 

  3. Castellani, I., Mukund, M., Thiagarajan, P.S.: Synthesizing Distributed Transition Systems from Global Specifications. In: Pandu Rangan, C., Raman, V., Sarukkai, S. (eds.) FST TCS 1999. LNCS, vol. 1738, pp. 219–231. Springer, Heidelberg (1999)

    Chapter  Google Scholar 

  4. D’Ippolito, N., Fishbein, D., Foster, H., Uchitel, S.: MTSA: Eclipse support for modal transition systems construction, analysis and elaboration. In: Eclipse 2007: Proceedings of the 2007 OOPSLA Workshop on Eclipse Technology Exchange, pp. 6–10. ACM (2007)

    Google Scholar 

  5. Fischbein, D., Brunet, G., D’Ippolito, N., Chechik, M., Uchitel, S.: Weak alphabet merging of partial behaviour models. In: TOSEM, pp. 1–49 (2011)

    Google Scholar 

  6. Godefroid, P., Piterman, N.: Ltl generalized model checking revisited. STTT 13(6), 571–584 (2011)

    Article  Google Scholar 

  7. Heljanko, K., Stefanescu, A.: Complexity results for checking distributed implementability. In: Proc. of the Fifth Int. Conf. on Application of Concurrency to System Design, pp. 78–87. IEEE Computer Society Press (2005)

    Google Scholar 

  8. Hopcroft, J.E., Ullman, J.D.: In: Introduction to automata theory, languages, and computation. Addison-Wesley (1979)

    Google Scholar 

  9. Krka, I., Brun, Y., Edwards, G., Medvidovic, N.: Synthesizing partial component-level behavior models from system specifications. In: ESEC/FSE 2009, pp. 305–314. ACM (2009)

    Google Scholar 

  10. Larsen, K.G., Thomsen, B.: A modal process logic. In: LICS 1988, pp. 203–210. IEEE Computer Society (1988)

    Google Scholar 

  11. Milner, R.: Communication and Concurrency. Prentice-Hall, New York (1989)

    MATH  Google Scholar 

  12. Magee, J., Kramer, J.: Concurrency - State Models and Java Programs. John Wiley (1999)

    Google Scholar 

  13. Morin, R.: Decompositions of Asynchronous Systems. In: Sangiorgi, D., de Simone, R. (eds.) CONCUR 1998. LNCS, vol. 1466, pp. 549–564. Springer, Heidelberg (1998)

    Chapter  Google Scholar 

  14. Quinton, S., Graf, S.: Contract-based verification of hierarchical systems of components. In: SEFM 2008, pp. 377–381 (2008)

    Google Scholar 

  15. Stefanescu, A.: Automatic Synthesis of Distributed Systems. PhD thesis (2006)

    Google Scholar 

  16. Stoll, M.: MoTraS: A Tool for Modal Transition Systems. Master’s thesis, Technische Universitat Munchen, Fakultat fur Informatik (August 2005)

    Google Scholar 

  17. Sibay, G., Uchitel, S., Braberman, V.: Existential live sequence charts revisited. In: ICSE 2008, pp. 41–50 (2008)

    Google Scholar 

  18. Uchitel, S., Kramer, J., Magee, J.: Incremental elaboration of scenario-based specifications and behaviour models using implied scenarios. ACM TOSEM 13(1) (2004)

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2012 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Sibay, G.E., Uchitel, S., Braberman, V., Kramer, J. (2012). Distribution of Modal Transition Systems. In: Giannakopoulou, D., Méry, D. (eds) FM 2012: Formal Methods. FM 2012. Lecture Notes in Computer Science, vol 7436. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-32759-9_33

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-32759-9_33

  • Publisher Name: Springer, Berlin, Heidelberg

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

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

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics