Communication and concurrency
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
Specification and Verification of Timed Lazy Systems
MFCS '96 Proceedings of the 21st International Symposium on Mathematical Foundations of Computer Science
Undecidable Equivalences for Basic Parallel Processes
TACS '94 Proceedings of the International Conference on Theoretical Aspects of Computer Software
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
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
Verifying Performance Equivalence for Timed Basic Parallel Processes
FOSSACS '00 Proceedings of the Third International Conference on Foundations of Software Science and Computation Structures: Held as Part of the Joint European Conferences on Theory and Practice of Software,ETAPS 2000
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
Petri Nets and the Equivalence Problem
CSL '93 Selected Papers from the 7th Workshop on Computer Science Logic
Decidability of performance equivalence for basic parallel processes
Theoretical Computer Science
Hi-index | 0.00 |
We investigate a timed 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 [8] as well as decidability for timed BPP with strictly positive durations of actions [3]. Both ill-timed and well-timed semantics are treated. Our decision procedure is based on decidability of the validity problem for Presburger arithmetic.