Modeling admissible behavior using event signals

We describe here how to obtain a model for the admissible behavior of a discrete event system that is represented by a safe Petri net (PN) model. The transitions of this PN model may be controllable or uncontrollable. Also given is a sequential specification which is modeled with a special state machine. Then, using the condition and event arcs of net condition/event systems, a combined model of plant and specification is obtained. We use only the structure of this combined model to develop a method which gives the admissible behavior of the system. Thus, we avoid the complexity of a complete state enumeration.     

并发构件中冲突的解决方案

本文研究如何解决构件并发访问时所产生的冲突问题，我们提出一种基于构件说明的冲突处理方案，首先讨论如何恰当地抽象描述一个构件的外部特性，然后我们利用数据依赖分析技术和包裹技术对冲突进行处理。     

Automated construction of fuzzy event sets and its application toactive databases

Fuzzy sets and fuzzy logic research aims to bridge the gap between the crisp world of maths and the real world. Fuzzy set theory was applied to many different areas, from control to databases. Sometimes the number of events in an event-driven system may become very high and unmanageable. Therefore, it is very useful to organize the events into fuzzy event sets also introducing the benefits of fuzzy set theory. All the events that have occurred in a system can be stored in event histories which contain precious hidden information. We propose a method for automated construction of fuzzy event sets out of event histories via data mining techniques. The useful information hidden in the event history is extracted into a matrix called sequential proximity matrix. This matrix shows the proximities of events and it is used for fuzzy rule execution via similarity based event detection and construction of fuzzy event sets. Our application platform is active databases. We describe how fuzzy event sets can be exploited for similarity based event detection and fuzzy rule execution in active database systems     

Detection of metamorphic and virtualization-based malware using algebraic specification

We present an overview of the latest developments in the detection of metamorphic and virtualization-based malware using an algebraic specification of the Intel 64 assembly programming language. After giving an overview of related work, we describe the development of a specification of a subset of the Intel 64 instruction set in Maude, an advanced formal algebraic specification tool. We develop the technique of metamorphic malware detection based on equivalence-in-context so that it is applicable to imperative programming languages in general, and we give two detailed examples of how this might be used in a practical setting to detect metamorphic malware. We discuss the application of these techniques within anti-virus software, and give a proof-of-concept system for defeating detection counter-measures used by virtualization-based malware, which is based on our Maude specification of Intel 64. Finally, we compare formal and informal approaches to malware detection, and give some directions for future research.     

Formalization and validation of the General Inter-ORB Protocol (GIOP) using PROMELA and SPIN

The General Inter-Orb Protocol (GIOP) is a key component of the Common Object Request Broker Architecture (CORBA) specification. We present the formal modeling and validation of the GIOP protocol using the Promela language, Linear Time Temporal Logic (LTL) and the Spin model checker. We validate the Promela model using ten high-level requirements which we elicit from the informal CORBA specification. These requirements are then formalized in LTL and the Spin model checker is used to determine their validity. During the validation process we discovered a few problems in GIOP: a potential transport-layer interface deadlock and problems with the server migration protocol. We also describe how property specification patterns helped us in formalizing the high-level requirements that we have elicited.     

可复用构件表示模型研究

依据AND－CASE环境对软件构件的要求,提出可复用构件表示模型,将刻面法和规格说明相结合的综合刻面法描述构件库中的构件,以兼顾刻画法的灵活易用性和规格说明的规范性,并将其应用于AND－CASE环境,有效实施内建层次词典检索有多种形式的构件匹配。     

QuePED: Revisiting queueing networks for the performance evaluation of database designs

Databases form the common component of many software systems. However, performance models specifically targeted at the database design have not been extensively studied. In this paper, we propose QuePED – a queueing network performance evaluation model for database designs. QuePED provides for the performance modelling of database design constructs, including active database rules; thus, deviating from current methods that consider database designs as processing demands on the hardware architecture. We present a formal specification of QuePED and describe its application to database designs. Experimental evaluation has shown the ability of QuePED to capture the steady state performance of an implementation of the TPC-C benchmark.     

Modelling concurrent interactions

