2-Nested Simulation Is Not Finitely Equationally Axiomatizable
STACS '01 Proceedings of the 18th Annual Symposium on Theoretical Aspects of Computer Science
On finite alphabets and infinite bases
Information and Computation
The equational theory of prebisimilarity over basic CCS with divergence
Information Processing Letters
A finite equational base for CCS with left merge and communication merge
ACM Transactions on Computational Logic (TOCL)
A Cancellation Theorem for BCCSP
Fundamenta Informaticae
Strategic Issues, Problems and Challenges in Inductive Theorem Proving
Electronic Notes in Theoretical Computer Science (ENTCS)
Ready to preorder: get your BCCSP axiomatization for free!
CALCO'07 Proceedings of the 2nd international conference on Algebra and coalgebra in computer science
Axiomatizing weak ready simulation semantics over BCCSP
ICTAC'11 Proceedings of the 8th international conference on Theoretical aspects of computing
A finite equational base for CCS with left merge and communication merge
ICALP'06 Proceedings of the 33rd international conference on Automata, Languages and Programming - Volume Part II
Capture-avoiding substitution as a nominal algebra
ICTAC'06 Proceedings of the Third international conference on Theoretical Aspects of Computing
| Hi-index | 0.01 |