Occurrence Graphs with Equivalence Classes

Abstract

This CPN ML library makes it possible to construct and analyse occurrence graphs with equivalence classes, i.e., graphs where each node represents a class of closely related system states while each arc represents a class of related state changes. Occurrence graphs with equivalence classes are often much smaller than the corresponding ordinary occurrence graphs. Nevertheless they contain the same information and can be used to answer the same kinds of queries.

Some of the online material below are Adobe Acrobat PDF files.

Notes:

This OE/OS library is an integrated part of Design/CPN 3.1. Therefore you only need to download the library if you are still using Design 3.0.
v1.0.1 must be used with Design/CPN v3.0.4

Manual - 121 kb (pdf)
Installation Guide
Unix Solaris Files v1.0.1 (compressed, tar archive)
Unix Linux Files v1.0.1 (compressed, tar archive)
Mac Files (not available)
Examples
A Large Example Using the OE/OS Tool (pdf)
Calculating the Size of an O-graph (pdf)
Bugs and Problems

Developed by

Jens Bæk Jørgensen and Lars M. Kristensen, Aarhus University Denmark

Maintained by

Lars M. Kristensen, Aarhus University Denmark (kris@daimi.au.dk)

Last modified: Wed Oct 28 19:03:18 MET 1998 -- Design/CPN Online admin