Details

Autor(en) / Beteiligte

• Kiyamura, Susumu
• Takata, Yoshiaki
• Seki, Hiroyuki
• Dongarra, Jack
• Wyrzykowski, Roman
• Waśniewski, Jerzy
• Paprzycki, Marcin

Titel

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

Ist Teil von

• Lecture notes in computer science, 2004, p.298-305

Ort / Verlag

Berlin, Heidelberg: Springer Berlin Heidelberg

Erscheinungsjahr

2004

Link zum Volltext

Quelle

Alma/SFX Local Collection

Beschreibungen/Notizen

• 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) Lin, construct LTSs L1,...,Ln such that the composite process of L1,...,Ln is observably bisimulation equivalent to Lin. 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.