Abstract: The partial update problem for parallel abstract state machines has manifested itself in the cases of counters, sets and maps. We propose a solution of the problem that lends itself to an efficient implementation and covers the three cases mentioned above. There are other cases of the problem that require a more general framework.

The Unified Modeling Language has become widely accepted as a standard in software development. Several tools have been produced to support UML model validation. However, most of them support either static or dynamic model checking; and no tools support to check both static and dynamic aspects of a UML model . But a UML model should include the static and dynamic aspects of a software system. Furthermore, these UML tools translate a UML model into a validation language such as PROMELA. But they have some shortcomings: there is no proof of correctness (with respect to the UML semantics) for these tools. In order to overcome these shortcomings, we present a toolset which can validate both static and dynamic aspects of a model; and this toolset is based on the semantic model using Abstract State Machines. Since the toolset is derived from the semantic model, the toolset is correct with respect to the semantic model.

In this paper, we present the Timed Abstract State Machine (TASM) language, which is a language for the specification of embedded real-time systems. The TASM language is an extension of Abstract State Machines (ASM), that includes facilities for specifying non-functional behavior namely time and resource consumption. In the engineering of real-time systems, the correctness of the system is defined in terms of three aspects- function, time, and resource consumption. The goal of the TASM language and its associated toolset is to provide a basis for specification-based real-time system engineering where these three key aspects can be specified and analyzed. We begin the presentation of the language with a historical survey on the use of ASM in specifying real-time systems. The core difference between the TASM language and ASM is that steps are durative instead of being instantaneous. This paradigm captures the realistic behavior of real-time systems where actions are never instantaneous. The concurrency semantics of TASM is synchronous with respect to durative steps. We present the syntax and semantics of the language and illustrate the concepts using the production cell case study.

State Machines can avoid this separation by unifying them into one model.

State Machines [4] formalism for modeling mpC expressions semantics. The formal specification is implemented using the ASM-based Montages frame- work [6] - a new method for giving the semantics of a programming language.

UML is defined in terms of the four-level modeling architecture. The UML metamodel consists of informal description, syntax, and the well-formedness rules given in OCL. Furthermore, class diagrams have played an important role in software development because they provide basic information about a software system. In this paper, we propose a State Machines. As an application of this method we will use a class diagram to represent OCL structure and therefore an OCL translator is generated. Based on the support of class diagrams and OCL, any user-defined UML model (M1-level), as an instantiation of the UML metamodel, can be compared against the UML metamodel. On the other hand, an object model (M0-level) can be checked based on the user-defined UML model (M1-level). Therefore, more errors can be reported to software developers during the early phase of software development. KEY WORDS abstract state machines, model checking 1

State Machines Philipp W. Kutter Applied Formal Methods Institute AG and Institute TIK, ETH Zurich June 5, 2002 1

A key challenge in the design and analysis of real-time systems is the integration of functional and non-functional properties into a single specification. In this paper, we present an integrated toolset based on the TASM language. The toolset is used to specify and analyze reactive embedded real-time systems. The toolset implements the features of the Timed Abstract State Machine (TASM) language, a novel specification language. The non-functional properties that can be expressed in the language include timing behavior and resource consumption. The toolset enables the creation of executable specifications with well-defined execution semantics, abstraction mechanisms, and composition semantics. The toolset includes facilities for editing, analyzing, and simulating TASM specifications. The features of the toolset are demonstrated using an Electronic Throttle Controller (ETC) from a major automotive vendor. The TASM toolset is used to analyze the mode switching logic of the ETC. The ETC is used to calculate fuel injection and air intake to optimize fuel consumption. The TASM toolset is used to analyze the resource consumption resulting from the mode switching logic, and to verify the completeness and consistency of the specification. 1

The paper presents an approach to automatic compiler test suite generation based on formal language specification. The language specification implemented using ASM formalism is discussed. The practical results for mpC parallel programming language compiler are presented.

Abstract not found