Validation of the finite state machine model for network simulation and a proposed testbed

Under the Cyber Army Modeling and Simulation (CyAMS) program, a model validation was conducted using data from an emulated network for malware propagation to compare against the CyAMS finite state representation of network nodes and processes using behavioral simulation. During the validation process, the finite state machine model was effective in identifying important caveats in the emulation tests. Once the experimental parameters were correctly defined, the CyAMS model and the emulated networks showed similar outcomes. The simulation in this case utilized at most 3 CPU cores, whereas the emulation approach required roughly 2,000 real computers and 14,800 virtual machines. The results highlight the possibility that simulation methods can be as effective as emulation test beds in selected cases. Further, simulation results can be an effective tool to verify the goals of emulation based experiments in some cases. Results demonstrated that several orders of magnitude of less computing resources are required for a simulation compared to emulation for this particular test case.

The paper presents an inclusion relation which is used to verify the process of controller synthesis based on incompletely specified finite state machine model. State transition graph is adopted to describe the behavior of controller. State transition graph STG_org was abstract behavior description of controller synthesis generated before synthesized and state transition graph STG_ext was reversely extracted from structure realization of controller synthesis. If STG_org contains STG_ext then corresponding process of controller synthesis was correct. The paper gives a formal verification algorithm of controller synthesis with time complexity. In order to further improve time complexity of algorithm, a verifying algorithm with synthetic information guidance was proposed.

In this study, we aimed to create a realistic model which is suitable for computerized simulation of any kind of fractures and provides reliable results. We used a plastic pelvic model to construct advanced specimens. The data were retrieved from the computed tomography scans of a healthy pelvis. A geometrically exact model by the means of three-dimensional scanning of the plastic pelvis was obtained. The material properties of the bony parts based on the data retrieved from the computed tomography scans were modified. The pelvis was divided into distinct segments and the proportion of the cortical and cancellous bone substance in each segment were determined to make the material properties accurate. In the validation of the pelvic model, a type C pelvic injury was simulated and the fracture of the sacrum and the symphyseolysis were stabilized with plates. These data were compared with those of previously performed cadaver experiments. Based on the simulation performed on the new model, the shift values between the fragments of the broken sacrum approximated the reported values of our cadaver experiments and also arising strains remained in the tolerable interval. Our new finite element pelvic model represents the pelvis more accurately than the former one. As the validation of the model was successful, it is suitable for computerized simulation of any kind of fractures offering reliable results.

Coprime factor perturbation models for closed-loop model validation techniques

In order to solve the problem of fast fault diagnosis in power system, this paper introduces a method of finite state machine model of fault reasoning for distribution system under time sequence constraints. Firstly, the concept of time sequence constraint characteristics of SOE data from the SCADA alarm window is introduced, which is crucial to judge whether the alarm sequence are from an individual fault accident. Then, by fully considers the “protection-circuit breaker” action as well as its logic, the Finite State Machine model with various system fault types was constructed. Finally, to prove the effectiveness of the method, a set of alarm data in real accident which happen in 10 kV distribution systems is applied to test the model. The result shows that the model can quickly analyze SOE data within the time interval in system accident, and effectively help the operation dispatcher to handle accident and defect elimination.

Recently, researchers have been working on cloud data assurance models to ensure that the data is in compliance with the policies. In such a model, the data is placed in the intended data centres without focusing on data residency issues. Thus, in order to solve such issues, we have proposed a framework known as the data resident storage (DRS) which is intended to achieve data residency protection, thus providing data residency as a service (DRaaS). The finite state machine model is developed for the purpose of verifying the methodology in terms of data location and data access. The validation is carried out in the CloudSim toolkit with the help of defined services. The developed test automation framework places the data only in data centres that are in compliance with data residency laws. Finally, this framework can be hosted by the cloud service provider to provide DRaaS to the end users.

While databases store information and the is the place for the gathering and distribution of information, there are inherent difficulties in linking them together. Often proprietary methods are used which compromise compatibility. This paper presents a new design and engineering model using hyperlinks for sophisticated user interaction with relational databases. The finite state machine model well known from static hyper-linked documents is remodelled to be suitable for dynamically generated hyper-links. The actual implementation of such a system is composed of several parts with potentially different techniques. The usability of Java is compared with the HTML approach. A based toolset has been implemented to generate the different applications thereby also fostering unlimited collaboration. Using this technique, two complete real-life applications have been built. The proposed techniques help to implement stable, robust, flexible, scalable and Web compliant applications with complex functionality and to provide new ways to integrate legacy systems.

