Distributing finite transition systems extended abstract | SpringerLink
Skip to main content

Distributing finite transition systems extended abstract

  • Posters
  • Conference paper
  • First Online:
PARLE '92 Parallel Architectures and Languages Europe (PARLE 1992)

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

  • 130 Accesses

Abstract

A program called Oc2rep has been written for the distributed memory case. It was tested on several Lustre and Esterel programs implemented on a Unix based LAN, and appeared to work satisfactorily, in the sense that the problem of distributed debugging was avoided. Yet some important studies are still to be undertaken: performance and optimization, bounding of the reaction time and finally fault tolerance.

reference: P. Caspi and A. Girault. An algorithm for distributing a finite transition system on a shared/distributed memory system. Technical Report, LGI/IMAG, 1992

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

Access this chapter

Institutional subscriptions

Similar content being viewed by others

Author information

Authors and Affiliations

Authors

Editor information

Daniel Etiemble Jean-Claude Syre

Rights and permissions

Reprints and permissions

Copyright information

© 1992 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Caspi, P., Girault, A. (1992). Distributing finite transition systems extended abstract. In: Etiemble, D., Syre, JC. (eds) PARLE '92 Parallel Architectures and Languages Europe. PARLE 1992. Lecture Notes in Computer Science, vol 605. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-55599-4_137

Download citation

  • DOI: https://doi.org/10.1007/3-540-55599-4_137

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-55599-5

  • Online ISBN: 978-3-540-47250-6

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics