MFPS '92 Selected papers of the meeting on Mathematical foundations of programming semantics
ICALP '92 Proceedings of the 19th International Colloquium on Automata, Languages and Programming
Deriving Bisimulation Congruences for Reactive Systems
CONCUR '00 Proceedings of the 11th International Conference on Concurrency Theory
LICS '05 Proceedings of the 20th Annual IEEE Symposium on Logic in Computer Science
Saturated Semantics for Reactive Systems
LICS '06 Proceedings of the 21st Annual IEEE Symposium on Logic in Computer Science
Deriving bisimulation congruences in the DPO approach to graph rewriting with borrowed contexts
Mathematical Structures in Computer Science
From UML Activities to TAAL - Towards Behaviour-Preserving Model Transformations
ECMDA-FA '08 Proceedings of the 4th European conference on Model Driven Architecture: Foundations and Applications
Correctness of high-level transformation systems relative to nested conditions†
Mathematical Structures in Computer Science
Deriving bisimulation congruences in the presence of negative application conditions
FOSSACS'08/ETAPS'08 Proceedings of the Theory and practice of software, 11th international conference on Foundations of software science and computational structures
Showing full semantics preservation in model transformation: a comparison of techniques
IFM'10 Proceedings of the 8th international conference on Integrated formal methods
Reactive systems over directed bigraphs
CONCUR'07 Proceedings of the 18th international conference on Concurrency Theory
Borrowed contexts for attributed graphs
ICGT'12 Proceedings of the 6th international conference on Graph Transformations
Checking bisimilarity for attributed graph transformation
FOSSACS'13 Proceedings of the 16th international conference on Foundations of Software Science and Computation Structures
| Hi-index | 0.00 |
We consider conditional reactive systems, a general abstract framework for rewriting, in which reactive systems à la Leifer and Milner are enriched with (nested) application conditions. We study the problem of deriving labelled transitions and bisimulation congruences from a reduction semantics. That is, we synthesize interactions with the environment in order to obtain a compositional semantics. Compared to earlier work we not only address the problem of deriving information about the (minimal) context needed to obtain a full left-hand side and thus be able to perform a reduction, but also generate conditions on the remaining context.