Implementing a Modal Logic over Data and Processes using XTL

The modal logic FULL is designed to capture strong bisimulation over early symbolic transition systems (STSs) for full LOTOS. It provides a compact way of expressing and verifying properties involving both data and transitions. In this paper we present a restricted prototype implementation of a model checker for LOTOS for queries written using the FULL logic. The model checker is developed within the CADP package using XTL.

[1]  Chris A. Vissers,et al.  Formal description of the OSI session layer: session service , 1989 .

[2]  A. Prasad Sistla,et al.  Symmetry and model checking , 1993, Formal Methods Syst. Des..

[3]  Matthew Hennessy,et al.  Symbolic Bisimulations , 1995, Theor. Comput. Sci..

[4]  A. Prasad Sistla,et al.  Symmetry and model checking , 1996, Formal Methods Syst. Des..

[5]  Savi Maharaj,et al.  An Adequate Logic for Full LOTOS , 2001, FME.

[6]  Alain Kerbrat,et al.  CADP - A Protocol Validation and Verification Toolbox , 1996, CAV.

[7]  Carron Shankland,et al.  A Symbolic Semantics and Bisimulation for Full LOTOS , 2001, FORTE.

[8]  Savi Maharaj,et al.  A Modal Logic for Full LOTOS based on Symbolic Transition Systems , 2002, Comput. J..

[9]  Daniel Amyot,et al.  Feature Description and Feature Interaction Analysis with Use Case Maps and LOTOS , 2000, FIW.

[10]  Manfred Broy,et al.  Formal Systems Specification , 1996, Lecture Notes in Computer Science.

[11]  Alberto Verdejo,et al.  Implementing CCS in Maude , 2000, FORTE.

[12]  Robert E. Milne,et al.  The formal description technique LOTOS : By P.H.J. van Eijk, C.A. Vissers and M. Diaz, eds. North-Holland, Amsterdam, Netherlands, 1989, Price $102.50 (hardback), ISBN 0-444-87267-1. , 1990 .

[13]  Edmund M. Clarke,et al.  Symbolic model checking for sequential circuit verification , 1993, IEEE Trans. Comput. Aided Des. Integr. Circuits Syst..

[14]  Marten van Sinderen,et al.  Formal description of the OSI session layer: introduction , 1989 .

[15]  Grzegorz Rozenberg,et al.  Linear Time, Branching Time and Partial Order in Logics and Models for Concurrency , 1988, Lecture Notes in Computer Science.

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

[17]  Natarajan Shankar,et al.  An Integration of Model Checking with Automated Proof Checking , 1995, CAV.

[18]  Jeffrey J. Joyce,et al.  Linking BDD-Based Symbolic Evaluation to Interactive Theorem-Proving , 1993, 30th ACM/IEEE Design Automation Conference.

[19]  Edmund M. Clarke,et al.  Model Checking , 1999, Handbook of Automated Reasoning.

[20]  Kenneth J. Turner,et al.  An Architectural Description of Intelligent Network Features and Their Interactions , 1998, Comput. Networks.

[21]  Colin Stirling,et al.  Temporal logics for CCS , 1988, REX Workshop.

[22]  Iso. Lotos,et al.  A Formal Description Technique Based on the Temporal Ordering of Observational Behaviour , 1985 .

[23]  Charles Pecheur,et al.  Using LOTOS for specifying the CHORUS distributed operating system kernel , 1992, Comput. Commun..

[24]  Radu Mateescu,et al.  XTL: A Meta-Language and Tool for Temporal Logic Model-Checking , 1998 .

[25]  Dexter Kozen,et al.  RESULTS ON THE PROPOSITIONAL’p-CALCULUS , 2001 .