Generating diagnostic information for behavioral preorders

SummaryThis 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.

[1]  Ralph-Johan Back,et al.  Refinement Calculus, Part II: Parallel and Reactive Programs , 1989, REX Workshop.

[2]  Colin Stirling,et al.  Modal Logics for Communicating Systems , 1987, Theor. Comput. Sci..

[3]  Jan A. Bergstra,et al.  Algebra of Communicating Processes with Abstraction , 1985, Theor. Comput. Sci..

[4]  Kim G. Larsen,et al.  A modal process logic , 1988, [1988] Proceedings. Third Annual Information Symposium on Logic in Computer Science.

[5]  Rance Cleaveland,et al.  Computing Behavioural Relations, Logically , 1991, ICALP.

[6]  Matthew Hennessy,et al.  Algebraic theory of processes , 1988, MIT Press series in the foundations of computing.

[7]  Rance Cleaveland,et al.  The concurrency workbench: a semantics-based tool for the verification of concurrent systems , 1993, TOPL.

[8]  Rance Cleaveland,et al.  On Automatically Explaining Bisimulation Inequivalence , 1990, CAV.

[9]  Tommaso Bolognesi,et al.  Tableau methods to describe strong bisimilarity on LOTOS processes involving pure interleaving and enabling , 1994, FORTE.

[10]  Rance Cleaveland,et al.  A linear-time model-checking algorithm for the alternation-free modal mu-calculus , 1993, Formal Methods Syst. Des..

[11]  Rance Cleaveland,et al.  The Concurrency Workbench , 1990, Automatic Verification Methods for Finite State Systems.

[12]  Rocco De Nicola,et al.  Testing Equivalences for Processes , 1984, Theor. Comput. Sci..

[13]  Robin Milner,et al.  Communication and concurrency , 1989, PHI Series in computer science.

[14]  Jan A. Bergstra,et al.  Process Algebra for Synchronous Communication , 1984, Inf. Control..

[15]  Rance Cleaveland,et al.  On Automatically Distinguishing Inequivalent Processes , 1990, CAV.

[16]  D. J. Walker,et al.  Bisimulation and Divergence , 1990, Inf. Comput..

[17]  Kaisa Sere,et al.  Stepwise Refinement of Action Systems , 1991, Struct. Program..

[18]  C. A. R. Hoare,et al.  Communicating Sequential Processes (Reprint) , 1983, Commun. ACM.

[19]  Bard Bloom,et al.  Computing Ready Simulations Efficiently , 1992, NAPAW.

[20]  C. A. R. Hoare,et al.  A Theory of Communicating Sequential Processes , 1984, JACM.

[21]  Robin Milner,et al.  Algebraic laws for nondeterminism and concurrency , 1985, JACM.

[22]  Samson Abramsky,et al.  Observation Equivalence as a Testing Equivalence , 1987, Theor. Comput. Sci..

[23]  Jos C. M. Baeten,et al.  Process Algebra , 2007, Handbook of Dynamic System Modeling.

[24]  R. Cleaveland,et al.  When is 'partial' adequate? A logic-based proof technique using partial specifications , 1990, [1990] Proceedings. Fifth Annual IEEE Symposium on Logic in Computer Science.

[25]  Edmund M. Clarke,et al.  Symbolic Model Checking: 10^20 States and Beyond , 1990, Inf. Comput..

[26]  Kim G. Larsen,et al.  Compositional Proofs by Partial Specification of Processes , 1988, MFCS.

[27]  D. J. Walker,et al.  Bisimulations and divergence , 1988, [1988] Proceedings. Third Annual Information Symposium on Logic in Computer Science.

[28]  Rance Cleaveland,et al.  Testing equivalence as a bisimulation equivalence , 1989, Formal Aspects of Computing.

[29]  Henri Korver,et al.  Computing Distinguishing Formulas for Branching Bisimulation , 1991, CAV.

[30]  Rance Cleaveland,et al.  Computing Diagnostic Test for Incorrect Processes , 1992, PSTV.