Axiomatising finite concurrent processes
SIAM Journal on Computing
The linear time-branching time spectrum (extended abstract)
CONCUR '90 Proceedings on Theories of concurrency : unification and extension: unification and extension
An efficiency preorder for processes
Acta Informatica
Unique decomposition of processes
Theoretical Computer Science
Structured operational semantics and bisimulation as a congruence
Information and Computation
Model-checking in dense real-time
Information and Computation - Special issue: selections from 1990 IEEE symposium on logic in computer science
A theory of processes with durational actions
AMAST '93 Selected papers of the international conference on Algebraic methodology of software technology
Unreliable channels are easier to verify than perfect channels
Information and Computation
Timing and causality in process algebra
Acta Informatica
Petri nets, commutative context-free grammars, and basic parallel processes
Fundamenta Informaticae
Communication and Concurrency
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
On the Specification and Verification of Performance Properties for a Timed Process Algebra
AMAST '97 Proceedings of the 6th International Conference on Algebraic Methodology and Software Technology
Bisimulation Equivanlence Is Decidable for Normed Process Algebra
ICAL '99 Proceedings of the 26th International Colloquium on Automata, Languages and Programming
Verifying Networks of Timed Processes (Extended Abstract)
TACAS '98 Proceedings of the 4th International Conference on Tools and Algorithms for Construction and Analysis of Systems
Weak Bisimilarity with Infinite-State Systems Can Be Decided in Polynomial Time
CONCUR '99 Proceedings of the 10th 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
CONCUR '96 Proceedings of the 7th International Conference on Concurrency Theory
An Automata-Theoretic Approach to Interprocedural Data-Flow Analysis
FoSSaCS '99 Proceedings of the Second International Conference on Foundations of Software Science and Computation Structure, Held as Part of the European Joint Conferences on the Theory and Practice of Software, ETAPS'99
Dynamic Matrices and the Cost Analysis of Concurrent Programs
AMAST '95 Proceedings of the 4th International Conference on Algebraic Methodology and Software Technology
Decidability of Strong Bisimilarity for Timed BPP
CONCUR '02 Proceedings of the 13th 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
| Hi-index | 0.00 |
We address the problem of deciding performance equivalence for a timed process algebra in which actions are urgent and durational, and where parallel components have independent local clocks. This process algebra can be seen as a timed extension of BPP, a process algebra giving rise to infinite-state processes. While bisimulation was known to be decidable for BPP with a non elementary complexity, our main and surprising result is that, for the timed extension, performance equivalence is decidable in polynomial time.