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.
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
6. References
A. Mazurkiewicz: Semantics of concurrent systems: A modular fixed point trace approach. LNCS 188 (1985) 353–375.
A. Mazurkiewicz: Traces, histories, graphs: Instances of a process monoid. LNCS 176 (1984) 115–133.
P. H. Starke: Processes in Petri nets. Elektronische Informations-verarbeitung und Kybernetik 17 (1981) 389–416.
M. Hack: Petri net languages. MIT, Lab. CS. TR 159, 1976.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1985 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Starke, P.H. (1985). Traces and semiwords. In: Skowron, A. (eds) Computation Theory. SCT 1984. Lecture Notes in Computer Science, vol 208. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-16066-3_28
Download citation
DOI: https://doi.org/10.1007/3-540-16066-3_28
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-16066-3
Online ISBN: 978-3-540-39748-9
eBook Packages: Springer Book Archive