A Theory of Communicating Sequential Processes
Journal of the ACM (JACM)
Algebraic laws for nondeterminism and concurrency
Journal of the ACM (JACM)
Communicating sequential processes
Communicating sequential processes
Observation equivalence as a testing equivalence
Theoretical Computer Science
Modal logics for communicating systems
Theoretical Computer Science
Introduction to the ISO specification language LOTOS
Computer Networks and ISDN Systems - Special Issue: Protocol Specification and Testing
Algebraic theory of processes
Communication and concurrency
Refinement calculus, part II: parallel and reactive programs
REX workshop Proceedings on Stepwise refinement of distributed systems: models, formalisms, correctness
Process algebra
Computing behavioural relations, logically
Proceedings of the 18th international colloquium on Automata, languages and programming
The concurrency workbench: a semantics-based tool for the verification of concurrent systems
ACM Transactions on Programming Languages and Systems (TOPLAS)
A linear-time model-checking algorithm for the alternation-free modal mu-calculus
Formal Methods in System Design - Special issue on computer-aided verification: special methods II
Computing Diagnostic Test for Incorrect Processes
Proceedings of the IFIP TC6/WG6.1 Twelth International Symposium on Protocol Specification, Testing and Verification XII
Computing Ready Simulations Efficiently
NAPAW '92 Proceedings of the First North American Process Algebra Workshop
On Automatically Explaining Bisimulation Inequivalence
CAV '90 Proceedings of the 2nd International Workshop on Computer Aided Verification
Computing Distinguishing Formulas for Branching Bisimulation
CAV '91 Proceedings of the 3rd International Workshop on Computer Aided Verification
Stepwise Refinement of Action Systems
Proceedings of the International Conference on Mathematics of Program Construction, 375th Anniversary of the Groningen University
TACAS 2001 Proceedings of the 7th International Conference on Tools and Algorithms for the Construction and Analysis of Systems
Stepwise Development of Process-Algebraic Specifications in Decorated Trace Semantics
Formal Methods in System Design
| Hi-index | 0.00 |
This paper describes a method for generating diagnostic information that explains why a given finite-state system fails to be greater than its specification with respect to the prebisimulation preorder. The information takes the form of a logical formula satisfied by the specification but not by the system and thus may be used by system designers for debugging purposes. Our technique relies on modifying an algorithm for computing the prebisimulation preorder so that information needed for generating these distinguishing formulas is saved appropriately. As a number of other behavioral preorders may be characterized in terms of prebisimulation preorder, our approach may be used as a basis for computing diagnostic information for these relations as well.