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

Evaluation of the changes in working limits in an automobile assembly line using simulation

The aim of the work presented in this paper consists of the development of a decision-making support system, based on discrete-event simulation models, of an automobile assembly line which was implemented within an Arena simulation environment and focused at a very specific class of production lines with a four closed-loop network configuration. This layout system reflects one of the most common configurations of automobile assembly and preassembly lines formed by conveyors. The sum of the number of pallets on the intermediate buffers, remains constant, except for the fourth closed-loop, which depends on the four-door car ratio (x) implemented between the door disassembly and assembly stations of the car body. Some governing equations of the four closed-loops are not compatible with the capacities of several intermediate buffers for certain values of variable x. This incompatibility shows how the assembly line cannot operate in practice for x0,97 in a stationary regime, due to the starvation phenomenon or the failure of supply to the machines on the production line. We have evaluated the impact of the pallet numbers circulating on the first closed-loop on the performance of the production line, translated into the number of cars produced/hour, in order to improve the availability of the entire manufacturing system for any value of x. Until the present date, these facts have not been presented in specialized literature. © 2012 American Institute of Physics

Generalised verification of the observer property in discrete event systems

The observer property is an important condition to be satisfied by abstractions of Discrete Event Systems (DES) models. This paper presents a generalised version of a previous algorithm which tests if an abstraction of a DES obtained through natural projection has the observer property. The procedure called OP-verifier II overcomes the limitations of the previously proposed verifier while keeping its computational complexity. Results are illustrated by a case study of a transfer line system

Unprovability of the Logical Characterization of Bisimulation

We quickly review labelled Markov processes (LMP) and provide a counterexample showing that in general measurable spaces, event bisimilarity and state bisimilarity differ in LMP. This shows that the logic in Desharnais [*] does not characterize state bisimulation in non-analytic measurable spaces. Furthermore we show that, under current foundations of Mathematics, such logical characterization is unprovable for spaces that are projections of a coanalytic set. Underlying this construction there is a proof that stationary Markov processes over general measurable spaces do not have semi-pullbacks. ([*] J. Desharnais, Labelled Markov Processes. School of Computer Science. McGill University, Montr\'eal (1999))Comment: Extended introduction and comments; extra section on semi-pullbacks; 11 pages Some background details added; extra example on the non-locality of state bisimilarity; 14 page