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

  • Hirozumi Yamaguchi
  • Gregor von Bochmann
  • Teruo Higashino
Conference paper

DOI: 10.1007/978-3-540-39979-7_26

Part of the Lecture Notes in Computer Science book series (LNCS, volume 2767)
Cite this paper as:
Yamaguchi H., von Bochmann G., Higashino T. (2003) Decomposing Service Definition in Predicate/Transition-Nets for Designing Distributed Systems. In: König H., Heiner M., Wolisz A. (eds) Formal Techniques for Networked and Distributed Systems - FORTE 2003. FORTE 2003. Lecture Notes in Computer Science, vol 2767. Springer, Berlin, Heidelberg

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 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.

Download to read the full conference paper text

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