Multitraces, hypertraces and partial order semantics
- 1 November 1992
- journal article
- Published by Association for Computing Machinery (ACM) in Formal Aspects of Computing
- Vol. 4 (Suppl 1) , 649-672
- https://doi.org/10.1007/bf03180567
Abstract
In this paper, we consider a generalisation of a result due to the author which describes the way in which Mazurkiewicz trace languages serve to represent systems of labelled partial orders, as used in non-interleaving semantics of parallelism. The generalisation extends the class of partial order systems to exclude only a form of non-determinism. Their representation is in terms ofa generalisation of traces, also due to Mazurkiewicz, called multi traces.Keywords
This publication has 6 references indexed in Scilit:
- Petri nets, event structures and domainsPublished by Springer Nature ,2005
- Event fairness and non-interleaving concurrencyFormal Aspects of Computing, 1989
- Behavioural presentationsPublished by Springer Nature ,1989
- Concurrent MachinesThe Computer Journal, 1985
- Event structure semantics for CCS and related languagesPublished by Springer Nature ,1982
- Concurrent Program Schemes and their InterpretationsDAIMI Report Series, 1977