Invertibility of Discrete-Event Dynamic Systems

Özveren, Cüneyt M.; Willsky, Alan S.

doi:10.1007/bf02134011

Cited by 31 publications

(21 citation statements)

References 9 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…In our framework, distinguishability between states has a similar flavor (although not identical to Ramadge 1986, 0zveren andWillsky 1992). Basically, two states are said to be (backward) distinguishable if no two output trajectories terminating at the two states, respectively, have exactly the same output observation.…”

Section: Lemma 1 An Event E Is Invertible If and Only If There Exist mentioning

confidence: 98%

Distributed inversion in timed discrete event systems

Park

Chong

1995

Discrete Event Dyn Syst

View full text Add to dashboard Cite

Abstract. We consider a discrete event system (DES) modeled by a timed automaton with partial state and event observations. We view the system as an input-output system, where the input is a sequence of event lifetimes, and the output is the resulting sequence of events, states, and transition epochs. We consider the problem of extracting event lifetimes (input) from observations of the output trajectory, which we call inversion. We give necessary and sufficient conditions for invertibility, and an algorithm that extracts event lifetimes from any given output observation of an invertible system. We describe a distributed timed DES model based on the prioritized synchronous product of subsystems, and study the inversion problem in this framework. We show that invertibility in the subsystems implies invertibility in the global system. To illustrate our results, we provide an example of a tandem network.

show abstract

Section: Lemma 1 An Event E Is Invertible If and Only If There Exist mentioning

confidence: 98%

Distributed inversion in timed discrete event systems

Park

Chong

1995

Discrete Event Dyn Syst

View full text Add to dashboard Cite

show abstract

“…In the context of supervisory control, (Lin and Wonham, 1988) defines the notion of observability for system design specification that allows legal constraint being satisfied despite the fact that some events are not observable externally. With error recovery application in mind, (Ozveren and Willsky, 1992) studies the notion of invertibility of DES, where the objective is to reconstruct the full event transition sequence that has already occurred based on a partially observed output sequence. Assuming partial state information through an output function, (Caines et al, 1991) studies a state estimation problem for input-state-output automata.…”

Section: Literature Surveymentioning

confidence: 99%

System identification of discrete event systems

Chung

2004

Journal of the Chinese Institute of Engineers

View full text Add to dashboard Cite

System identification (SI) for discrete event systems (DES) addresses the issue of identifying system dynamics from externally observed sample paths. To that end, we propose a new mathematical framework in the context of a Mealy machine and language theory. Without any a priori modeling information regarding the identification target, the objective of SI is to derive minimal valid automata that duplicate the input-output relation in the observed sample paths, while ensuring minimal realization. An algorithm to compute minimal valid automata and special properties regarding SI are explained with illustrative examples.

show abstract

“…Finally, in order to derive an upperlevel model, it will be necessary to be able to use our observations to reconstruct the sequence of tasks that has been performed. This is closely related to the problem of invertibility stated in [2].…”

Section: Introductionmentioning

confidence: 91%

“…The following shows that we can capture forced events in our present context with a simple construction. Given x E X let d l(x) denote the set of forced events defined at x and let d 2 …”

Section: Forced Eventsmentioning

confidence: 99%

See 1 more Smart Citation

Aggregation and multi-level control in discrete event dynamic systems

Özveren

Willsky

Analysis and Optimization of Systes

Self Cite

View full text Add to dashboard Cite

In this paper we consider the problem of higher-level aggregate modelling and control of discrete-event dynamic systems (DEDS) modelled as finite state automata in which some events are controllable, some are observed, and some represent events to be tracked. The higher-level models considered correspond to associating specified sequences of events in the original system to single macroscopic events in the higherlevel model. We also consider the problem of designing a compensator that can be used to restrict microscopic behavior so that the system will only produce strings of these primitive sequences or tasks. With this lower level control in place we can construct higher-level models which typically have many fewer states and events than the original system. Also, motivated by applications such as flexible manufacturing, we address the problem of constructing and controlling higher-level models of interconnections of DEDS. This allows us to "slow down" the combinatorial explosion typically present in computations involving interacting automata.

show abstract

Invertibility of Discrete-Event Dynamic Systems

Cited by 31 publications

References 9 publications

Distributed inversion in timed discrete event systems

Distributed inversion in timed discrete event systems

System identification of discrete event systems

Aggregation and multi-level control in discrete event dynamic systems

Contact Info

Product

Resources

About