Advertisement

Traces and semiwords

  • Peter H. Starke
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 208)

Abstract

The paper is aimed at a comparision of the MAZURKIEWICZ-calculus of traces and trace languages with the calculus of semiwords and semilanguages. The method to do this is to translate the notions from these languages into the language of irreflexive partial orderings to detect parallelities and differences.

Keywords

Dependence Graph Sequential Product Parallel Product Partial Word Synchronization Operation 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

6. References

  1. (1).
    A. Mazurkiewicz: Semantics of concurrent systems: A modular fixed point trace approach. LNCS 188 (1985) 353–375.Google Scholar
  2. (2).
    A. Mazurkiewicz: Traces, histories, graphs: Instances of a process monoid. LNCS 176 (1984) 115–133.Google Scholar
  3. (3).
    P. H. Starke: Processes in Petri nets. Elektronische Informations-verarbeitung und Kybernetik 17 (1981) 389–416.Google Scholar
  4. (4).
    M. Hack: Petri net languages. MIT, Lab. CS. TR 159, 1976.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1985

Authors and Affiliations

  • Peter H. Starke
    • 1
  1. 1.Sektion Mathematik der Humboldt-Universitaet zu BerlinBerlin

Personalised recommendations