Results 221 to 230 of about 82,736 (265)
Some of the next articles are maybe not open access.
Modeling a System with Discrete Events
2012 Sixth UKSim/AMSS European Symposium on Computer Modeling and Simulation, 2012The goal of this paper is to differentiate and apply the idiosyncratic and significant characteristics of the structuring and formalization of systems of discrete events in a methodological approach to the building of discrete imitational models. This approach is based on studying the particular system, beginning with a general overview and then ...
Stoyan N. Kapralov, Valentina Dyankova
openaire +1 more source
Discrete-event dynamic systems
IEEE Transactions on Control Systems Technology, 1999The supervisory control theory of discrete-event dynamic systems (DEDS), first introduced by Ramadge and Wonham, is based on an automata concept. Given a process, the objective of this theory is to design a supervisor in such a way that the process coupled with the supervisor behaves according to various constraints.
François Charbonnier +2 more
openaire +1 more source
Identification in discrete event systems
SMC'98 Conference Proceedings. 1998 IEEE International Conference on Systems, Man, and Cybernetics (Cat. No.98CH36218), 2002This paper presents a method to identify discrete event systems (DES) using interpreted Petri nets (IPN). The approach herein proposed works online with the system and has two main steps. In the first step, the algorithm advances finding out new places, transitions and arcs, all of them are obtained using input-output information.
Maria Elena Meda-Campaña +2 more
openaire +1 more source
On relative coobservability of discrete-event systems
2015 American Control Conference (ACC), 2013We study a new concept of relative coobservability in decentralized supervisory control of discrete-event systems under partial observation. This extends our previous work on relative observability from a centralized setup to a decentralized one. A fundamental concept in decentralized supervisory control is coobservability (and its several variations);
Kai Cai 0002 +2 more
openaire +1 more source
Opacity of networked discrete event systems
Information Sciences, 2019zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Jingkai Yang +3 more
openaire +2 more sources
Aggregation in Hierarchical Discrete-Event Systems
Discrete Event Dynamic Systems, 2003The authors elaborate on the hierarchical partition of automata-based discrete-event systems and provide algorithms which can be applied in practical applications. In the first part of the paper, they focus on the question of how to obtain a decomposition of a hierarchical system.
Al-Falou, AA, Van Schuppen, JH
openaire +2 more sources
Discrete Events in Power Systems
Discrete Event Dynamic Systems, 1999The relevance of Discrete Event System theory (whether synthetic or analytic) to power system analysis and control is not clear. However, based on several characterizations of the domain of discrete systems set forth in the January 1989 Special Issue of the IEEE Proceedings, on ’’Dynamics of discrete event systems‘‘ (Ho, 1989), we attempt to delineate ...
openaire +1 more source
Active diagnosis of discrete event systems
Proceedings of the 36th IEEE Conference on Decision and Control, 1998Summary: The need for accurate and timely diagnosis of system failures and the advantages of automated diagnostic systems are well appreciated. However, diagnosability considerations are often not explicitly taken into account in the system design. In particular, design of the controller and that of the diagnostic subsystem are decoupled, and this may ...
Meera Sampath +2 more
openaire +2 more sources
Invertibility of Discrete-Event Dynamic Systems
Mathematics of Control, Signals, and Systems, 1992zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Cüneyt M. Özveren, Alan S. Willsky
openaire +2 more sources
On Consistent Reduction in Discrete-Event Systems
2019 IEEE 15th International Conference on Automation Science and Engineering (CASE), 2019In this paper we develop a general framework, called “consistent reduction” for formalizing and solving a class of minimization/reduction problems in discrete-event systems. Given an arbitrary finite-state automaton and a binary relation on its state set, we propose a consistent reduction procedure that generates a reduced automaton, preserving certain
Cai K., Giua A., Seatzu C.
openaire +1 more source