Autonomous underwater vehicles (AUVs) are an indispensable tool for marine scientists to study the world's oceans. The Slocum glider is a buoyancy driven AUV designed for missions that can last weeks or even months. Although successful, its hardware and layered control architecture is rather limited and difficult to program. Due to limits in its hardware and software infrastructure, the Slocum glider is not able to change its behavior based on sensor readings while underwater. In this paper, we discuss a new programming architecture for AUVs like the Slocum. We present a new model that allows marine scientists to express AUV missions at a higher level of abstraction, leaving low-level software and hardware details to the compiler and runtime system. The Slocum glider is used as an illustration of how our programming architecture can be implemented within an existing system. The Slocum's new framework consists of an event driven, finite state machine model, a corresponding compiler and runtime system, and a hardware platform that interacts with the glider's existing hardware infrastructure. The new programming architecture is able to implement changes in glider behavior in response to sensor readings while submerged. This crucial capability will enable advanced glider behaviors such as underwater communication and swarming. Experimental results based on simulation and actual glider deployments off the coast of New Jersey show the expressiveness and effectiveness of our prototype implementation.

In distributed systems, a group of multiple processes are cooperating with each other by exchanging messages in networks. A process is considered to be a sequence of events in a finite state machine model. Here, it is significant to decide on which event causally precedes another event for a pair of events in a system. In the famous happened-before relation among events, events are ordered on the basis of send-receive semantics of messages exchanged in networks. In this paper, we discuss a peer-to-peer (P2P) model of a publish/subscribe (P2PPS) system where application events are subscribed, published, and notified by peer process (peers). We discuss the causal dependency of application events in terms of subscription, publication, and notification semantics.

Situation-awareness is a desirable feature of application software systems in mobile computing environments. In this paper, we present an extended finite state machine model for the situation-aware mobile application software systems. In this model, each state represents an impromptu condition that a system is presented, and the state is characterized by the historical context record and the internal action record. Each state transition in the model represents a context input. The whole finite state machine models the dynamicity of the situation-aware application software system that adjusts its own behavior according to the situation changes. The situation-aware requirement is application-specific, and each situation-aware requirement is corresponding to an FSM. This model is useful in the mobile application software development: it can be used to verify the validness of the situation-aware requirement; it can be used to generate test cases that represent the situation changes a system may experience in a mobile environment.

This paper presents a component-based modeling technique for systems with continuous and discrete dynamics. It uses hierarchical composition to hide the implementation details of one component from other components, and keeps the components at the same level of hierarchy interacting under a well-defined model of computation. Continuous time, discrete event, and finite state machine models are considered. The signal conversions at the boundaries and the execution control among the components are studied. The modeling technique is implemented in Ptolemy II, a heterogeneous modeling and design environment. A hierarchical helicopter control system is modeled as an example.

This paper considers the interrelationships between knowledge-based security, concurrency and recoverability in on-line database transaction processing systems (OLTP). It describes how OLTP can permit the users to carry out the desired actions, and concurrently activate scrutinizing transactions that identify the users with respect to their biometrical or other characteristics stored in a secure knowledge database. A finite state machine model is used to design protocols for recovery, under security breaches. It is shown that the best way to achieve concurrency and recovery is through shadowing and strict scheduling in conjunction with certification locking or timestamping. One must, however, bear in mind that security and concurrency have conflicting requirements and at best one can only achieve a compromise between them.

This paper presents a framework of multi-model based approach for interconnected components network by finite state machine model. The main concept on which we base our approach is the fact that, in a context of interconnected components, due to the influence of some components named here key-components the system can switch from one mode to another. The influence of these components can be measured by the level of involvement in the switching events. The proposed approach can be applied to embedded systems in which we propose to consider the controller as a part of the system.

Mutation Testing originated from a classical method for digital circuit testing and today is used at program and specification levels. It can be used either to generate or to assess the quality of test sets. In spite of being very effective in detecting faults, Mutation Testing is usually considered a high cost criterion due to: i) the large number of generated mutants; ii) the time-consuming activity of determining equivalent mutants; and iii) the mutant execution time. Many initiatives aiming at reducing the Mutation Testing application cost have been conducted, most of them addressing one of the drawbacks mentioned above. In this paper, we identify and summarize some of the most relevant researches and results related to Mutation Testing cost reduction, e.g., Constrained-Mutation, Constraint-Based Testing and Bayesian Learning. Moreover, we propose a Mutation Testing process, named Muta-Pro, that synergetically integrates the related approaches and mechanisms. This process is intended to be incremental and tailorable to a specific application domain such as C programs or finite state machine models. The main ideas in this paper are illustrated using a UNIX utility program. This process is being integrated in a Mutation Testing environment, based on the authors' previous experience on implementing the Proteum Family tools, aiming at promoting the technology transfer to industry and providing the basis for improving the Muta-Pro process itself.

A communication protocol is first presented as a set of rules that determine the behaviour of a communication system in terms of the exchange of messages between communication entities. Then a protocol is also described as an artificial language which specifies this behaviour. The concepts of the abstract and the transfer syntax of protocol messages are explained and the importance of the rules for the behaviour of protocol entities is emphasised. The difference between informal and formal specification is explained, and the importance of the formal description techniques to assure nonambiguous specifications is emphasised. The basic techniques for informal and formal specification are presented. The difference between the functionality specifications that are based on the finite state machine model, and those which are based on process algebras, is pointed out. Then some of the most important formal languages are overviewed: ACT ONE and ASN.1 for message specification, SDL, Estelle and LOTOS for protocol specification, and also UML, MSC and TTCN for communication protocols design. The chapter contains five figures.