Posets for Configurations!

Arend Rensink, W.R. Cleaveland (Editor)

    Research output: Contribution to conferencePaperAcademicpeer-review

    13 Downloads (Pure)

    Abstract

    We 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.
    Original languageUndefined
    Pages269-285
    Number of pages17
    Publication statusPublished - 1992
    Event3rd International Conference on Concurrency Theory, CONCUR 1992 - Stony Brook, United States
    Duration: 24 Aug 199227 Aug 1992
    Conference number: 3

    Conference

    Conference3rd International Conference on Concurrency Theory, CONCUR 1992
    Abbreviated titleCONCUR
    CountryUnited States
    CityStony Brook
    Period24/08/9227/08/92

    Keywords

    • IR-66519
    • EWI-7569

    Cite this