History preserving, causal and mixed-ordering equivalence over stable event structures (note)
Fundamenta Informaticae
A theory of processes with durational actions
AMAST '93 Selected papers of the international conference on Algebraic methodology of software technology
Timing and causality in process algebra
Acta Informatica
Equivalence Notions for Concurrent Systems and Refinement of Actions (Extended Abstract)
MFCS '89 Proceedings on Mathematical Foundations of Computer Science 1989
Specification and Verification of Timed Lazy Systems
MFCS '96 Proceedings of the 21st International Symposium on Mathematical Foundations of Computer Science
Decidability Questions for Bismilarity of Petri Nets and Some Related Problems
STACS '94 Proceedings of the 11th Annual Symposium on Theoretical Aspects of Computer Science
Strong Bisimilarity and Regularity of Basic Parallel Processes Is PSPACE-Hard
STACS '02 Proceedings of the 19th Annual Symposium on Theoretical Aspects of Computer Science
Decidability of Strong Bisimilarity for Timed BPP
CONCUR '02 Proceedings of the 13th International Conference on Concurrency Theory
Relating Processes With Respect to Speed
CONCUR '91 Proceedings of the 2nd International Conference on Concurrency Theory
Bisimulation Equivalence is Decidable for Basic Parallel Processes
CONCUR '93 Proceedings of the 4th International Conference on Concurrency Theory
Note on the Tableau Technique for Commutative Transition Systems
FoSSaCS '02 Proceedings of the 5th International Conference on Foundations of Software Science and Computation Structures
Decidability of Bisimulation Equivalences for Parallel Timer Processes
CAV '92 Proceedings of the Fourth International Workshop on Computer Aided Verification
Strong Bisimilarity on Basic Parallel Processes is PSPACE-complete
LICS '03 Proceedings of the 18th Annual IEEE Symposium on Logic in Computer Science
Non-interleaving bisimulation equivalences on Basic Parallel Processes
Information and Computation
Decidability of branching bisimulation on normed commutative context-free processes
CONCUR'11 Proceedings of the 22nd international conference on Concurrency theory
| Hi-index | 5.23 |
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 Bérard et al. Both ill-timed and well-timed semantics are treated.