We consider the problem of inferring the local transition functions of discrete dynamical systems from observed behavior. Our focus is on synchronous systems whose local transition functions are threshold functions. We assume that the topology of the system is known and that the goal is to infer a threshold value for each node so that the system produces the observed behavior. We show that some...

This methodological paper presents a novel approach to predict operator’s mechanical exposure and fatigue accumulation in discrete event simulations. A biomechanical model of work-cycle loading is combined with a discrete event simulation model which provides work cycle patterns over the shift resulting in a load-time trace for the entire shift. This trace was tested with four different muscle ...

In this paper, we propose a framework to analyze Markov reward models, which are commonly used in system performability analysis. The framework builds on a set of analytical tools developed for a class of stochastic processes referred to as Stochastic Hybrid Systems (SHS). The state space of an SHS is comprised of: i) a discrete state that describes the possible configurations/modes that a syst...

Due to the increasing complexity of reactive systems, testing has become an important part in the process of the development of such systems. Conformance testing with formal methods refers to checking functional correctness, by means of testing, of a black-box system under test with respect to a formal system specification, i.e., a specification given in a language with a formal semantics. In t...

We propose a 2-dimensional cellular automaton model to simulate pedestrian traffic. It is a vmax = 1 model with exclusion statistics and parallel dynamics. Long-range interactions between the pedestrians are mediated by a so called floor field which modifies the transition rates to neighbouring cells. This field, which can be discrete or continuous, is subject to diffusion and decay. Furthermor...

Cellular Automata is a discrete dynamical system that can be completely described in terms of local relation. For any given image, the system can save its features as well as increase or decrease the brightness of it locally through consideration of optimized transition in succession. These transitions in succession satisfy the function "Lyapunov" and have sequential movements. This study sugge...

In this paper, we propose a framework to analyze Markov reward models, which are commonly used in system performability analysis. The framework builds on a set of analytical tools developed for a class of stochastic processes referred to as Stochastic Hybrid Systems (SHS). The state space of an SHS is comprised of: i) a discrete state that describes the possible configurations/modes that a syst...

Abstract Tutte's spring embedding theorem states that, for a three-connected planar graph, if the outer face of graph is fixed as complement some convex region in plane, and all other vertices are placed at mass center their neighbors, then this results unique embedding, planar. It also follows fairly quickly that minimizes sum squared edge lengths, conditional on face. However, it not clear ho...

In this article we are going to trace the transition of modal verbs into epistemic adverbs. This development found in nearly all European languages will be analysed on the basis of Russian možet (byt’) which goes back to the third person singular present tense of the modal verb moč’ plus infinitive. In our study we shall focus on the constructional aspects of this language change with the aim t...

There are several methods of describing systems in a modular fashion. These descriptions may represent a system in one of several ways, for example in a text form or as a graph. By using a modular representation, a large system can be split into multiple smaller sections, which can make operations such as verification of a system simpler and quicker. Multiple methods of designing asynchronous c...