Sortings for Reactive Systems

Lars Birkedal, Søren Debois, Thomas Hildebrandt

    Research output: Book / Anthology / Report / Ph.D. thesisReportResearch

    Abstract

    We investigate sorting or typing for Leifer and Milner's reactive systems. We focus on transferring congruence properties for bisimulations from unsorted tosorted systems. Technically, we give a general definition of sorting; we adapt Jensen's work on the transfer of congruence properties to this general definition; we construct a predicate sorting, which, for any decomposible predicate P filters out agents not satisfying P; we prove that the predicatesorting preserves congruence properties and that it suitably retains dynamics; and finally, we show how the predicate sortings can be used to achieve context-aware reaction.
    Original languageEnglish
    Place of PublicationCopenhagen
    PublisherIT-Universitetet i København
    EditionTR-2006-84
    Number of pages25
    ISBN (Electronic)87-7949-124-3
    Publication statusPublished - Mar 2006
    SeriesIT University Technical Report Series
    NumberTR-2006-84
    ISSN1600-6100

    Fingerprint

    Dive into the research topics of 'Sortings for Reactive Systems'. Together they form a unique fingerprint.

    Cite this