On reduction-based process semantics
Selected papers of the thirteenth conference on Foundations of software technology and theoretical computer science
Graph grammars with negative application conditions
Fundamenta Informaticae - Special issue on graph transformations
On bisimulations of the asynchronous &pgr;-calculus
Theoretical Computer Science
Theoretical Computer Science
An inductive view of graph transformation
WADT '97 Selected papers from the 12th International Workshop on Recent Trends in Algebraic Development Techniques
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
CONCUR '01 Proceedings of the 12th International Conference on Concurrency Theory
Deriving bisimulation congruences using 2-categories
Nordic Journal of Computing
LICS '05 Proceedings of the 20th Annual IEEE Symposium on Logic in Computer Science
Behavioral theory for mobile ambients
Journal of the ACM (JACM)
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
Graph rewriting for the π-calculus
Mathematical Structures in Computer Science
On the Construction of Sorted Reactive Systems
CONCUR '08 Proceedings of the 19th international conference on Concurrency Theory
Deriving Structural Labelled Transitions for Mobile Ambients
CONCUR '08 Proceedings of the 19th international conference on Concurrency Theory
Behavior Preservation in Model Refactoring Using DPO Transformations with Borrowed Contexts
ICGT '08 Proceedings of the 4th international conference on Graph Transformations
Synthesising CCS bisimulation using graph rewriting
Information and Computation
On the Use of Behavioural Equivalences for Web Services' Development
Fundamenta Informaticae - Fundamentals of Software Engineering 2007: Selected Contributions
Reactive Systems, Barbed Semantics, and the Mobile Ambients
FOSSACS '09 Proceedings of the 12th International Conference on Foundations of Software Science and Computational Structures: Held as Part of the Joint European Conferences on Theory and Practice of Software, ETAPS 2009
Labelled Transitions for Mobile Ambients (As Synthesized via a Graphical Encoding)
Electronic Notes in Theoretical Computer Science (ENTCS)
Semantic barbs and biorthogonality
FOSSACS'07 Proceedings of the 10th international conference on Foundations of software science and computational structures
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
CMSB'04 Proceedings of the 20 international conference on Computational Methods in Systems Biology
Reactive systems over directed bigraphs
CONCUR'07 Proceedings of the 18th international conference on Concurrency Theory
LTS semantics for process calculi from their graphical encodings
ICGT'10 Proceedings of the 5th international conference on Graph transformations
Borrowed contexts for attributed graphs
ICGT'12 Proceedings of the 6th international conference on Graph Transformations
| Hi-index | 0.00 |
G-Reactive Systems (GRSs) are a framework for the derivation of labelled transition systems (LTSs) from a set of unlabelled rules. A label for a transition from A to B is a context C[-] such that C[A] may perform a reaction and reach B. If either all contexts, or just the "minimal" ones, are considered, the resulting LTS is called saturated (GIPO, respectively). The borrowed contexts (BCs) technique addresses the issue in the setting of the DPO approach. Indeed, from an adhesive rewriting system (ARS) a GRS can be defined such that DPO derivations correspond to reactions, and BC derivations to transitions of the GIPO LTS. This paper extends the BCs technique in order to derive saturated LTSs for ARSs, applying it to capture bisimilarity for asynchronous calculi.