Extended connectors: Structuring glue operators in BIP

Eduard Baranov; Simon Bliudze

doi:10.4204/EPTCS.131.3

Extended connectors: Structuring glue operators in BIP

Eduard Baranov, Simon Bliudze

ENAC-IIC-GEL

Research output: Contribution to journal › Conference article › peer-review

Abstract

Based on a variation of the BIP operational semantics using the offer predicate introduced in our previous work, we extend the algebras used to model glue operators in BIP to encompass priorities. This extension uses the Algebra of Causal Interaction Trees, T(P), as a pivot: existing transformations automatically provide the extensions for the Algebra of Connectors. We then extend the axiomatisation of T(P), since the equivalence induced by the new operational semantics is weaker than that induced by the interaction semantics. This extension leads to canonical normal forms for all structures and to a simplification of the algorithm for the synthesis of connectors from Boolean coordination constraints.

Original language	English
Pages (from-to)	20-35
Number of pages	16
Journal	Electronic Proceedings in Theoretical Computer Science, EPTCS
Volume	131
DOIs	https://doi.org/10.4204/EPTCS.131.3
Publication status	Published - 15 Oct 2013
Externally published	Yes
Event	6th Interaction and Concurrency Experience, ICE 2013 - Florence, Italy Duration: 6 Jun 2013 → …

Access to Document

10.4204/EPTCS.131.3

Cite this

@article{a2e37d9b1b394d34928db72597d5d401,

title = "Extended connectors: Structuring glue operators in BIP",

abstract = "Based on a variation of the BIP operational semantics using the offer predicate introduced in our previous work, we extend the algebras used to model glue operators in BIP to encompass priorities. This extension uses the Algebra of Causal Interaction Trees, T(P), as a pivot: existing transformations automatically provide the extensions for the Algebra of Connectors. We then extend the axiomatisation of T(P), since the equivalence induced by the new operational semantics is weaker than that induced by the interaction semantics. This extension leads to canonical normal forms for all structures and to a simplification of the algorithm for the synthesis of connectors from Boolean coordination constraints.",

author = "Eduard Baranov and Simon Bliudze",

note = "Publisher Copyright: {\textcopyright} 2007 International Society for Photogrammetry and Remote Sensing. All rights reserved.; 6th Interaction and Concurrency Experience, ICE 2013 ; Conference date: 06-06-2013",

year = "2013",

month = oct,

day = "15",

doi = "10.4204/EPTCS.131.3",

language = "English",

volume = "131",

pages = "20--35",

journal = "Electronic Proceedings in Theoretical Computer Science, EPTCS",

issn = "2075-2180",

}

TY - JOUR

T1 - Extended connectors

T2 - 6th Interaction and Concurrency Experience, ICE 2013

AU - Baranov, Eduard

AU - Bliudze, Simon

PY - 2013/10/15

Y1 - 2013/10/15

N2 - Based on a variation of the BIP operational semantics using the offer predicate introduced in our previous work, we extend the algebras used to model glue operators in BIP to encompass priorities. This extension uses the Algebra of Causal Interaction Trees, T(P), as a pivot: existing transformations automatically provide the extensions for the Algebra of Connectors. We then extend the axiomatisation of T(P), since the equivalence induced by the new operational semantics is weaker than that induced by the interaction semantics. This extension leads to canonical normal forms for all structures and to a simplification of the algorithm for the synthesis of connectors from Boolean coordination constraints.

AB - Based on a variation of the BIP operational semantics using the offer predicate introduced in our previous work, we extend the algebras used to model glue operators in BIP to encompass priorities. This extension uses the Algebra of Causal Interaction Trees, T(P), as a pivot: existing transformations automatically provide the extensions for the Algebra of Connectors. We then extend the axiomatisation of T(P), since the equivalence induced by the new operational semantics is weaker than that induced by the interaction semantics. This extension leads to canonical normal forms for all structures and to a simplification of the algorithm for the synthesis of connectors from Boolean coordination constraints.

U2 - 10.4204/EPTCS.131.3

DO - 10.4204/EPTCS.131.3

M3 - Conference article

AN - SCOPUS:84932170241

SN - 2075-2180

VL - 131

SP - 20

EP - 35

JO - Electronic Proceedings in Theoretical Computer Science, EPTCS

JF - Electronic Proceedings in Theoretical Computer Science, EPTCS

Y2 - 6 June 2013

ER -

Extended connectors: Structuring glue operators in BIP

Abstract

Access to Document

Fingerprint

Cite this