Decidability of performance equivalence for basic parallel processes
We study an extension of the class of Basic Parallel Processes (BPP), in which actions are durational and urgent and parallel components have independent local clocks. The main result is decidability of strong bisimilarity, known also as performance equivalence, in this class. This extends the earlier decidability result for plain BPP by Christensen et al. Our decision procedure is based on decidability of the validity problem for Presburger arithmetic. We prove also polynomial complexity in positive-duration fragment, thus properly extending a previous result by Berard et al. Both ill-timed and well-timed semantics are treated. (C) 2006 Elsevier B.V. All rights reserved.
performance equivalence basic parallel processes process algebra bisimulation equivalence equivalence checking