ing WS1S Systems to Verify Parameterized Networks . . . . . . . . . . . . 188 Kai Baukus, Saddek Bensalem, Yassine Lakhnech and Karsten Stahl FMona: A Tool for Expressing Validation Techniques over Infinite State Systems . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 204 J.-P. Bodeveix and M. Filali Transitive Closures of Regular Relations for Verifying Infinite-State Systems . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 220 Bengt Jonsson and Marcus Nilsson Diagnostic and Test Generation Using Static Analysis to Improve Automatic Test Generation . . . . . . . . . . . . . 235 Marius Bozga, Jean-Claude Fernandez and Lucian Ghirvu Efficient Diagnostic Generation for Boolean Equation Systems . . . . . . . . . . . . 251 Radu Mateescu Efficient Model-Checking Compositional State Space Generation with Partial Order Reductions for Asynchronous Communicating Systems . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 266 Jean-Pierre Krimm and Laurent Mounier Checking for CFFD-Preorder with Tester Processes . . . . . . . . . . . . . . . . . . . . . . . 283 Juhana Helovuo and Antti Valmari Fair Bisimulation . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 299 Thomas A. Henzinger and Sriram K. Rajamani Integrating Low Level Symmetries into Reachability Analysis . . . . . . . . . . . . . 315 Karsten Schmidt Model-Checking Tools Model Checking Support for the ASM High-Level Language . . . . . . . . . . . . . . 331 Giuseppe Del Castillo and Kirsten Winter Table of

Tools and Algorithms for the Construction and Analysis of Systems. Proc. TACAS 2009

Evolution of software in automated production systems

This abstract summarizes the paper accepted at the Journal of Systems and Software with the same title [1]. 
Automated production systems form the backbone of the world’s industrial production. They are highly specialized technical systems, which are comprised of mechanical, electrical and electronic parts and software, all closely interwoven. Software is the defining factor to realize modern trends in manufacturing as defined by mass customization, small lot sizes, high variability of product types, and a changing product portfolio during the lifecycle of an automated production system. However, the software can control the production system only via electrical and mechanical means, which have their individual life cycles and undergo evolution. Hence, the evolution of automated production systems always requires addressing cross-disciplinary evolution challenges.
We provide an interdisciplinary survey on the challenges, the state-of-the-art as well as research directions with respect to the evolution of software in automated production systems. In the first part, we discuss the specifics of the development process as well as the different types of evolutions during the system’s life-cycle. In the second part, we survey the challenges due to evolution covering the different development phases (requirements, design, implementation, validation & verification) and several important cross-cutting aspects (variability management, model-driven engineering, and traceability), and review existing potential approaches. Finally, we outline future research directions for the discussed challenges.

Evolution of software in automated production systems: Challenges and Research Directions

Refactoring is a widely accepted technique to improve the structure of object-oriented software. Nevertheless, existing tool support remains restricted to automatically applying refactoring transformations. Deciding what to refactor and which refactoring to apply still remains a difficult manual process, due to the many dependencies and interrelationships between relevant refactorings. In this paper, we represent refactorings as graph transformations, and we propose the technique of critical pair analysis to detect the implicit dependencies between refactorings. The results of this analysis can help the developer to make an informed decision of which refactoring is most suitable in a given context and why. We report on several experiments we carried out in the AGG graph transformation tool to support our claims.

/pdf/analysing-refactoring-dependencies-using-graph-3p3o4dx0ad.pdf

Analysing refactoring dependencies using graph transformation

Service engineering

The correctness of model transformations is a crucial element for model-driven engineering of high quality software. In particular, behavior preservation is the most important correctness property avoiding the introduction of semantic errors during the model-driven engineering process. Behavior preservation verification techniques either show that specific properties are preserved, or more generally and complex, they show some kind of bisimulation between source and target model of the transformation. Both kinds of behavior preservation verification goals have been presented with automatic tool support for the instance level, i.e. for a given source and target model specified by the model transformation. However, up until now there is no automatic verification approach available at the transformation level, i.e. for all source and target models specified by the model transformation. In this paper, we present a first approach towards automatic behavior preservation verification for model transformations specified by triple graph grammars and semantic definitions given by graph transformation rules. In particular, we show that the behavior preservation problem can be reduced to invariant checking for graph transformation. We discuss today's limitations of invariant checking for graph transformation and motivate further lines of future work in this direction.

