论文信息 - Equivalence checking of two Statechart specifications

Equivalence checking of two Statechart specifications

In this paper we give a process algebraic semantics for Statechart via a translation into algebra of communicating shared resources (ACSR). Also, we propose a formal verification method for Statechart specifications by showing an equivalence relationship between two Statechart specifications. This makes it possible to combine the advantages of a graphical language with the rigor of process algebra.

Jin-Young Choi | Inhye Kang | Ki-Seok Bang | Myung-Hwan Park

[1] Scott A. Smolka,et al. A Compositional Semantics for Statecharts using Labeled Transition Systems , 1994, CONCUR.

[2] I. Kang,et al. Translation of Modechart Speciication to Algebra of Communicating Shared Resources , 1994 .

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

[4] Amnon Naamad,et al. The STATEMATE semantics of statecharts , 1996, TSEM.

[5] Scott A. Smolka,et al. A Process Algebraic Semantics for Statecharts via State Refinement , 1994, PROCOMET.

[6] Duncan Clarke. VERSA: Verification, Execution and Rewrite System for ASCR , 1995 .

[7] Robin Milner,et al. Communication and concurrency , 1989, PHI Series in computer science.

[8] David Notkin,et al. Model checking large software specifications , 1996, SIGSOFT '96.

[9] Lynn Conway,et al. Introduction to VLSI systems , 1978 .