Constructing Multi-Formalism State-Space Analysis Tools: Using rules to specify dynamic semantics of models

P.za Leonardo da Vinci, 32 20133 Milano, Italia pezze@elet.polimi.it State-space analysis techniques have been developed for several representations of concurrent systems, but each tool or technique has typically been targeted to a single design or program notation. We describe an approach to constructing multi-formalism state-space analysis tools for heterogeneous system descriptions, using a shared "inframodel" that represents only the essential information for interpretation by tool components that can be customized to reflect the semantics of each formalism. The (operational) semantics of each formalism, as well as interactions between components described in different formalisms, is described separately through rules governing enabling, matching, and firing of transitions. This results in more natural and compact internal representations, and more efficient analysis, than a purely translational approach. In a previous paper, execution semantics of the inframodel was controlled through a limited set of parameters. The rulebased approach described in this paper accomodates a wider range of state-transition formalisms.

[1]  Mauro Pezzè,et al.  Generation of multi-formalism state-space analysis tools , 1996, ISSTA '96.

[2]  David Harel,et al.  Statecharts: A Visual Formalism for Complex Systems , 1987, Sci. Comput. Program..

[3]  Bo Ingvar Sandén The Case for Electric Design of Real-Time Software , 1989, IEEE Trans. Software Eng..

[4]  Nancy A. Day A Model Checker for Statecharts , 1993 .

[5]  George S. Avrunin,et al.  Constrained expressions: toward broad applicability of analysis methods for distributed software systems , 1988, TOPL.

[6]  Michael Jackson,et al.  Conjunction as composition , 1993, TSEM.

[7]  Luciano Baresi,et al.  Customizable notations for kernel formalisms , 1995, Proceedings of First IEEE International Conference on Engineering of Complex Computer Systems. ICECCS'95.

[8]  Glynn Winskel,et al.  Petri Nets, Algebras, Morphisms, and Compositionality , 1987, Inf. Comput..

[9]  Claus Lewerentz,et al.  Formal Development of Reactive Systems: Case Study Production Cell , 1995 .

[10]  Claus Lewerentz,et al.  Formal Development of Reactive Systems , 1995, Lecture Notes in Computer Science.

[11]  Nancy G. Leveson,et al.  Requirements Specification for Process-Control Systems , 1994, IEEE Trans. Software Eng..

[12]  Michal Young,et al.  Compositional reachability analysis using process algebra , 1991, TAV4.

[13]  Rance Cleaveland,et al.  A Front-End Generator for Verification Tools , 1995, TACAS.

[14]  Gérard Berry,et al.  Synchronous programming of reactive systems: an introduction to ESTEREL , 1988 .