POPL '96 Proceedings of the 23rd ACM SIGPLAN-SIGACT symposium on Principles of programming languages
From rewrite rules to bisimulation congruences
Theoretical Computer Science
POPL '03 Proceedings of the 30th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Deriving Bisimulation Congruences for Reactive Systems
CONCUR '00 Proceedings of the 11th International Conference on Concurrency Theory
A General Framework for Types in Graph Rewriting
FST TCS 2000 Proceedings of the 20th Conference on Foundations of Software Technology and Theoretical Computer Science
LICS '05 Proceedings of the 20th Annual IEEE Symposium on Logic in Computer Science
Deriving weak bisimulation congruences from reduction systems
CONCUR 2005 - Concurrency Theory
Bigraphical Semantics of Higher-Order Mobile Embedded Resources with Local Names
Electronic Notes in Theoretical Computer Science (ENTCS)
Pure bigraphs: Structure and dynamics
Information and Computation
Deriving bisimulation congruences: 2-categories vs precategories
FOSSACS'03/ETAPS'03 Proceedings of the 6th International conference on Foundations of Software Science and Computation Structures and joint European conference on Theory and practice of software
Bigraphical models of context-aware systems
FOSSACS'06 Proceedings of the 9th European joint conference on Foundations of Software Science and Computation Structures
ICALP'05 Proceedings of the 32nd international conference on Automata, Languages and Programming
Static BiLog: a Unifying Language for Spatial Structures
Fundamenta Informaticae - Half a Century of Inspirational Research: Honoring the Scientific Influence of Antoni Mazurkiewicz
On the Construction of Sorted Reactive Systems
CONCUR '08 Proceedings of the 19th international conference on Concurrency Theory
CONCUR 2009 Proceedings of the 20th International Conference on Concurrency Theory
An algebraic approach to image schemas for geographic space
COSIT'09 Proceedings of the 9th international conference on Spatial information theory
Static BiLog: a Unifying Language for Spatial Structures
Fundamenta Informaticae - Half a Century of Inspirational Research: Honoring the Scientific Influence of Antoni Mazurkiewicz
| Hi-index | 0.00 |
We investigate sorting or typing for Leifer and Milner's reactive systems. We focus on transferring congruence properties for bisimulations from unsorted to sorted 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 predicate sorting 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.