Discrete Event Dynamic Systems-Theory and Applications

Papers
(The median citation count of Discrete Event Dynamic Systems-Theory and Applications is 1. The table below lists those papers that are above that threshold based on CrossRef citation counts [max. 250 papers]. The publications cover those that have been published in the past four years, i.e., from 2022-08-01 to 2026-08-01.)
ArticleCitations
Dynamics of products of matrices in max algebra17
An approximation-based incremental SMT approach for diagnosability analysis of real-time systems15
Overview of networked supervisory control with imperfect communication channels9
IPA for stationary problems9
Structural analysis and sequential resolution for estimation of guaranteed horizons in partially observable Petri nets8
Optimization-based computation of bounded sequences to reach target states in DESs7
Unified bisimulation applied to incremental abstraction of Petri nets6
Offline supervisory control synthesis: taxonomy and recent developments6
On Robust Supervisory Control of Metric Discrete Event Systems for scLTL Specifications6
Timed output synchronized Petri nets and synchronized state class graph5
Current-State opacity based on state outputs: definition and verification5
Mean-variance optimization of continuous time Markov decision processes5
Queues with auto-correlated service times5
Erratum: Extending the Network Calculus algorithmic toolbox: Pseudo-inverse and composition4
Petri net applications: a success story4
On clock interval automata for a class of time PNs4
A survey on compositional algorithms for verification and synthesis in supervisory control4
Weakly strong semantics of Time Petri Nets and its algebraic description4
A tropical-algebraic method for the control of timed event graphs with partial synchronization4
MGF-based SNC for stationary independent Markovian processes with localized application of martingales4
Correction to: Local and global robustness with q-step delay for max-plus linear systems4
Task scheduling using Markov decision process over supervisory control theory3
Probabilistic timed Petri nets for clinical pathway design and analysis: a case study3
Supervisory control to maximize mean time to failure in discrete event systems3
An overview of paradigms and results in the control of continuous and hybrid Petri nets3
Correction to: Transformational supervisor synthesis for evolving systems2
Cycle times in D/D/S series queues with single multi-server bottlenecks2
Zero-sum semi-Markov games with state-action-dependent discount factors2
Machine learning-enhanced vector ordinal optimization for multi-objective stochastic unit commitment2
SMT-based and fixed-point approaches for state estimation in max-plus linear systems2
Cost-optimal timed trace synthesis for scheduling of intermittent embedded systems2
Reliable decentralized failure diagnosis of discrete event systems using single-level inference2
Marking and firing transition estimation for partially observed petri nets without observable transitions2
A modular synthesis approach for the coordination of multi-agent systems: the multiple team case2
Do what you know: coupling knowledge with action in discrete-event systems1
Constrained absorbing continuous-time stochastic games1
A Petri net approach for dynamic task assignment problems and its application in weapon-target assignment1
Hierarchical supervisory control of discrete event systems based on reliable events1
Offline analysis of the relaxed upper boundedness for online estimation ofoptimal event sequences in Partially Observable Petri Nets1
Synthesis of winning attacks on communication protocols using supervisory control theory: two case studies1
Generation of mathematical programming representations for discrete event simulation models of timed petri nets1
Team variance optimization of n-player stochastic games with separately controlled chains1
An algebraic control method to guarantee generalized marking constraints for partially observable timed event graphs1
Enhancing sensor attack detection in supervisory control systems modeled by probabilistic automata1
Design and verification of pipelined circuits with Timed Petri Nets1
0.12872099876404