Using a Protean Language to Enhance Expressiveness in Specification
IEEE Transactions on Software Engineering
Bisimilarity is not finitely based over BPA with interrupt
Theoretical Computer Science - Algebra and coalgebra in computer science
On the axiomatisability of priority
Mathematical Structures in Computer Science
Bisimilarity is not finitely based over BPA with interrupt
CALCO'05 Proceedings of the First international conference on Algebra and Coalgebra in Computer Science
Hi-index | 0.00 |