Advertisement

Cycles of partial orders

  • Előd Knuth
Communications
Part of the Lecture Notes in Computer Science book series (LNCS, volume 64)

Abstract

The approach of characterising certain properties of concurrent structures by traces, i.e. partial orders of event occurrences has already been used by several authors in particular by S. Patil, A.W. Holt, P.E. Lauer. The approach also has a close connection to causal-nets introduced by C.A. Petri.

As to the formal linguistic approaches to Petri nets, the aspects of (string-) languages and commutative grammars have already been carefully investigated, e.g. by M. Hack and S. Crespi Reghizzi respectively. The interconnections between Petri nets and traces have been studied by F. Furtek, and later in particular by A. Mazurkiewicz who proved that the behaviour of 1-safe nets can always be characterised by regular languages of traces.

This paper is inspired by an interest in whether the converse statement is true, that is, whether regular trace languages can always be represented by 1-safe nets. An affirmative answere is given for a simple special class which, however, has a number of practical applications.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    Mazurkiewicz, A.: Concurrent program schemes and their interpretations, Aarhus Workshop on Verification of Parallel Processes, June 1977.Google Scholar
  2. 2.
    Lauer, P.E., Best, E. and Shields, M.W.: On the problem of achieving adequacy of concurrent programs, Proc. of the IFIP Work. Conf. on Formal Desc. of Prog. Concepts, North Holland, August 1977.Google Scholar
  3. 3.
    Lauer, P.E. and Campbell, R.H.: Formal semantics of a class of highlevel primitives for co-ordinating concurrent processes, Acta Informatica, 5, pp. 297–332 /1975/.CrossRefGoogle Scholar
  4. 4.
    Petri, C.A.: Nichtsequentielle Processe, GMD-ISF, Internal Report 76-6, Bonn 1976.Google Scholar
  5. 5.
    Hack, M.: Petri net languages, MIT Memo 124, June 1975.Google Scholar
  6. 6.
    Crespi Reghizzi, S. and Mandrioli, D.: Petri nets and commutative grammars. Inst. di Elettrotecnica ed Elettronica del Politechnico di Milano, Internal Report 74-5, March 1974.Google Scholar
  7. 7.
    Patil, S.S.: Co-ordination of asynchronous events, MIT MAC TR-72, 1970.Google Scholar
  8. 8.
    Holt, A.W.: Information system theory project, Final Report, TR-68-305, New York, 1968.Google Scholar
  9. 9.
    Furtek, F.: A new approach to Petri Nets, MIT Computation Structures group Memo 123, 1975.Google Scholar
  10. 10.
    Shields, M.W. and Lauer, P.E.: On the abstract specification and formal analysis of synchronisation properties of concurrent systems, to appear in the Proc. of the Int. Conf. on Mathematical Studies of Information Processing. RIMS Kyoto, Japan, 1978.Google Scholar
  11. 11.
    Knuth, E.: Petri nets and regular trace languages. University of Newcastle upon Tyne Computing Laboratory ASM/47, April, 1978.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1978

Authors and Affiliations

  • Előd Knuth
    • 1
  1. 1.Computer and Automation InstituteHungarian Academy of SciencesBudapestHungary

Personalised recommendations