Enterprise model verification and validation : an approach

This article presents a verification and validation approach which is used here in order to complete the classical tool box the industrial user may utilize in enterprise modeling and integration domain. This approach, which has been defined independently from any application domain is based on several formal concepts and tools presented in this paper. These concepts are property concepts, property reference matrix, properties graphs, enterprise modeling domain ontology, conceptual graphs and formal reasoning mechanisms

Finite State Automata As Conceptual Model for e-Service

Recently, a plethora of languages for modeling and specifying different facets of e-Services have been proposed, and some of them provide constructs for representing time. Time is needed in many contexts to correctly capture the dynamics of transactions and of composability between e-Services. However, to the best of our knowledge, all the proposed languages for representing e-Service behavior and temporal constraints lack both a clear semantics and an underlying conceptual model. In this paper, we propose a conceptual representation of e-Service behavior, taking time constraints into account, and a new XML-based language, namely WSTL (WEB SERVICE TRANSITION LANGUAGE), that integrates well with standard languages in order to completely specify e-Services. In particular, WSTL allows for specifying an e-Service starting from its conceptual representation, in a straightforward way

Open architectures for formal reasoning and deductive technologies for software development

The objective of this project is to develop an open architecture for formal reasoning systems. One goal is to provide a framework with a clear semantic basis for specification and instantiation of generic components; construction of complex systems by interconnecting components; and for making incremental improvements and tailoring to specific applications. Another goal is to develop methods for specifying component interfaces and interactions to facilitate use of existing and newly built systems as 'off the shelf' components, thus helping bridge the gap between producers and consumers of reasoning systems. In this report we summarize results in several areas: our data base of reasoning systems; a theory of binding structures; a theory of components of open systems; a framework for specifying components of open reasoning system; and an analysis of the integration of rewriting and linear arithmetic modules in Boyer-Moore using the above framework

Two-sorted metric temporal logic

AbstractTemporal logic has been successfully used for modeling and analyzing the behavior of reactive and concurrent systems. Standard temporal logic is inadequate for real-time applications because it only deals with qualitative timing properties. This is overcome by metric temporal logics which offer a uniform logical framework in which both qualitative and quantitative timing properties can be expressed by making use of a parameterized operator of relative temporal realization.In this paper we deal with completeness issues for basic systems of metric temporal logic —despite their relevance, such issues have been ignored or only partially addressed in the literature. We view metric temporal logics as two-sorted formalisms having formulae ranging over time instants and parameters ranging over an (ordered) abelian group of temporal displacements. We first provide an axiomatization of the pure metric fragment of the logic, and prove its soundness and completeness. Then, we show how to obtain the metric temporal logic of linear orders by adding an ordering over displacements. Finally, we consider general metric temporal logics allowing quantification over algebraic variables and free mixing of algebraic formulae and temporal propositional symbols

Towards a verified transformation from AADL to the formal component-based language FIACRE

International audienceDuring the last decade, aadl  is an emerging architecture description languages addressing the modeling of embedded systems. Several research projects have shown that aadl  concepts are well suited to the design of embedded systems. Moreover, aadl  has a precise execution model which has proved to be one key feature for effective early analysis. In this paper, we are concerned with the foundational aspects of the verification support for aadl. More precisely, we propose a verification toolchain for aadl  models through its transformation to the Fiacre language which is the pivot verification language of the TOPCASED project: high level models can be transformed to Fiacre  models and then model-checked. Then, we investigate how to prove the correctness of the transformation from AADL into Fiacre and present related elementary ingredients: the semantics of aadl  and Fiacre  subsets expressed in a common framework, namely timed transition systems. We also briefly discuss experimental validation of the work

From AADL to Timed Abstract State Machines: A Verified Model Transformation

International audienceArchitecture Analysis and Design Language (AADL) is an architecture description language standard for embedded real-time systems widely used in the avionics and aerospace industry to model safety-critical applications. To verify and analyze the AADL models, model transformation technologies are often used to automatically extract a formal specification suitable for analysis and verification. In this process, it remains a challenge to prove that the model transformation preserves the semantics of the initial AADL model or, at least, some of the specific properties or requirements it needs to satisfy. This paper presents a machine checked semantics-preserving transformation of a subset of AADL (including periodic threads, data port communications, mode changes, and the AADL behavior annex) into Timed Abstract State Machines (TASM). The AADL standard itself lacks at present a formal semantics to make this translation validation possible. Our contribution is to bridge this gap by providing two formal semantics for the subset of AADL. The execution semantics provided by the AADL standard is formalized as Timed Transition Systems (TTS). This formalization gives a reference expression of AADL semantics which can be compared with the TASM-based translation (for verification purpose). Finally, the verified transformation is mechanized in the theorem prover Coq

Study on application possibilities of Case-Based Reasoning on the domain of scheduling problems

Ces travaux concernent la mise en place d'un système d'aide à la décision, s'appuyant sur le raisonnement à partir de cas, pour la modélisation et la résolution des problèmes d'ordonnancement en génie des procédés. Une analyse de co-citation a été exécutée afin d'extraire de la littérature la connaissance nécessaire à la construction de la stratégie d'aide à la décision et d'obtenir une image de la situation, de l'évolution et de l'intensité de la recherche du domaine des problèmes d'ordonnancement. Un système de classification a été proposée, et la nomenclature proposée par Blazewicz et al. (2007) a été étendue de manière à pouvoir caractériser de manière complète les problèmes d'ordonnancement et leur mode de résolution. Les difficultés d'adaptation du modèle ont été discutées, et l'efficacité des quatre modèles de littérature a été comparée sur trois exemples de flow-shop. Une stratégie de résolution est proposée en fonction des caractéristiques du problème mathématique. ABSTRACT : The purpose of this study is to work out the foundations of a decision-support system in order to advise efficient resolution strategies for scheduling problems in process engineering. This decision-support system is based on Case-Based Reasoning. A bibliographic study based on co-citation analysis has been performed in order to extract knowledge from the literature and obtain a landscape about scheduling research, its intensity and evolution. An open classification scheme has been proposed to scheduling problems, mathematical models and solving methods. A notation scheme corresponding to the classification has been elaborated based on the nomenclature proposed by Blazewicz et al. (2007). The difficulties arising during the adaptation of a mathematical model to different problems is discussed, and the performances of four literature mathematical models have been compared on three flow-shop examples. A resolution strategy is proposed based on the characteristics of the scheduling problem

Using simulation techniques to prove timing properties

Thesis (M.S.)--Massachusetts Institute of Technology, Dept. of Electrical Engineering and Computer Science, 1995.Includes bibliographical references (p. 151-160).by Victor Luchangco.M.S