Skip to main content
SpringerLink
Log in

Partitioning of perfect synchroneous reactive specifications to distributed processors using μ-charts

  • Regular Paper
  • Published:
Software & Systems Modeling Aims and scope Submit manuscript

Abstract

In this contribution, it is shown that perfect synchroneous specifications can be partitioned to and implemented on a distributed processor network. To this end, we introduce a lean visual formalism, called μ-charts, that is similar to the specification language Statecharts. This formalism consists of fewer syntactic constructs than Statecharts. Further syntax like hierarchical decomposition can be derived by means of syntactic abbreviation. μ-charts' semantics is based on the assumption of perfect synchrony.

This paper is one of several contributions in this context; it gives a formal background and concentrates on the question how to use perfect synchroneous, state-based description techniques as a basis for distributed implementations. The main contribution presented in this article is that the (formal and compositional) semantics of a perfect synchroneous specification is preserved when it is partitioned and implemented on distributed processors. We prove a theorem which guarantees that the communication flow between distributed parts of a perfect synchroneous specification stabilizes in a fixed point, i.e.$ terminates, independently of the processor speeds.

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

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  1. Berry, G.: The Foundations of Esterel. In: Plotkin, G., Stirling, C., Tofte, M. (eds.), Proof, Language and Interaction: Essays in Honour of Robin Milner. MIT Press (1998)

  2. Broy, M., Stølen, K.: Specification and development of interactive systems. Focus on Streams, Interfaces and Refinement. Monographs in Computer Science. Springer (2001)

  3. David, A., Möller, M.O., Yi. W.: Formal verifcation of uml statecharts with real-time extensions. In: Kutsche, R.-D., Weber, H.: (eds.) Proceedings of FASE, vol. LNCS 2306, pp. 218–232. Springer (2002)

  4. Edwards, S.A.: The Specification and Execution of Heterogeneous Synchronous Reactive Systems. PhD thesis, University of California at Berkeley (1997)

  5. Etschberger, K.: CAN Controller-Area-Network: Grundlagen, Protokolle, Bausteine, Anwendungen (in German). Carl Hanser Verlag, München (1994)

    Google Scholar 

  6. Harel, D., Statecharts: A visual formalism for complex systems. Science of Computer Programming, 8:231–274 (1987)

    Article  MATH  MathSciNet  Google Scholar 

  7. Huizing, C., de Roever, W.-P.: Introduction to design choices in the semantics of statecharts. Information Processing Letters, 37: (1991)

  8. Huizing, C., Gerth, R.: Semantics of Reactive Systems in Abstract Time. In de Bakker, J.W., Huizing, C., de Roever, W.P., Rozenberg, G. (eds.), Real-Time: Theory in Practice, volume 600 of Lecture Notes in Computer Science, 291–314, Mook—The Netherlands, June (1991)

  9. Klein, C.: Anforderungsspezifikation durch Transitionssysteme und Szenarien (in German). PhD thesis, Institut für Informatik, Technische Universität München (1997)

  10. Maraninchi, F., Halbwachs, N.: Compositional Semantics of Non-deterministic Synchronous Languages. In Riis, N. (eds.), Programming languanges and systems—ESOP'96, 6th European Symposium on programming, volume 1058 of Lecture Notes in Computer Science. Springer-Verlag (1996)

  11. Philipps, J., Scholz, P.: Formal Verification of Statecharts with Instantaneous Chain Reactions. In: TACAS'97: Tools and Algorithms for the Construction and Analysis of Systems, vol. 1217 of Lecture Notes in Computer Science. Springer-Verlag (1997)

  12. Pnueli, A., Shalev. M.: What is in a Step: On the Semantics of Statecharts. In Ito T., Meyer, A.R. (eds.), Proccedings of the “Theoretical Aspects in Computer Software 91”, vol. 526 of Lecture Notes in Computer Science, 244–264. Springer-Verlag (1991)

  13. Robert, F., Discrete Iterations A.: Metric Study, vol. 6 of Springer Series in Computational Mathematics. Springer, Stuttgart (1986)

    Google Scholar 

  14. Scholz, P.: A Refinement Calculus for Statecharts. In Proccedings of the “ETAPS/FASE'98, Lisbon (Portugal), March 30 - April 03, 1998”, vol. 1382 of Lecture Notes in Computer Science. Springer (1998)

  15. Scholz, P.: Design of Reactive Systems and their Distributed Implementation with Statecharts. PhD thesis, Institut für Informatik, Technische Universität München (1998)

  16. Scholz, P.: Incremental design of statechart specifications. In Science of Computer Programming, number 40, pp. 119–145. Elsevier Science Publisher (2001)

  17. Scholz, P., Nazareth, D., Regensburger, F.: Mini-Statecharts: A Compositional Way to Model Parallel Systems. (1996.) 9th International Conference on Parallel and Distributed Computing Systems (PDCS'96), Dijon, France.

  18. von der Beeck, M.: A Comparison of Statecharts Variants. In: Langmaack, H., de Roever, W.-P., Vytopil, J. (eds.), Proc. Formal Techniques in Real–Time and Fault–Tolerant Systems (FTRTFT'94), vol 863 of Lecture Notes in Computer Science, pp. 128–148. Springer (1994)

  19. Andrzej, W.: Flattening statecharts without explosions. In Language, Compiler, and Tool Support for Embedded Systems Proceedings of the 2004 ACM SIGPLAN/SIGBED conference on Languages, compilers, and tools, pp. 257–266. ACM Press (2004)

Download references

Author information

Authors and Affiliations

  1. Landshut University of Applied Sciences, Am Lurzenhof 1, 84036, Landshut, Germany

    Peter Scholz

Authors
  1. Peter Scholz
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Peter Scholz.

Additional information

Communicated by Jonathan Whittle

Rights and permissions

Reprints and permissions

About this article

Cite this article

Scholz, P. Partitioning of perfect synchroneous reactive specifications to distributed processors using μ-charts. Softw Syst Model 5, 13–25 (2006). https://doi.org/10.1007/s10270-005-0094-1

Download citation

  • Received:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s10270-005-0094-1

Keywords

Search

Navigation