In many real systems in which a state variable should be controlled for being in appropriate range, the length of control (review) intervals is taken to be constant. In such systems, when the cost of reviews and out-of-range values of the state variable are considerable, this method may not be optimal. In this paper we let the length of review intervals to be variable during each operating cycl...

in many real systems in which a state variable should be controlled for being in appropriate range, the length of control (review) intervals is taken to be constant. in such systems, when the cost of reviews and out-of-range values of the state variable are considerable, this method may not be optimal. in this paper we let the length of review intervals to be variable during each operating cycl...

This paper describes an approach for compositional nonblocking verification of discrete event systems modelled as extended finite-state machines (EFSM). Previous results about finite-state machines in lock-step synchronisation are generalised and applied to EFSMs communicating via shared variables. This gives rise to an EFSM-based conflict check algorithm that composes EFSMs gradually and parti...

Some recursive function techniques for describing large-scale compositional state machines encountered in computer engineering.

Abstraction is a powerful form of domain knowledge that allows reinforcement-learning agents to cope with complex environments, but in most cases a human must supply this knowledge. In the absence of such prior knowledge or a given model, we propose an algorithm for the automatic discovery of state abstraction from policies learned in one domain for use in other domains that have similar struct...