Titlebook: Computer Aided Verification; 7th International Co Pierre Wolper Conference proceedings 1995 Springer-Verlag Berlin Heidelberg 1995 Computer

最有利

NATAL

Global rebuilding of OBDDs avoiding memory requirement maxima,er, we describe an implementation of an outputefficient algorithm that transforms an OBDD . representing a Boolean function . with respect to one variable ordering . into an OBDD . that represents . with respect to another variable ordering .. The algorithm runs in average time . and requires . spac

ASTER

Generating BDD models for process algebra terms,is work, we describe how to efficiently derive the ordered Binary Decision Diagrams (BDDs) corresponding to the operational semantics of the terms of an arbitrary Simple system. Model checking using such BDDs can often significantly speedup the testing of properties such as bisimilarity over direct