In UML 2.0 sequence diagrams have been considerably extended but their expressiveness and semantics remains problematic in several ways. In other work we have shown how sequence diagrams combined with an OCL liveness template gives us a much richer language for inter-object behaviour specification. In this paper, we give a semantics of these enriched diagrams using labelled event structures. Further, we show how sequence diagrams can be embedded into a true-concurrent two-level logic interpreted over labelled event structures. The top level logic, called communication logic, is used to describe inter-object specification, whereas the lower level logic, called home logic, describes intra-object behaviour. An interesting consequence of using this logic relates to how state-based behaviour can be synthesised from inter-object specifications. Plans of extending the Edinburgh Concurrency Workbench in this context are discussed.     

Analysis of dependencies in advanced transaction models

Transactional dependencies play an important role in coordinating and executing the subtransactions in advanced transaction processing models, such as, nested transactions and workflow transactions. Researchers have formalized the notion of transactional dependencies and have shown how various advanced transaction models can be expressed using different kinds of dependencies. Incorrect specification of dependencies can result in unpredictable behavior of the advanced transaction, which, in turn, can lead to unavailability of resources and information integrity problems. In this work, we focus on how to correctly specify dependencies in an advanced transaction. We enumerate the different kinds of dependencies that may be present in an advanced transaction and classify them into two broad categories: event ordering and event enforcement dependencies. Different event ordering and event enforcement dependencies in an advanced transaction often interact in subtle ways resulting in conflicts and redundancies. We describe the different types of conflicts that can arise due to the presence of multiple dependencies and describe how one can detect such conflicts. An advanced transaction may also contain redundant dependencies—these are dependencies that can be logically derived from other dependencies. We show how such extraneous dependencies can be eliminated to get an equivalent set of dependencies that has the same effect as the original set. Our dependency analysis is done in the context of a generalized advanced transaction model that is capable of expressing different kinds of advanced transactions. Recommended by: Amit Sheth     

Paradigm as Organization-Oriented Coordination Language

Global component behaviours as distinguished in Paradigm, offer the ingredients for specifying inter-component coordination in separation from and consistent with detailed component behaviour. The paper discusses how global behaviours provide great flexibility in arranging computation as well as coordination. In the context of a mediating example we plea for taking such flexibility as an organizational, organic, human-like characteristic; good to have, but usually absent in system specification. In addition, we point out how Paradigm's flexibility fits well in the historical perspective of discrete event simulation, modeling, object-orientation and patterns.     

An Event Algebra Extension of the Triggering Mechanism in a Component Model for Embedded Systems

In this article we present how the component triggering in SaveCCM, a component model intended for embedded vehicular systems, can be extended by means of an event algebra. The extension allows components to be triggered by complex event patterns, and not only by clock signals or single external events.Separating the detection of triggering conditions from the definition of the triggered services permits more general components and thus improves component reusability. Providing event detection mechanisms within the component model means that triggering conditions are explicitly available for system analysis at design time.An event algebra is used to define the complex triggering conditions. This algebra has a relatively simple declarative semantics and well documented algebraic properties, which facilitates formal and informal reasoning about the system. The algebra also ensures that detection of triggering conditions can be efficiently implemented with limited resources, which is critical in embedded applications.     

Pattern-based event detection in sensor networks

Many applications of wireless sensor networks monitor the physical world and report events of interest. To facilitate event detection in these applications, in this paper we propose a pattern-based event detection approach and integrate the approach into an in-network sensor query processing framework. Different from existing threshold-based event detection, we abstract events into patterns in sensory data and convert the problem of event detection into a pattern matching problem. We focus on applying single-node temporal patterns, and define the general patterns as well as five types of basic patterns for event specification. Considering the limited storage on sensor nodes, we design an on-node cache manager to maintain the historical data required for pattern matching and develop event-driven processing techniques for queries in our framework. We have conducted experiments using patterns for events that are extracted from real-world datasets. The results demonstrate the effectiveness and efficiency of our approach.     

Using a Discrete-Event System Specifications (DEVS) for designing a Modelica compiler

