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

  • Hirozumi Yamaguchi
  • Gregor von Bochmann
  • Teruo Higashino
Part of the Lecture Notes in Computer Science book series (LNCS, volume 2767)


In this paper, we propose a new algorithm for the derivation of a protocol specification in Pr/T-nets, which is the specification of communicating 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 service specification into a set of communicating Pr/T-subnets running on the N entities. Moreover, for the efficient control of conflict of shared resources, we present a timestamp-based mutual exclusion algorithm and incorporate it into the derivation algorithm.


  1. 1.
    Jensen, K.: Coloured Petri Nets. Basic Concepts, Analysis Methods and Practical Use. Springer, Heidelberg (1997)CrossRefzbMATHGoogle Scholar
  2. 2.
    Saleh, K.: Synthesis of Communication Protocols: an Annotated Bibliography. ACM SIGCOMM Computer Communication Review 26(5), 40–59 (1996)CrossRefGoogle Scholar
  3. 3.
    Erdogmus, H., Johnston, R.: On the Specification and Synthesis of Communicating Processes. IEEE Trans. on Software Engineering SE-16(12) (1990)Google Scholar
  4. 4.
    Gotzhein, R., Bochmann, G.v.: Deriving Protocol Specifications from Service Specifications Including Parameters. ACM Trans. on Computer Systems 8(4), 255–283 (1990)CrossRefGoogle Scholar
  5. 5.
    Kant, C., Higashino, T., Bochmann, G.v.: Deriving Protocol Specifications from Service Specifications Written in LOTOS. Distributed Computing 10(1), 29–47 (1996)CrossRefGoogle Scholar
  6. 6.
    Chu, P.-Y.M., Liu, M.T.: Protocol Synthesis in a State-transition Model. In: Proc. of COMPSAC 1988, pp. 505–512 (1988)Google Scholar
  7. 7.
    Kahlouche, H., Girardot, J.J.: A Stepwise Requirement Based Approach for Synthesizing Protocol Specifications in an Interpreted Petri Net Model. In: Proc. of INFOCOM 1996, pp. 1165–1173 (1996)Google Scholar
  8. 8.
    Al-Dallal, A., Saleh, K.: Protocol Synthesis Using the Petri Net Model. In: Prof. of 9th Int. Conf. on Parallel and Distributed Computing and Systems, PDCS 1997 (1997)Google Scholar
  9. 9.
    Yamaguchi, H., El-Fakih, K., Bochmann, G.v., Higashino, T.: Protocol Synthesis and Re-synthesis with Optimal Allocation of Resources Based on Extended Petri Nets. Distributed Computing 16(1), 21–35 (2003)CrossRefGoogle Scholar
  10. 10.
    Khoumsi, A., Saleh, K.: Two Formal Methods for the Synthesis of Discrete Event Systems. Computer Networks and ISDN Systems 29(7), 759–780 (1997)CrossRefGoogle Scholar
  11. 11.
    Kapus-Koler, M.: Deriving Protocol Specifications from Service Specifications with Heterogeneous Timing Requirements. In: Proc. of 1991 Int. Conf. on Software Engineering for Real Time Systems, pp. 266–270 (1991)Google Scholar
  12. 12.
    Voss, K.: Using Predicate/Transition-Nets to Model and Analyze Distributed Database Systems. IEEE Trans. on Software Engineering 6(6), 539–544 (1980)CrossRefzbMATHGoogle Scholar
  13. 13.
    Korth, H.F., Silberschatz, A.: Database System Concepts. McGraw-Hill, New York (1991)zbMATHGoogle Scholar
  14. 14.
    Yamaguchi, H., Bochmann, G.v., Higashino, T.: Decomposing Service Definition in Predicate/Transition-Nets for Designing Distributed Systems. Online Document (2003),

Copyright information

© IFIP International Federation for Information Processing 2003

Authors and Affiliations

  • Hirozumi Yamaguchi
    • 1
  • Gregor von Bochmann
    • 2
  • Teruo Higashino
    • 1
  1. 1.Graduate School of Information Science and TechnologyOsaka UniversityOsakaJapan
  2. 2.School of Information Technology and EngineeringUniversity of OttawaOttawaCanada

Personalised recommendations