by Markus Malmqvist, Markus Malmqvist
http://www.tcs.hut.fi/Publications/bibdb/HUT-TCS-B16.ps.gz
Add To MetaCart
Abstract:
Abstract: The rapid increase of parallel and distributed systems has brought new problems related to the correctness of the systems. In this work the automatic verication tool EMMA is presented, which uses Predicate/Transition nets to model TNSDL programs. The verication 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 dioeerence between the model and the implementation is small, because both are generated automatically from the same TNSDL specication. The results of the reachability analysis are translated back to TNSDL making the tool easier to use for specialists not acquainted with net theory. Keywords: reachability analysis, SDL, formal methods, Predicate/Transition nets,
Citations
|
233
|
A stubborn attack on state explosion
– Valmari
- 1991
|
|
231
|
Elements of the Theory of Computation
– Lewis, Papadimitriou
- 1981
|
|
60
|
Reliable Hashing without Collision Detection
– Wolper, Leroy
- 1993
|
|
34
|
Automated temporal reasoning about reactive systems. Logics for Concurrency: Structure versus Automata
– Emerson
- 1996
|
|
23
|
State Compression in SPIN: Recursive Indexing and Compression Traning Runs
– Holzmann
- 1997
|
|
18
|
The AVALON project: a validation environment for SDL/MSC descriptions
– Algayres, Lejeune, et al.
- 1993
|
|
14
|
PROD - A Pr/T-Net Reachability Analysis Tool
– Gronberg, Tiusanen, et al.
- 1993
|
|
12
|
Design/CPN—A Computer Tool for Coloured Petri Nets
– Christensen, Jørgensen, et al.
- 1997
|
|
12
|
P.: Automatic Verication of Finite-State Concurrent Systems Using Temporal Logic Specications
– Clarke, Emerson, et al.
- 1986
|
|
10
|
Automata on innite objects
– Thomas
- 1990
|
|
9
|
Partial-Order Methods for the Verication of Concurrent Systems An Approach to the State-Explosion Problem, volume 1032 of LNCS
– Godefroid
- 1996
|
|
8
|
Predicate / Transition Nets
– Genrich
- 1987
|
|
6
|
A Comparative Study of Methods for EOEcient Reachability Analysis
– Rauhamaa
- 1990
|
|
5
|
A Primer on High-Level Petri-Net Theory
– Smith
- 1996
|
|
3
|
Where could SPIN go next? A unifying approach to exploring innite state spaces
– Wolper
- 1997
|
|
2
|
T.: The Emma Analyzer
– Husberg, Malmqvist, et al.
- 1997
|
|
2
|
Dynamical Analysis of SDL Programs with Predicate /Transition Nets
– Jyrinki
- 1997
|
|
2
|
Description Language (SDL) - SDL formal denition: Static Semantics
– Specication
- 1994
|
|
1
|
SDL Basics. SDL'95 Forum Tutorial
– Braek
- 1995
|
|
1
|
P.: Simple On-the-Fly Automatic Verication of Linear Temporal Logic
– Gerth, Peled, et al.
- 1995
|
|
1
|
Validation of SDL Systems. SDL'95 Forum Tutorial
– Hogrefe
- 1995
|
|
1
|
Report of a preliminary investigation: EMMA - an Extendible Multi Method Analyzer
– Husberg, Ojala, et al.
- 1995
|
|
1
|
Integration of EMMA Programs fcf and lter to emma. Special assignment
– Manner
- 1997
|
|
1
|
D.: A New Scheme for Memory-EOEcient Probabilistic Verication
– Stern, Dill
- 1996
|
