Construction of asynchronous communicating systems: weak termination guaranteed!

Authors:
Kees M. van Hee;Natalia Sidorova;Jan Martijn van der Werf
Affiliations:
Department of Mathematics and Computer Science, Technische Universiteit Eindhoven, Eindhoven, The Netherlands;Department of Mathematics and Computer Science, Technische Universiteit Eindhoven, Eindhoven, The Netherlands;Department of Mathematics and Computer Science, Technische Universiteit Eindhoven, Eindhoven, The Netherlands
Venue:
SC'10 Proceedings of the 9th international conference on Software composition
Year:
2010

Citing 8
Cited 3

Petri nets: an introduction

Petri nets: an introduction
Transformations and decompositions of nets

Advances in Petri nets 1986, part I on Petri nets: central models and their properties
Interface automata

Proceedings of the 8th European software engineering conference held jointly with 9th ACM SIGSOFT international symposium on Foundations of software engineering
A Compositional Partial Order Semantics for Petri Net Components

ICATPN '97 Proceedings of the 18th International Conference on Application and Theory of Petri Nets
Compositional Service Trees

PETRI NETS '09 Proceedings of the 30th International Conference on Applications and Theory of Petri Nets
Service-Oriented Modeling: Service Analysis, Design, and Architecture

Service-Oriented Modeling: Service Analysis, Design, and Architecture
Soundness and separability of workflow nets in the stepwise refinement approach

ICATPN'03 Proceedings of the 24th international conference on Applications and theory of Petri nets
Local enforceability in interaction Petri nets

BPM'07 Proceedings of the 5th international conference on Business process management

Refinement of synchronizable places with multi-workflow nets: weak termination preserved

PETRI NETS'11 Proceedings of the 32nd international conference on Applications and theory of Petri Nets
Designing weakly terminating ROS systems

PETRI NETS'12 Proceedings of the 33rd international conference on Application and Theory of Petri Nets
Refinement of Synchronizable Places with Multi-workflow Nets

Fundamenta Informaticae - Applications and Theory of Petri Nets and Other Models of Concurrency, 2011

Quantified Score

Hi-index	0.00

Visualization

Abstract

Correctness of asynchronously communicating systems (ACS) is known to be a hard problem, which became even more actual after the introduction of Service Oriented Architectures and Service Oriented Computing. In this paper, we focus on one particular correctness property, namely weak termination: at anymoment of the system execution, at least one option to terminate should be available. We present a compositional method for constructing an ACS that guarantees weak termination. The method allows for refinement of single components, refinement of compositions of components and the creation of new components in the system. For two important classes of ACS, weak termination follows directly from their structure. These classes focus on the concurrency over components and on the implementation of protocols and communicating choices.