The search and advanced search might return partial results due to server maintanance
Rensink, Arend (1994) Deterministic Pomsets. [Report]
|Abstract:||This paper is about partially ordered multisets (pomsets for short). We investigate a particular class of pomsets that we call deterministic, properly including all partially ordered sets, which satisfies a number of interesting properties: among other things, it forms a distributive lattice under pomset prefix (hence prefix closed sets of deterministic pomsets are prime algebraic), and it constitutes a reflective subcategory of the category of all pomsets. For the deterministic pomsets we develop an algebra with a sound and (ω-)complete equational theory. The operators in the algebra are concatenation and join, the latter being a variation on the more usual disjoint union of pomsets with the special property that it yields the least upper bound with respect to pomset prefix.
This theory is then extended in several ways. We capture refinement of pomsets by incorporating homomorphisms between models as objects in the algebra and homomorphism application as a new operator. This in turn allows to formulate distributed termination and sequential composition of pomsets, where the latter is different from concatenation in that it is right-distributive over union. To contrast this we also formulate a notion of global termination. Each variation is captured equationally by a sound and ω-complete theory.
Electrical Engineering, Mathematics and Computer Science (EEMCS)
|Link to this item:||http://purl.utwente.nl/publications/66642|
|Export this item as:||BibTeX|
Show download statistics for this publication
Daily downloads in the past month
Monthly downloads in the past 12 months
Repository Staff Only: item control page