Methodology of Dynamical Analysis of SDL Programs Using Predicate /Transition Nets

The rapid increase of parallel and distributed systems has brought new problems related to the correctness of the systems. In this work the automatic veriication tool EMMA is presented, which uses Predicate/Transition nets to model TNSDL programs. The veriication is based on reachability analysis with the PROD analyzer. Several methods to avoid state space explosion are discussed, e.g. model optimization, advanced state space generation algorithms and direct TNSDL program manipulation. The emphasis in this work will be on model optimizations for industrial TNSDL programs, but non-exhaustive methods are also considered. Key principles used in the modeling of TNSDL programs are also explained. In the EMMA project the complete TNSDL language has been modeled. The diierence between the model and the implementation is small, because both are generated automatically from the same TNSDL speciication. The results of the reachability analysis are translated back to TNSDL making the tool easier to use for specialists not acquainted with net theory.

[1]  Marko Rauhamaa,et al.  Digital Systems Laboratory Series A: Research Reports a Comparative Study of Methods for Efficient Reachability Analysis a Comparative Study of Methods for Eecient Reachability Analysis , 2007 .

[2]  Rolv Bræk.  SDL Basics , 1996, Comput. Networks ISDN Syst..

[3]  Janne Halme,et al.  PROD Reference Manual , 1995 .

[4]  Tero Jyrinki.  Dynamical Analysis Of Sdl Programs With Predicate/transition Nets , 1997 .

[5]  Pierre Wolper,et al.  Simple on-the-fly automatic verification of linear temporal logic , 1995, PSTV.

[6]  Wolfgang Thomas,et al.  Handbook of Theoretical Computer Science, Volume B: Formal Models and Semantics , 1990 .

[7]  Antti Valmari,et al.  A stubborn attack on state explosion , 1990, Formal Methods Syst. Des..

[8]  Dieter Hogrefe.  Validation of SDL Systems , 1996, Comput. Networks ISDN Syst..

[9]  Pierre Wolper,et al.  Reliable Hashing without Collosion Detection , 1993, CAV.

[10]  E. Allen Emerson,et al.  Automated Temporal Reasoning about Reactive Systems , 1996, Banff Higher Order Workshop.

[11]  N. Husberg.  Formal Models for Real Programs , 1997 .

[12]  Raymond R. Devillers,et al.  Partial-order Methods for the Veriication of Concurrent Systems an Approach to the State-explosion Problem Th Ese Pr Esent Ee Par , 1995 .

[13]  Lars Michael Kristensen,et al.  Design/CPN - A Computer Tool for Coloured Petri Nets , 1997, TACAS.

[14]  David L. Dill,et al.  A New Scheme for Memory-eecient Probabilistic Veriication a New Scheme for Memory-eecient Probabilistic Veriication , 2007 .

[15]  Christos H. Papadimitriou,et al.  Elements of the Theory of Computation , 1997, SIGA.