Semantic Quality Attributes for Big-Step Modelling Languages

A semantic quality attribute of a modelling language is a desired semantic characteristic that is common to all models specified in that language. A modeller can enjoy the luxury of not having to model the invariants of the behaviour that are implicitly enforced by the semantic quality attributes. In this paper, we introduce three semantic quality attributes for the family of big-step modelling languages (BSMLs). In a BSML, a model's reaction to an environmental input is a sequence of small steps, each of which can consist of the execution of a set of transitions from multiple concurrent components. Each of our three semantic quality attributes specifies a desired property about how the sequence of small steps form a big step. We systematically enumerate the range of BSML semantics that satisfy each semantic quality attribute.

[1]  Nancy A. Day,et al.  Semantic Criteria for Choosing a Language for Big-Step Models , 2009, 2009 17th IEEE International Requirements Engineering Conference.

[2]  Janusz A. Brzozowski,et al.  True Concurrency in Models of Asynchronous Circuit Behavior , 2003, Formal Methods Syst. Des..

[3]  Edward L. Robertson,et al.  Properties of Conflict-Free and Persistent Petri Nets , 1978, JACM.

[4]  Joost-Pieter Katoen,et al.  A probabilistic extension of UML statecharts: Specification and Verification. , 2002 .

[5]  David Lorge Parnas,et al.  Software Requirements for the A-7E Aircraft. , 1992 .

[6]  François Pottier,et al.  A constraint-based approach to guarded algebraic data types , 2007, TOPL.

[7]  Maciej Koutny,et al.  Structure of Concurrency , 1991, Theor. Comput. Sci..

[8]  Amir Pnueli,et al.  What is in a Step: On the Semantics of Statecharts , 1991, TACS.

[9]  Nancy A. Day,et al.  Deconstructing the semantics of big-step modelling languages , 2010, Requirements Engineering.

[10]  Gérard Berry,et al.  The constructive semantics of pure esterel , 1996 .

[11]  L HeitmeyerConstance,et al.  Automated consistency checking of requirements specifications , 1996 .

[12]  Rajeev Alur,et al.  Inference of message sequence charts , 2000, Proceedings of the 2000 International Conference on Software Engineering. ICSE 2000 the New Millennium.

[13]  Benjamin C. Pierce,et al.  Theoretical Aspects of Computer Software , 2001, Lecture Notes in Computer Science.

[14]  Nancy A. Day,et al.  Prescriptive Semantics for Big-Step Modelling Languages , 2010, FASE.

[15]  Grzegorz Rozenberg,et al.  Real-Time: Theory in Practice: Rex Workshop, Mook, the Netherlands, June 3-7, 1991: Proceedings , 1992 .

[16]  Constance L. Heitmeyer,et al.  Automated consistency checking of requirements specifications , 1996, TSEM.

[17]  Hao Zhang,et al.  Delay-Insensitivity and Semi-Modularity , 2000, Formal Methods Syst. Des..

[18]  Florence Maraninchi,et al.  Argos: an automaton-based synchronous language , 2001, Comput. Lang..

[19]  Michael von der Beeck,et al.  A Comparison of Statecharts Variants , 1994, FTRTFT.

[20]  Richard M. Karp,et al.  Parallel Program Schemata , 1969, J. Comput. Syst. Sci..

[21]  Olivier Tardieu,et al.  A deterministic logical semantics for pure Esterel , 2007, TOPL.

[22]  Perdita Stevens,et al.  Modelling Recursive Calls with UML State Diagrams , 2003, FASE.

[23]  Nicolas Halbwachs,et al.  Synchronous Programming of Reactive Systems , 1992, CAV.

[24]  Gérard Berry,et al.  The Esterel Synchronous Programming Language: Design, Semantics, Implementation , 1992, Sci. Comput. Program..

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

[26]  Rob Gerth,et al.  Semantics of Reactive Systems in Abstract Time , 1991, REX Workshop.