Planning Proofs of Equations in CCS
Automated Software Engineering
Bisimulation Equivanlence Is Decidable for Normed Process Algebra
ICAL '99 Proceedings of the 26th International Colloquium on Automata, Languages and Programming
An omega-Complete Equational Specification of Interleaving
ICALP '00 Proceedings of the 27th International Colloquium on Automata, Languages and Programming
Techniques for Decidability and Undecidability of Bisimilarity
CONCUR '99 Proceedings of the 10th 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
Synthesizing Distributed Transition Systems from Global Specification
Proceedings of the 19th Conference on Foundations of Software Technology and Theoretical Computer Science
CCS with Hennessy's merge has no finite-equational axiomatization
Theoretical Computer Science - Expressiveness in concurrency
Decomposition orders: another generalisation of the fundamental theorem of arithmetic
Theoretical Computer Science - Process algebra
Decomposition and complexity of hereditary history preserving bisimulation on BPP
CONCUR 2005 - Concurrency Theory
A finite equational base for CCS with left merge and communication merge
ACM Transactions on Computational Logic (TOCL)
A distribution law for CCS and a new congruence result for the π-calculus
FOSSACS'07 Proceedings of the 10th international conference on Foundations of software science and computational structures
Impossibility results for the equational theory of timed CCS
CALCO'07 Proceedings of the 2nd international conference on Algebra and coalgebra in computer science
A geometric approach to the problem of unique decomposition of processes
CONCUR'10 Proceedings of the 21st international conference on Concurrency theory
On the expressiveness and decidability of higher-order process calculi
Information and Computation
Composition and decomposition in true-concurrency
FOSSACS'05 Proceedings of the 8th international conference on Foundations of Software Science and Computation Structures
Unique parallel decomposition in branching and weak bisimulation semantics
TCS'12 Proceedings of the 7th IFIP TC 1/WG 202 international conference on Theoretical Computer Science
On unique decomposition of processes in the applied π-calculus
FOSSACS'13 Proceedings of the 16th international conference on Foundations of Software Science and Computation Structures
Hi-index | 5.23 |