Skip to main content

Generating an algorithm for executing graphical models

  • Chapter
  • First Online:
Functional Programming, Concurrency, Simulation and Automated Reasoning

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 693))

  • 133 Accesses

Abstract

Executable graphical models based on an underlying mathematical framework are very useful in the specification and design of complex systems. The major contribution of this paper is to show how such a general graphical modeling language can be “compiled” and executed. The paper takes a pragmatic approach by presenting, in reasonable detail, how such a model can be translated into a series of functions and then describes the execution as a sequence of function applications. The ideas are then extented to work for hierarchical graphical models.

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

Access this chapter

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. K. Jensen. Coloured Petri Nets. In Petri Nets: Central Models and Their Properties, Advances in Petri Nets 1986-Part I, W. Brauer, W. Reisig and G. Rozenberg (eds.), Lecture Notes in Computer Science, vol. 254, 248–299, Springer Verlag, 1987.

    Google Scholar 

  2. F. Commoner, A. W. Holt, S. Even, and A. Pnueli. Marked Directed Graphs. Computer and System Sc. 5, 511–523, 1971.

    Google Scholar 

  3. D. A. Marca and C. L. McGowan. SADT. McGraw-Hill, New York, 1988.

    Google Scholar 

  4. Design/IDEF User's Manual, Version 1.5. Meta Software Corporation, Cambridge, Massachusetts, USA, 1989.

    Google Scholar 

  5. P. Huber, K. Jensen, and R. Shapiro. Hierarchies in Coloured Petri Nets. Meta Software Corporation, Cambridge Massachusetts, USA, 1989. Presented at the 10th International Conference on Application and Theory of Petri Nets, Bonn, June 1989.

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Peter E. Lauer

Rights and permissions

Reprints and permissions

Copyright information

© 1993 Springer-Verlag Berlin Heidelberg

About this chapter

Cite this chapter

Malhotra, J., Shapiro, R.M. (1993). Generating an algorithm for executing graphical models. In: Lauer, P.E. (eds) Functional Programming, Concurrency, Simulation and Automated Reasoning. Lecture Notes in Computer Science, vol 693. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-56883-2_4

Download citation

  • DOI: https://doi.org/10.1007/3-540-56883-2_4

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-56883-4

  • Online ISBN: 978-3-540-47776-1

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics