Deriving Bisimulation Congruences in the Presence of Negative Application Conditions

Rangel, Guilherme; König, Barbara; Ehrig, Hartmut

doi:10.1007/978-3-540-78499-9_29

Cited by 9 publications

(6 citation statements)

References 15 publications

(42 reference statements)

Supporting

Mentioning

Contrasting

Order By: Relevance

“…In the following we will describe a different proof strategy, based on the borrowed context technique [4,21], which refines a labelled transition system (or even unlabelled reaction rules) in such a way that the resulting bisimilarity is a congruence [14]. Weak bisimilarity as in Def.…”

Section: Proof Strategy 2 51 the Borrowed Context Techniquementioning

confidence: 99%

Showing Full Semantics Preservation in Model Transformation - A Comparison of Techniques

Hülsbusch

König

Rensink

et al. 2010

Lecture Notes in Computer Science

Self Cite

View full text Add to dashboard Cite

Model transformation is a prime technique in modern, model-driven software design. One of the most challenging issues is to show that the semantics of the models is not affected by the transformation. So far, there is hardly any research into this issue, in particular in those cases where the source and target languages are different.In this paper, we are using two different state-of-the-art proof techniques (explicit bisimulation construction versus borrowed contexts) to show bisimilarity preservation of a given model transformation between two simple (self-defined) languages, both of which are equipped with a graph transformation-based operational semantics. The contrast between these proof techniques is interesting because they are based on different model transformation strategies: triple graph grammars versus in situ transformation. We proceed to compare the proofs and discuss scalability to a more realistic setting.Partially supported by DFG project Behaviour-GT.

show abstract

Section: Proof Strategy 2 51 the Borrowed Context Techniquementioning

confidence: 99%

Showing Full Semantics Preservation in Model Transformation - A Comparison of Techniques

Hülsbusch

König

Rensink

et al. 2010

Lecture Notes in Computer Science

Self Cite

View full text Add to dashboard Cite

show abstract

“…By integrating our results with negative application conditions [19] (adapted to the BC framework in [27]) we might provide suitable behavioural theories for larger classes of calculi.…”

Section: Conclusion and Further Workmentioning

confidence: 99%

Saturated LTSs for Adhesive Rewriting Systems

Bonchi

Gadducci

Monreale

et al. 2010

Lecture Notes in Computer Science

View full text Add to dashboard Cite

Abstract. 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.

show abstract

“…In [18] we already studied bisimulation congruences for graph transformation systems with negative application conditions. The present paper generalizes this in several respects: (i) Generalizing negative application conditions we use nested application conditions; (ii) We work in the more general framework of reactive systems instead of graph transformation systems, which are a specific instance; (iii) Instead of fixing a specific way to derive "minimal" context (via IPOs or borrowed context diagrams as in [4,18]) we define the general (and very simple) notion of representative squares, which leads to the same results (at least for saturated equivalences).…”

Section: Introductionmentioning

confidence: 99%

Deriving Bisimulation Congruences for Conditional Reactive Systems

Hülsbusch

König

2012

Foundations of Software Science and Computational Structures

Self Cite

View full text Add to dashboard Cite

Abstract. 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.

show abstract

Deriving Bisimulation Congruences in the Presence of Negative Application Conditions

Cited by 9 publications

References 15 publications

Showing Full Semantics Preservation in Model Transformation - A Comparison of Techniques

Showing Full Semantics Preservation in Model Transformation - A Comparison of Techniques

Saturated LTSs for Adhesive Rewriting Systems

Deriving Bisimulation Congruences for Conditional Reactive Systems

Contact Info

Product

Resources

About