 |
 |
Rensink, A.
(1992)
Posets for Configurations!
In: Third International Conference on Concurrency Theory (CONCUR), Stony Brook, U.S.A..
.
Lecture Notes in Computer Science 630.
Springer Verlag.
ISSN 0302-9743
ISBN 3-540-55822-5
Full text available as: AbstractWe define families of posets, ordered by prefixes, as the counterpart of the usual families of configurations ordered by subsets. On these objects we define two types of morphism, event and order morphisms, resulting in categories FPos and FPosv. We then show the following:
- Families of posets, in contrast to families of configurations, are always prime algebraic; in fact the category FPosv is equivalent to the category of prime algebraic domains.
- On the level of events, FPos is equivalent to the category of prime algebraic domains with an additional relation encoding event identity.
- The (abstract) event identity relation can be used to characterize concrete relations between events such as binary conflict and causal flow.
- One can characterize a wide range of event-based models existing in the literature as families of posets satisfying certain specific structural conditions formulated in terms of event identity.
| Item Type: | Conference or Workshop Paper (Full Paper, Talk) |
|---|
| Research Group: | EWI-FMT: Formal Methods and Tools |
|---|
| ID Code: | 7569 |
|---|
| Status: | Published |
|---|
| Deposited On: | 21 November 2006 |
|---|
| Refereed: | Yes |
|---|
| International: | Yes |
|---|
| More Information: | statistics |
|---|
Export this item as: To correct this item please ask your editor Repository Staff Only: edit this item
|
 |
 |