In this paper we consider the following task: given an abstract state machine, characterize the subsets of initial values corresponding to different typical scenarios of the system behavior. In order to solve it we suggest formalization of the notion of scenario and then discuss possible approaches to the classification of the computations.

In this paper, we consider constrained noncooperativeN -person stochastic games with discounted cost criteria. The state space is assumed to be countable and the action sets are compact metric spaces. We present three main results. The first concerns the sensitivity or approximation of constrained games. The second shows the existence of Nash equilibria for constrained games with a finite state...

Various possibilities to support the automated construction of state diagrams of the OMT method are considered. The proposed facilities are planned to be included in a prototype environment whose basic components are editors for scenarios and state diagrams. The considered support covers automatic means for synthesizing a state diagram on the basis of scenarios, for making the state diagramas c...

Using representation theory, we obtain a necessary and sufficient condition for a discrete–time Markov chain on a finite state space E to be representable as ΨnΨn−1 · · ·Ψ1z, n ≥ 0, for any z ∈ E, where the Ψi are independent, identically distributed random permutations taking values in some given transitive group of permutations on E. The condition is particularly simple when the group is 2-tr...

In this paper, we propose a diagnostic method for the case where the system specification (implementation) is given in the form of two communicating finite state machines (CFSMs). The method decides if it is possible to locate the faulty machine in the system, once a fault has been detected in its corresponding implementation. If this is possible, it also locates the faulty machine. Two simple ...

Though there has been nearly three decades of work on program slicing, there has been comparatively little work on slicing for state machines. One of the primary challenges that currently presents a barrier to wider application of state machine slicing is the problem of determining control dependence. We survey existing related definitions, introducing a new definition that subsumes one and ext...

This paper presents a method for design enforcement, based on a combination of reeection and State Machine Diagrams. The method is supported by RECOS, a REEective system in a Concurrent Object-oriented environment that uses Finite State Diagrams. The reeection methodology is now a developing branch in computer science for controlling and modifying systems, particularly Object-Oriented systems. ...

Trust model is an important component of gird security model and can be classified as mission-unaware identity trust model, mission-aware identity trust model, mission-unaware behavior trust model and mission-aware behavior trust model. All of them could be regarded as projections of mission-aware behavior trust model, by which authorization depends on not only the trust but also the cost and q...