On the expressiveness of timed coordination models

Linden, Isabelle; Jacquet, Jean-Marie; Bosschere, Koen De; Brogi, Antonio

doi:10.1016/j.scico.2005.10.011

Cited by 13 publications

(10 citation statements)

References 55 publications

Supporting

Mentioning

Contrasting

Unclassified

Order By: Relevance

“…[17]) and Linden et al (e.g. [18]), to express temporary objects insertion and to define a deadline for look before termination with no effect. Interaction over multiple hosts is very challenging, yet with simple spaces, and with contextual interaction and the security mechanism, this becomes even more difficult to fulfill.…”

Section: Discussionmentioning

confidence: 99%

Data Driven Language for Agents Secure Interaction

Zargayouna¹,

Balbo

Haddad

2010

Languages, Methodologies, and Development Tools for Multi-Agent Systems

View full text Add to dashboard Cite

This paper discusses the security issues in data driven coordination languages. These languages rely on a data space shared by the agents and used to coordinate their activities. We extend these languages with a main distinguishing feature, which is the possibility to define fine-grained security conditions, associated with every datum in the shared space. Two main ideas makes it possible: the consideration of an abstraction of agents' states in the form of data at language level and the introduction of a richer interaction mechanism than state-of-the-art templates. This novel security mechanism allows both agents and system designers to prohibit undesirable interactions.

show abstract

Section: Discussionmentioning

confidence: 99%

Data Driven Language for Agents Secure Interaction

Zargayouna¹,

Balbo

Haddad

2010

Languages, Methodologies, and Development Tools for Multi-Agent Systems

View full text Add to dashboard Cite

show abstract

“…The enactment function returns the parallel composition of processes, each corresponding to the untimed aspect of a state of the local diagram; this is essentially our process semantics of local diagrams defined in the previous section. The coordination function returns a single process for coordinating that diagram's timed behaviour; it essentially implements a variant of the two-phase functioning approach adopted by real-time systems and timed coordination languages [12]. Our timed model permits automatic translation, requiring no user interaction.…”

Section: Semantic Functionmentioning

confidence: 99%

Formalisations and applications of BPMN

Wong

Gibbons

2011

Science of Computer Programming

View full text Add to dashboard Cite

We present two formalisations of the Business Process Modelling Notation (BPMN). In particular, we introduce a semantic model for BPMN in the process algebra CSP; we then study an augmentation of this model in which we introduce relative timing information, allowing one to specify timing constraints on concurrent activities. By exploiting CSP refinement, we are able to show some relationships between the timed and the untimed models. We then describe a novel empirical studies model, and the transformation to BPMN, allowing one to apply our formal semantics for analysing different kind of workflows. To provide a better facility for describing behaviour specification about a BPMN diagram, we also present a pattern-based approach using which a workflow designer could specify properties which could otherwise be difficult to express. Our approach is specifically designed to allow behavioural properties of BPMN diagrams to be mechanically verified via automatic model-checking as provided by the FDR tool. We use two examples to illustrate our approach.

show abstract

“…The expressiveness of these families has been studied in [16,[20][21][22]. Two interesting conclusions may be extracted from these papers.…”

Section: Timed Coordination Languagesmentioning

confidence: 99%

“…In our recent work [16,[20][21][22], we have proposed different ways of introducing time in coordination languages. For that purpose, we have used the classical two-phase functioning approach to real-time systems and have proved that this approach was effective for modeling coordination in reactive systems.…”

Section: Introductionmentioning

confidence: 99%

Fully abstract models and refinements as tools to compare agents in timed coordination languages

Jacquet¹,

Linden²

2009

Theoretical Computer Science

View full text Add to dashboard Cite

a b s t r a c tCoordination languages and models promote the idea of separating computation and interaction aspects. As for traditional concurrency models, the question of safely replacing an agent by another one in any interacting context naturally appears. This paper proposes two tools to answer that question. On the one hand, a fully abstract semantics allows us to identify two processes which behave similarly in any context. On the other hand, a refinement theory allows us to compare processes that appear to be different in view of the fully abstract semantics but which satisfy the substitutability property: if the implementation I refines the specification S and if C [S] is deadlock free, for some context C , then C [I] is also deadlock free. Both theories are novel, are exposed in the context of our timed coordination languages but may actually be transposed in the context of almost any data-driven coordination language.

show abstract

On the expressiveness of timed coordination models

Cited by 13 publications

References 55 publications

Data Driven Language for Agents Secure Interaction

Data Driven Language for Agents Secure Interaction

Formalisations and applications of BPMN

Fully abstract models and refinements as tools to compare agents in timed coordination languages

Contact Info

Product

Resources

About