It is well known that the best results regarding concurrent system design are obtained when design errors are found in the earliest possible phase. For that purpose system specification is verified through model checking. We try to hide, as much as possible, the model checking formalism from the designers viewpoint. First, a system is modeled as a set of processes described formally as an extended finite state machine within the SDL/sup --/ language. Such a description is translated into the model checker, SPIN, where the desired properties are verified. Special attention is given to the possibility of modeling various types of transitions and to a definition of the tool where model checking is performed. With such an approach the designer can have the, SDL/sup --/ specification verified against the desired properties.
[1]
Edward A. Lee,et al.
A framework for comparing models of computation
,
1998,
IEEE Trans. Comput. Aided Des. Integr. Circuits Syst..
[2]
Heikki Tuominen.
Embedding a Dialect of SDL in PROMELA
,
1999,
SPIN.
[3]
Bernd Grahlmann,et al.
Combining Finite Automata, Parallel Programs and SDL Using Petri Nets
,
1998,
TACAS.
[4]
B. Blaskovic.
Petri net modeling for signaling protocol synthesis
,
1998,
MELECON '98. 9th Mediterranean Electrotechnical Conference. Proceedings (Cat. No.98CH36056).
[5]
Kenneth L. McMillan,et al.
The SMV System
,
1993
.
[6]
Gerard J. Holzmann,et al.
Validating SDL Specifications: an Experiment
,
1989,
PSTV.