An algorithm for weak synthesis observation equivalence for compositional supervisor synthesis

This paper proposes an algorithm to simplify automata in such a way that compositional synthesis results are preserved in every possible context. It relaxes some requirements of synthesis observation equivalence from previous work, so that better abstractions can be obtained. The paper describes the algorithm, adapted from known bisimulation equivalence algorithms, for the improved abstraction method. The algorithm has been implemented in the DES software tool Supremica and has been used to compute modular supervisors for several large benchmark examples. It successfully computes modular supervisors for systems with more than 1012 reachable states

Conflicts and projections

This paper studies abstraction methods suitable to verify very large models of discrete-event systems to be nonconflicting. It compares the observer property to methods known from process algebra, namely to conflict equivalence and observation equivalence. The observer property is shown to be the property that corresponds to conflict equivalence in the case where natural projection is used for abstraction. In this case, the observer property turns out to be the least restrictive condition that can be imposed on natural projection to enable compositional reasoning about conflicts. The observer property is also shown to be closely related to observation equivalence. Several examples and propositions are presented to relate different aspects of these methods of abstraction

Hierarchical interface-based supervisory control using the conflict preorder

Hierarchical Interface-Based Supervisory Control decomposes a large discrete event system into subsystems linked to each other by interfaces, facilitating the design of complex systems and the re-use of components. By ensuring that each subsystem satisfies its interface consistency conditions locally, it can be ensured that the complete system is controllable and nonblocking. The interface consistency conditions proposed in this paper are based on the conflict preorder, providing increased flexibility over previous approaches. The framework requires only a small number of interface consistency conditions, and allows for the design of multi-level hierarchies that are provably controllable and nonblocking

Three detailed fluctuation theorems

The total entropy production of a trajectory can be split into an adiabatic and a non-adiabatic contribution, deriving respectively from the breaking of detailed balance via nonequilibrium boundary conditions or by external driving. We show that each of them, the total, the adiabatic and the non-adiabatic trajectory entropy, separately satisfies a detailed fluctuation theorem.Comment: 4 pages, V2: accepted in Phys. Rev. Lett. 104, 090601 (2010

A distributed cooperative control scheme with optimal priority assignment and stability assessment

International audienceIn this paper, a distributed partially cooperative control framework is proposed for a network of linear interconnected subsystems. It is assumed that each subsystem in the network possesses its own objective and a corresponding nominal interaction-free state feedback law. The proposed framework enables each subsystem to compute an additional control term in order to help maintaining the integrity of the overall network. As this cooperation-like behavior involves relative priority assignment, a communication aware heuristic is proposed with an associated stability assessment that is based on the closed-loop network matrix's spectrum monitoring. Illustrative examples are used to assess the effectiveness of the proposed scheme including a distributed load frequency problem

Detailed Balance and Intermediate Statistics

We present a theory of particles, obeying intermediate statistics ("anyons"), interpolating between Bosons and Fermions, based on the principle of Detailed Balance. It is demonstrated that the scattering probabilities of identical particles can be expressed in terms of the basic numbers, which arise naturally and logically in this theory. A transcendental equation determining the distribution function of anyons is obtained in terms of the statistics parameter, whose limiting values 0 and 1 correspond to Bosons and Fermions respectively. The distribution function is determined as a power series involving the Boltzmann factor and the statistics parameter and we also express the distribution function as an infinite continued fraction. The last form enables one to develop approximate forms for the distribution function, with the first approximant agreeing with our earlier investigation.Comment: 13 pages, RevTex, submitted for publication; added references; added sentence