We introduce a new architecture for the design of a tool for modeling and simulation of continuous and hybrid systems. The environment includes a compiler based on Modelica, a modular and a causal standard specification language for physical systems modeling (the tool supports models composed using certain component classes defined in the Modelica Standard Library, and the instantiation, parameterization and connection of these MSL components are described using a subset of Modelica). Models are defined in Modelica and are translated into DEVS models. DEVS theory (originally defined for modeling and simulation of discrete event systems) was extended in order to permit defining these of models. The different steps in the compiling process are show, including how to model these dynamic systems under the discrete event abstraction, including examples of model simulation with their execution results.     

基于构件设计的正确性验证

本文研究基于构件设计的正确性问题,我们首先建立一个构件描述的模型：（１）接口：通过对ＣＯＲＢＡ的ＩＤＬ进行扩展,使其能够在构件的接口中同时描述构件的语法和语义信息,（２）实现,通过引入一个简单的程序模型,阐述如何利用子构造一个新的构件,然后我们考虑如何将构件的接口和实现联系起来,利用Ｈｏａｒｅ逻辑,验证一个构件的实现是否满足其接口中所给出的语义要求。     

用UML描述组件规格说明

在基于组件的软件开放方式（CBD）下，软件系统是一些盯互联系的可重用组件的集合，因此需要对系统的每一个组件以及组件之间的相互关系有很好的理解。UML作为一种标准建模语言，不仅可以支持面向对象的分析与设计，而且能够有力地支持从需求分析开始的软件开发全过程。但是UML对组件建模的支持并不理想，这就需要开发一种能很好支持组件建模的方法。本文提出一种用UML描述组件规格说明的方法。将组件规格说明分解成组件接口规格说明。通过对组件的每个接口和组件接口之间的相互关系加以形式描述，从而达到组件规格说明的清晰性和精确性。     

An Experiment in Program Composition and Proof

This paper explores a compositional approach to program specification, development and proof. We apply a theory of composition to a problem in distributed computing with the goal of understanding the strengths and weaknesses of this compositional approach. First, we describe the theory briefly. Then we give a specification of a desired system. Next, we propose a design of the desired system as a composition of components and prove its correctness. Finally, we show how the proof can be reused for a slightly different compositional structure by using the concept of observation.     

基于服务模式规约的构件剪裁

构件剪裁是一种高效的提高构件可用性的方法,但是如何实施有效的构件剪裁一直是研究中的难点.对构件功能逻辑的准确理解有助于实施有效的构件剪裁.基于此,首先从构件提供者角度依据构件接口中方法间的关联性分析,给出了服务模式的概念和构件的服务模式规约.接着基于构件的服务模式规约,提供了一种便于使用者验证构件剪裁有效性的算法.最后结合详细的示例分析了算法的可行性.     

DEVS methodology for evaluating time-constrained message routing policies

Due to its ability to support temporal issues of systems, discrete event simulation is widely applicable to real-time system design. This paper presents a methodology for the modeling and simulation of time-constrained message routing policies for hypercube interconnected real-time systems. The methodology is based on a framework called the DEVS (discrete event systems specification) formalism which supports modular and hierarchical specification of discrete event models. Within the methodology, we first develop DEVS specification for models for hypercube computers and experimental frames to measure the performance of alternative message routing policies. We then implement such specification in DEVSIM++, a C++-based modeling/simulation environment that implements the DEVS formalism. Simulations of various message routing policies are performed, and the performances of such policies are compared.     

Encouraging contributions in learning networks using incentive mechanisms

Abstract We investigate incentive mechanisms to increase active participation in Learning Networks (LNs). The LN under study is LN4LD, an LN for the exchange of information about the IMS Learning Design specification. We examine how to encourage learners in LN4LD to contribute their knowledge, and whether incentive mechanisms can increase the level of active participation. We describe an incentive mechanism based on constructivist principles and Social Exchange Theory, and experimentation using the mechanism designed to increase the level of active participation. The incentive mechanism allows individual learners to gain personal access to additional information through the accumulation of points earned by making contributions. Repeated measurements according to a simple interrupted time series with removal design show that the level of participation was indeed increased by the introduction of the reward system. It can therefore be considered worthwhile to use incentive mechanisms in LNs.