On automatically explaining bisimulation inequivalence. The method works in conjunction with a partition-refinement algorithm for computing bisimulation equivalence and yields formulas that are often minimal in a precisely defined sense. Priorities in process algebra. An operational semantics for an algebraic theory of concurrency is developed that incorporates a notion of priority into the definition of the execution of actions. An equivalence based on strong observational equivalence is defined and shown to be a congruence, and a complete axiomatization is given for finite terms.
Several examples highlight the novelty and usefulness of our approach.
A preorder for partial process specifications. Amsterdam, August 1990. This property makes the preorder particularly suitable for reasoning compositionally about networks of processes. The paper also gives a sound and complete axiomatization for finite processes of the largest precongruence contained in this new preorder. A logic-based proof technique using partial specifications.