Efficient model checking of properties of a distributed application: a multimedia case study

A system supporting video on demand is modeled in the process calculus CCS (Calculus of Communicating Systems), while some properties are expressed in a temporal logic and verified by means of the model checkers of the North Carolina Concurrency Workbench. This application was chosen as a case study to evaluate the usefulness of a methodology, by means of which a property is checked on reduced models obtained issuing abstractions of the system on the basis of the formula. Experimental results are shown and discussed. Copyright © 2001 John Wiley & Sons, Ltd.

[1]  Glenn Bruns,et al.  A Practical Technique for Process Abstraction , 1993, CONCUR.

[2]  Antonella Santone,et al.  State Space Reduction by Non-Standard Semantics for Deadlock Analysis , 1998, Sci. Comput. Program..

[3]  Orna Grumberg,et al.  Abstract interpretation of reactive systems , 1997, TOPL.

[4]  Patrice Godefroid,et al.  Partial-Order Methods for the Verification of Concurrent Systems , 1996, Lecture Notes in Computer Science.

[5]  Adnan Aziz,et al.  Formula-Dependent Equivalence for Compositional CTL Model Checking , 1994, CAV.

[6]  Glenn Bruns,et al.  A Case Study in Safety-Critical Design , 1992, CAV.

[7]  H. J. Stuttgen,et al.  Network evolution and multimedia communication , 1995 .

[8]  W. Verbiest,et al.  Interactive video on demand , 1994, IEEE Communications Magazine.

[9]  D. Skellern,et al.  An open-systems approach to video on demand , 1994, IEEE Communications Magazine.

[10]  Marco Ajmone Marsan,et al.  Modelling with Generalized Stochastic Petri Nets , 1995, PERV.

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

[12]  Zohar Manna,et al.  The Temporal Logic of Reactive and Concurrent Systems , 1991, Springer New York.

[13]  Antti Valmari.  A stubborn attack on state explosion , 1992, Formal Methods Syst. Des..

[14]  Roberto Barbuti,et al.  Selective Mu-Calculus and Formula-Based Equivalence of Transition Systems , 1999, J. Comput. Syst. Sci..

[15]  Roberto Barbuti,et al.  LORETO: a tool for reducing state explosion in verification of LOTOS programs , 1999 .

[16]  Leslie Lamport,et al.  Proving the Correctness of Multiprocess Programs , 1977, IEEE Transactions on Software Engineering.

[17]  Robert de Simone,et al.  Compositional Semantics of ESTEREL and Verification by Compositional Reductions , 1994, CAV.

[18]  Roberto Barbuti,et al.  Selective µ-calculus: New Modal Operators for Proving Properties on Reduced Transition Systems , 1997, FORTE.

[19]  Valeria Vittorini,et al.  Formal Specification of Concurrent Systems: A Structured Approach , 1998, Comput. J..

[20]  Colin Stirling,et al.  An Introduction to Modal and Temporal Logics for CCS , 1991, Concurrency: Theory, Language, And Architecture.

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

[22]  Valeria Vittorini,et al.  Efficient Model Checking of Properties of a Multimedia Application , 1999, AAAI 1999.

[23]  Doron A. Peled,et al.  All from One, One for All: on Model Checking Using Representatives , 1993, CAV.

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

[25]  Domenico Ferrari.  Client requirements for real-time communication services , 1990 .

[26]  Edmund M. Clarke,et al.  Model checking and abstraction , 1994, TOPL.

[27]  Tadao Murata,et al.  Petri nets: Properties, analysis and applications , 1989, Proc. IEEE.