Algebraic laws for nondeterminism and concurrency
Journal of the ACM (JACM)
CIRCAL and the representation of communication, concurrency, and time
ACM Transactions on Programming Languages and Systems (TOPLAS) - Lecture notes in computer science Vol. 174
Communicating sequential processes
Communicating sequential processes
Graph-Based Algorithms for Boolean Function Manipulation
IEEE Transactions on Computers
Extensional equivalence for transition systems
Acta Informatica
Algebraic theory of processes
Communication and concurrency
Proceedings of the international workshop on Automatic verification methods for finite state systems
Efficient implementation of a BDD package
DAC '90 Proceedings of the 27th ACM/IEEE Design Automation Conference
The Formal Description and Verification of Hardware Timing
IEEE Transactions on Computers
A Calculus of Communicating Systems
A Calculus of Communicating Systems
Introduction To Automata Theory, Languages, And Computation
Introduction To Automata Theory, Languages, And Computation
Symbolic Bisimulation Minimisation
CAV '92 Proceedings of the Fourth International Workshop on Computer Aided Verification
Exploiting Symbolic Traversal Techniques for Efficient Process Algebra Manipulation
CHDL '93 Proceedings of the 11th IFIP WG10.2 International Conference sponsored by IFIP WG10.2 and in cooperation with IEEE COMPSOC on Computer Hardware Description Languages and their Applications
| Hi-index | 0.00 |
Process algebras are rapidly becoming a mathematical model used by verification engineers to extend the description capabilities of finite state machines towards higher abstraction levels. As long as design and verification methodologies at the system level are developed the wide spectrum of equivalence relations that can be defined over processes receives an ever increasing importance. Testing equivalences and testing preorders are particularly suited for formalizing the relationships holding in top-down hierarchical methodologies. The main deterrent to the widespread use of process algebras seems to be the lack of efficient tools. Very efficient algorithmic techniques, based on the adoption of binary decision diagrams, are now being used in different fields. This paper presents algorithms for the proof of testing preorders and equivalences that are, to the best of our knowledge, the first successful attempt to implement testing relations with BDDs. Experimental results show that the the implemented algorithms are able to deal with medium and large-size systems.