Extending statecharts with process algebra operators

This paper describes an adaptation of statecharts to take advantage of process algebra operators like those found in CSP and EB3. The resulting notation is called algebraic state transition diagrams (ASTDs). The process algebra operators considered include sequence, iteration, parallel composition, and quantified synchronization. Quantification is one of the salient features of ASTDs, because it provides a powerful mechanism to precisely and explicitly define cardinalities in a dynamic model. The formal semantics of ASTDs is expressed using the operational style typically used in process algebras. The target application domain is the specification and implementation of information systems.

[1]  Martin Wirsing,et al.  Algebraic Specification , 1991, Handbook of Theoretical Computer Science, Volume B: Formal Models and Sematics.

[2]  Manfred Broy,et al.  Invited Talk: Algebraic State Machines , 2000, AMAST.

[3]  J. Van Leeuwen,et al.  Handbook of theoretical computer science - Part A: Algorithms and complexity; Part B: Formal models and semantics , 1990 .

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

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

[6]  Egon Börger,et al.  Abstract State Machines. A Method for High-Level System Design and Analysis , 2003 .

[7]  Michael A. Arbib,et al.  Theories of abstract automata , 1969, Prentice-Hall series in automatic computation.

[8]  Jonathan P. Bowen,et al.  ZB 2002:Formal Specification and Development in Z and B , 2002, Lecture Notes in Computer Science.

[9]  Jan A. Bergstra,et al.  Process Algebra for Synchronous Communication , 1984, Inf. Control..

[10]  Florence Maraninchi,et al.  Argonaute: Graphical Description, Semantics and Verification of Reactive Systems by Using a Process Algebra , 1989, Automatic Verification Methods for Finite State Systems.

[11]  Pierre-Yves Schobbens,et al.  From Interaction Diagrams to State Machines: Moving to Class-Level , 2006 .

[12]  Andrew William Roscoe,et al.  The Theory and Practice of Concurrency , 1997 .

[13]  Jim Woodcock,et al.  Using Z - specification, refinement, and proof , 1996, Prentice Hall international series in computer science.

[14]  Marc Frappier,et al.  Efficient Symbolic Execution of Large Quantifications in a Process Algebra , 2007, ICFEM.

[15]  C. A. R. Hoare,et al.  Communicating sequential processes , 1978, CACM.

[16]  Joseph Sifakis,et al.  Automatic Verification Methods for Finite State Systems , 1989, Lecture Notes in Computer Science.

[17]  Marc Frappier,et al.  Integration of Sequential Scenarios , 1998, IEEE Trans. Software Eng..

[18]  Manfred Broy,et al.  State Transition Diagrams , 1996 .

[19]  Peter Bernus,et al.  Handbook on Architectures of Information Systems , 1999 .

[20]  Jean-Raymond Abrial,et al.  The B-book - assigning programs to meanings , 1996 .

[21]  Rance Cleaveland,et al.  Statecharts Via Process Algebra , 1999, CONCUR.

[22]  Jim Woodcock,et al.  The Semantics of Circus , 2002, ZB.

[23]  Marc Frappier,et al.  Algebraic State Transition Diagrams , 2008 .

[24]  Marc Frappier,et al.  State Transition Diagrams , 1998 .

[25]  Marc Frappier,et al.  EB3: an entity-based black-box specification method for information systems , 2003, Software & Systems Modeling.

[26]  David Harel,et al.  LSCs: Breathing Life into Message Sequence Charts , 1999, Formal Methods Syst. Des..

[27]  Tommaso Bolognesi,et al.  Tableau methods to describe strong bisimilarity on LOTOS processes involving pure interleaving and enabling , 1994, FORTE.