A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2019; you can also visit the original URL.
The file type is
Lecture Notes in Computer Science
Theories of efficiency preorders and precongruences for concurrent systems have been described in various papers. We describe a procedure to implement two of these precongruences. Considering the extra information that is needed to be maintained while computing efficiency preorders, our procedure with a complexity O(n 3 m), compares favourably with that for deciding observational equivalence (O(n α m)). Further, the algorithm may be plugged in to existing model-checkers such as thedoi:10.1007/978-3-642-40213-5_6 fatcat:cwsz7tsvnvfrbgnqehhpaw6xqq