Towards automatic verification of behavior preservation for model transformation via invariant checking

This paper introduces negative application conditions for reconfigurable place/transition nets. These are Petri nets together with a set of rules that allow changing the net and its marking dynamically. Negative application conditions are a control structure that prohibits the application of a rule if certain structures are already existent. We motivate the use of negative application conditions in a short example. Subsequently the underlying theory is sketched and the results – concerning parallelism, concurrency and confluence – are presented. Then we resume the example and explicitly discuss the main results and their usefulness within the example.

/pdf/negative-application-conditions-for-reconfigurable-place-4iz066y4ae.pdf

Negative Application Conditions for Reconfigurable Place/Transition Systems

Model transformations can be specified using an operational or a relational approach. For a relational approach, an operationalization must be derived from the transformation specification using approved formal concepts, so that the operationalization conforms to the specification. A conforming operationalization transforms a source model S to a target model T, which is moreover related to S according to the relational transformation specification. The conformance of an operationalization with its relational specification must be tested since it is not certain that the formal concepts have been correctly realized by the implementation. Moreover, transformation implementations often perform optimizations, which may violate conformance.

Complete Specification Coverage in Automatically Generated Conformance Test Cases for TGG Implementations

Model-based Software Engineering (MBSE) is now accepted as a Software Engineering (SE) discipline and is being taught as part of more general SE curricula. However, an agreed core of concepts, mechanisms and practices --- which constitutes the Body of Knowledge of a discipline --- has not been captured anywhere, and is only partially covered by the SE Body of Knowledge (SWEBOK). With the goals of characterizing the contents of the MBSE discipline, promoting a consistent view of it worldwide, clarifying its scope with regard to other SE disciplines, and defining a foundation for a curriculum development on MBSE, this paper provides a proposal for an extension of the contents of SWEBOK with the set of fundamental concepts, terms and mechanisms that should constitute the MBSE Body of Knowledge.

/pdf/towards-a-body-of-knowledge-for-model-based-software-216mal0tr2.pdf

Towards a body of knowledge for model-based software engineering

Web services are open, interoperable, easy to integrate and reuse, and are extensively used in many application domains. Research and best practices have produced excellent support for developing large-scale web-based applications implementing complex business processes.

Flexibility and interoperability of web services make them well suited also for highly-customizable reactive service-based applications, that is interactive applications which serve few users, and can be rapidly adapted to new requirements and environmental conditions. This is the case, for example of personal data managers tailored to the needs of few specific users who want to adapt them to different conditions and requests. Classic development approaches that require experts of web service technologies do not well support this class of applications which call for rapid individual customization and adaptation by non-expert users.

In this paper, we present the formal framework of a model-based approach that provides expert users with the ability of rapidly building, adapting and reconfiguring reactive service-based applications according to new requirements and needs. Moreover this formal approach will presumably allow adaptations and reconfigurations by non-expert users as well. The underlying technique integrates two user-friendly, visual and executable formalisms: live sequence charts, to describe control flow, and graph transformation systems, to describe data flow and processing. Main results of the paper are the specification and semantics of the integration and early analysis techniques revealing inconsistencies.

/pdf/a-formal-framework-for-developing-adaptable-service-based-palh0414nh.pdf

Leen Lambers

Papers

Towards automatic verification of behavior preservation for model transformation via invariant checking

Negative Application Conditions for Reconfigurable Place/Transition Systems

Complete Specification Coverage in Automatically Generated Conformance Test Cases for TGG Implementations

Towards a body of knowledge for model-based software engineering

A formal framework for developing adaptable service-based applications