Skip to main content

Process Decomposition via Synchronization Events and Its Application to Counter-Process Decomposition

  • Conference paper
Parallel Processing and Applied Mathematics (PPAM 2003)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 3019))

  • 635 Accesses

Abstract

In this paper, we consider a process decomposition problem which allows one to use additional synchronization events, and propose a new decomposition method. The process decomposition problem is such that given a single labeled transition system (LTS) L in, construct LTSs L 1,...,L n such that the composite process of L 1,...,L n is observably bisimulation equivalent to L in. The main advantage of the proposed method is that the size of the decomposed LTSs is often much smaller than known methods. Especially, we focus on simple counters and present an algorithm which decomposes a simple counter into smaller counters by using the proposed method.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Subscribe and save

Springer+ Basic
$34.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Similar content being viewed by others

References

  1. Ehrenfeucht, A., Rozenberg, G.: Partial (set) 2-structures; Part II: State spaces of concurrent systems. Acta Informatica 27, 343–368 (1990)

    Article  MATH  MathSciNet  Google Scholar 

  2. Go, K., Shiratori, N.: A decomposition of a formal specification: An improved constraint-oriented method. IEEE Trans. Software Engineering 25(2), 258–273 (1999)

    Article  Google Scholar 

  3. Kiyamura, S., Takata, Y., Seki, H.: A method of decomposing a labeled transition system into parallel processes. Trans. of Inform. Processing Society Japan 42(12), 2992–3003 (2001) (in Japanese)

    Google Scholar 

  4. Kiyamura, S., Takata, Y., Seki, H.: Process decmposition via synchronization events and its application to counter-process decomposition, Technical Report of IEICE, SS2003-4, pp. 19– 24 (2003)

    Google Scholar 

  5. Langerak, R.: Decomposition of functionality: A correctness preserving lotos transformation. In: Protocol Specification, Testing and Verification (PSTV) X, pp. 229–242 (1990)

    Google Scholar 

  6. Morin, R.: Decompositions of asynchronous systems. In: Sangiorgi, D., de Simone, R. (eds.) CONCUR 1998. LNCS, vol. 1466, pp. 549–564. Springer, Heidelberg (1998)

    Chapter  Google Scholar 

  7. Mukund, M.: From global specifications to distributed implementations. In: Synthesis and Control of Discrete Event Systems, pp. 19–35. Kluwer Academic Publishers, Dordrecht (2002)

    Google Scholar 

  8. Saleh, K.: Synthesis of communications protocols: An annotated bibliography. ACM SIGCOMM Computer Communication Review 26(5), 40–59 (1996)

    Article  Google Scholar 

  9. Stirling, C.: Modal and temporal logics for processes. In: Moller, F., Birtwistle, G. (eds.) Logics for Concurrency. LNCS, vol. 1043, pp. 149–237. Springer, Heidelberg (1996)

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2004 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Kiyamura, S., Takata, Y., Seki, H. (2004). Process Decomposition via Synchronization Events and Its Application to Counter-Process Decomposition. In: Wyrzykowski, R., Dongarra, J., Paprzycki, M., Waśniewski, J. (eds) Parallel Processing and Applied Mathematics. PPAM 2003. Lecture Notes in Computer Science, vol 3019. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-24669-5_39

Download citation

  • DOI: https://doi.org/10.1007/978-3-540-24669-5_39

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-21946-0

  • Online ISBN: 978-3-540-24669-5

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics