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.
Place of Publication | Copenhagen |
---|
Publisher | IT-Universitetet i København |
---|
Edition | TR-2006-84 |
---|
Number of pages | 25 |
---|
ISBN (Electronic) | 87-7949-124-3 |
---|
Publication status | Published - Mar 2006 |
---|
Series | IT University Technical Report Series |
---|
Number | TR-2006-84 |
---|
ISSN | 1600-6100 |
---|