Conference Paper

Decomposing Service Definition in Predicate/Transition-Nets for Designing Distributed Systems.

DOI: 10.1007/978-3-540-39979-7_26 Conference: Formal Techniques for Networked and Distributed Systems - FORTE 2003, 23rd IFIP WG 6.1 International Conference, Berlin, Germany, September 29 - October 2, 2003, Proceedings
Source: DBLP

ABSTRACT In this paper, we propose a new algorithm for the derivation of a protocol specification in Pr/T-nets, which is the specification of com-municating N entities (N can be given), from a given service specification in Pr/T-nets and an allocation of the places of the service specification to the N entities. Our algorithm decomposes each transition of the ser-vice specification into a set of communicating Pr/T-subnets running on the N entities. Moreover, for the e cient control of conflict of shared re-sources, we present a timestamp-based mutual exclusion algorithm and incorporate it into the derivation algorithm.

Download full-text

Full-text

Available from: Teruo Higashino, Nov 04, 2014
0 Followers
 · 
60 Views
  • Source
    [Show abstract] [Hide abstract]
    ABSTRACT: We consider the derivation of a protocol specification from a service specification written in Predicate/Transition-nets (Pr/T-nets). The service specification describes the global behavior of a system and includes the allocation of the Pr/T-net places to N distributed sites. The paper presents a new algorithm for deriving a protocol specification that defines the behavior of N communicating entities that execute on the N sites and coordinate their actions in order to conform to the global behavior defined by the service specification. Our algorithm decomposes each transition of the service specification into a set of communicating Pr/T-subnets running on the N entities. Moreover, for efficiently controlling the conflict for shared resources, we present a timestamp-based contention control algorithm and incorporate it into the derivation algorithm. A tool has been developed that implements our algorithm and works together with other existing tools for the graphical representation of the service and derived protocol specifications. Two application examples are discussed.
    Computer Networks 01/2007; DOI:10.1016/j.comnet.2006.03.011 · 1.28 Impact Factor