The equational theory of pomsets (Q1119012)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: The equational theory of pomsets |
scientific article; zbMATH DE number 4096763
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | The equational theory of pomsets |
scientific article; zbMATH DE number 4096763 |
Statements
The equational theory of pomsets (English)
0 references
1988
0 references
A labeled partial order is a partially ordered set together with a labeling of each element (by a symbol from some alphabet). A partially- ordered multiset, or pomset, is an isomorphism class of some labeled partial order. Pomsets have been used as a model of concurrency and as an aid in understanding the semantics of parallel programs The author investigates the axiomatic properties of pomsets, sets of pomsets and ideals of pomsets. He shows, for example, that the equational theory of pomsets under the operations of concatenation, parallel composition and union is finitely axiomatizable. Similar results are obtained for ideals of pomsets.
0 references
partial order equational theory
0 references
pomset
0 references
semantics of parallel programs
0 references
