A Polynomial-Time Algorithm for Deciding True Concurrency Equivalences of Basic Parallel Processes

Slawomir Lasota. A Polynomial-Time Algorithm for Deciding True Concurrency Equivalences of Basic Parallel Processes. In Branislav Rovan, Peter Vojtás, editors, Mathematical Foundations of Computer Science 2003, 28th International Symposium, MFCS 2003, Bratislava, Slovakia, August 25-29, 2003, Proceedings. Volume 2747 of Lecture Notes in Computer Science, pages 521-530, Springer, 2003. [doi]

Abstract

Abstract is missing.