34,534 research outputs found
On Conditional Decomposability
The requirement of a language to be conditionally decomposable is imposed on
a specification language in the coordination supervisory control framework of
discrete-event systems. In this paper, we present a polynomial-time algorithm
for the verification whether a language is conditionally decomposable with
respect to given alphabets. Moreover, we also present a polynomial-time
algorithm to extend the common alphabet so that the language becomes
conditionally decomposable. A relationship of conditional decomposability to
nonblockingness of modular discrete-event systems is also discussed in this
paper in the general settings. It is shown that conditional decomposability is
a weaker condition than nonblockingness.Comment: A few minor correction
Physical and neural entrainment to rhythm: human sensorimotor coordination across tasks and effector systems.
The human sensorimotor system can be readily entrained to environmental rhythms, through multiple sensory modalities. In this review, we provide an overview of theories of timekeeping that make this neuroentrainment possible. First, we present recent evidence that contests the assumptions made in classic timekeeper models. The role of state estimation, sensory feedback and movement parameters on the organization of sensorimotor timing are discussed in the context of recent experiments that examined simultaneous timing and force control. This discussion is extended to the study of coordinated multi-effector movements and how they may be entrained
Modular nonblocking verification using conflict equivalence
This paper proposes a modular approach to verifying
whether a large discrete event system is nonconflicting.
The new approach avoids computing the synchronous
product of a large set of finite-state machines. Instead, the
synchronous product is computed gradually, and intermediate
results are simplified using conflict-preserving abstractions
based on process-algebraic results about fair testing. Heuristics
are used to choose between different possible abstractions.
Experimental results show that the method is applicable to
finite-state machine models of industrial scale and brings
considerable improvements in performance over other methods
On the use of observation equivalence in synthesis abstraction
In a previous paper we introduced the notion of synthesis abstraction, which allows efficient compositional synthesis of maximally permissive supervisors for large-scale systems of composed finite-state automata. In the current paper, observation equivalence is studied in relation to synthesis abstraction. It is shown that general observation equivalence is not useful for synthesis abstraction. Instead, we introduce additional conditions strengthening observation equivalence, so that it can be used with the compositional synthesis method. The paper concludes with an example showing the suitability of these relations to achieve substantial state reduction while computing a modular supervisor
- …