-
Simulations and bisimulations for max-plus automata Discrete Event Dyn. Syst. (IF 2.0) Pub Date : 2024-03-02 Miroslav Ćirić, Ivana Micić, Jelena Matejić, Aleksandar Stamenković
Two types of simulations and four types of bisimulations for weighted finite automata over the complete max-plus semiring we define as solutions of particular systems of matrix inequations. We provide a procedure that either decides that there is a simulation or bisimulation of a given type between two automata, and outputs the greatest one, or decides that no simulation or bisimulation of that type
-
Cycle times in D/D/S series queues with single multi-server bottlenecks Discrete Event Dyn. Syst. (IF 2.0) Pub Date : 2024-02-03 Lonnie Turpin, Morgan Turpin
-
Switched max-plus linear-dual inequalities: cycle time analysis and applications Discrete Event Dyn. Syst. (IF 2.0) Pub Date : 2024-02-01 Davide Zorzenon, Jan Komenda, Jörg Raisch
-
A modular synthesis approach for the coordination of multi-agent systems: the multiple team case Discrete Event Dyn. Syst. (IF 2.0) Pub Date : 2024-01-26 Marcelo Rosa, José E. R. Cury, Fabio L. Baldissera
-
Compositional non-blockingness verification of finite automata with prioritised events Discrete Event Dyn. Syst. (IF 2.0) Pub Date : 2024-01-25 Yiheng Tang, Thomas Moor
-
$$\pi $$ HyFlow: formalism, semantics, and applications Discrete Event Dyn. Syst. (IF 2.0) Pub Date : 2024-01-24 Fernando Barros
-
Analysis and control of timed event graphs in (max,+) algebra for the active localization of time failures Discrete Event Dyn. Syst. (IF 2.0) Pub Date : 2024-01-16 Ibis Velasquez, Yannick Pencolé, Euriell Le Corronc
-
Conflict-free electric vehicle routing problem: an improved compositional algorithm Discrete Event Dyn. Syst. (IF 2.0) Pub Date : 2023-12-18 Sabino Francesco Roselli, Martin Fabian, Knut Åkesson
-
Generation of mathematical programming representations for discrete event simulation models of timed petri nets Discrete Event Dyn. Syst. (IF 2.0) Pub Date : 2023-12-06 Mengyi Zhang, Arianna Alfieri, Andrea Matta
-
Multi-level control for multiple mobile robot systems Discrete Event Dyn. Syst. (IF 2.0) Pub Date : 2023-10-18 Elzbieta Roszkowska, Piotr Makowski-Czerski, Lukasz Janiec
-
Mixed Nondeterministic-Probabilistic Automata Discrete Event Dyn. Syst. (IF 2.0) Pub Date : 2023-10-19 Albert Benveniste, Jean-Baptiste Raclet
-
On tolerance of discrete systems with respect to transition perturbations Discrete Event Dyn. Syst. (IF 2.0) Pub Date : 2023-10-17 Rômulo Meira-Góes, Eunsuk Kang, Stéphane Lafortune, Stavros Tripakis
-
A multi-objective approach for manufacturing systems with multiple production routes based on supervisory control theory and heuristic algorithms Discrete Event Dyn. Syst. (IF 2.0) Pub Date : 2023-10-13 Lucas V. R. Alves, Gustavo C. Rafael, Lucas S. Batista, Patrícia N. Pena
-
Correction to: Transformational supervisor synthesis for evolving systems Discrete Event Dyn. Syst. (IF 2.0) Pub Date : 2023-10-03 Sander Thuijsman, Michel Reniers
The paper mentioned in the title used an incorrect implementation of the algorithms to produce the experimental results. The mistake significantly impacts the computational efficiency of the algorithms, on which they are evaluated. In this correction we explain the mistake, present the new results, and update our conclusions based on the new results.
-
Modeling and analysis of switching max-plus linear systems with discrete-event feedback Discrete Event Dyn. Syst. (IF 2.0) Pub Date : 2023-08-29 Alireza Mohamadkhani, Marc Geilen, Jeroen Voeten, Twan Basten
-
A survey on compositional algorithms for verification and synthesis in supervisory control Discrete Event Dyn. Syst. (IF 2.0) Pub Date : 2023-08-21 Robi Malik, Sahar Mohajerani, Martin Fabian
-
Average criteria in denumerable semi-Markov decision chains under risk-aversion Discrete Event Dyn. Syst. (IF 2.0) Pub Date : 2023-08-21 Rolando Cavazos-Cadena, Hugo Cruz-Suárez, Raúl Montes-De-Oca
This note concerns with semi-Markov decision chains evolving on a denumerable state space. The system is directed by a risk-averse controller with constant risk-sensitivity, and the performance of a decision policy is measured by a long-run average criterion associated with bounded holding cost rates and one-step cost function. Under mild conditions on the sojourn times and the transition law, restrictions
-
Do what you know: coupling knowledge with action in discrete-event systems Discrete Event Dyn. Syst. (IF 2.0) Pub Date : 2023-08-21 K. Ritsuka, K. Rudie
-
Extending the network calculus algorithmic toolbox for ultimately pseudo-periodic functions: pseudo-inverse and composition Discrete Event Dyn. Syst. (IF 2.0) Pub Date : 2023-08-18 Raffaele Zippo, Paul Nikolaus, Giovanni Stea
-
Dynamics of products of matrices in max algebra Discrete Event Dyn. Syst. (IF 2.0) Pub Date : 2023-08-10 Shrihari Sridharan, Sachindranath Jayaraman, Yogesh Kumar Prajapaty
The aim of this manuscript is to understand the dynamics of matrix products in a max algebra. A consequence of the Perron-Fröbenius theorem on periodic points of a nonnegative matrix is generalized to a max algebra setting. The same is then studied for a finite product associated to a p-lettered word on N letters arising from a finite collection of nonnegative matrices, with each member having its
-
A novel fully adaptive neural network modeling and implementation using colored Petri nets Discrete Event Dyn. Syst. (IF 2.0) Pub Date : 2023-06-30 Rosângela Albuquerque, Corneli Júnior, Giovanni Barroso, Guilherme Barreto
-
Supervisory control to maximize mean time to failure in discrete event systems Discrete Event Dyn. Syst. (IF 2.0) Pub Date : 2023-06-10 Feng Lin, Caisheng Wang, Masoud H. Nazari, Wenyuan Li
-
On comparison of steady-state infinitesimal perturbation analysis and likelihood ratio derivative estimates Discrete Event Dyn. Syst. (IF 2.0) Pub Date : 2023-05-23 Jian-Qiang Hu, Teng Lian
In this paper, we compare the infinitesimal perturbation analysis (IPA) and likelihood ratio (LR) derivative estimators for the steady-state system time of the M/M/1 queue. We derive the explicit formulas for the variances of both estimators. We then show IPA has smaller variance, which is often considered as a rule-of-thumb in the simulation literature. This is the first theoretical result that proves
-
Cost-optimal timed trace synthesis for scheduling of intermittent embedded systems Discrete Event Dyn. Syst. (IF 2.0) Pub Date : 2022-12-20 Antoine Bernabeu, Jean-Luc Béchennec, Mikael Briday, Sebastien Faucou, Olivier Roux
-
Overview of networked supervisory control with imperfect communication channels Discrete Event Dyn. Syst. (IF 2.0) Pub Date : 2022-12-16 Yuting Zhu, Liyong Lin, Ruochen Tai, Rong Su
-
Design and verification of pipelined circuits with Timed Petri Nets Discrete Event Dyn. Syst. (IF 2.0) Pub Date : 2022-12-15 Rémi Parrot, Mikaël Briday, Olivier H. Roux
-
Zero-sum semi-Markov games with state-action-dependent discount factors Discrete Event Dyn. Syst. (IF 2.0) Pub Date : 2022-11-05 Zhihui Yu, Xianping Guo, Li Xia
-
Synthesis of winning attacks on communication protocols using supervisory control theory: two case studies Discrete Event Dyn. Syst. (IF 2.0) Pub Date : 2022-10-20 Shoma Matsui, Stéphane Lafortune
-
Using Subobservers to Synthesize Opacity-Enforcing Supervisors Discrete Event Dyn. Syst. (IF 2.0) Pub Date : 2022-09-19 Richard Hugh Moulton, Behnam Behinaein Hamgini, Zahra Abedi Khouzani, Rômulo Meira-Góes, Fei Wang, Karen Rudie
-
Epistemic interpretations of decentralized discrete-event system problems Discrete Event Dyn. Syst. (IF 2.0) Pub Date : 2022-06-22 Richard Ean, Karen Rudie
-
Correction to: Probabilistic state estimation for labeled continuous time Markov models with applications to attack detection Discrete Event Dyn. Syst. (IF 2.0) Pub Date : 2022-06-20 Dimitri Lefebvre, Carla Seatzu, Christoforos N. Hadjicostis, Alessandro Giua
-
Detectability of labeled weighted automata over monoids Discrete Event Dyn. Syst. (IF 2.0) Pub Date : 2022-05-23 Kuize Zhang
-
Max-plus steady states in discrete event dynamic systems with inexact data Discrete Event Dyn. Syst. (IF 2.0) Pub Date : 2022-04-07 Helena Myšková, Ján Plavka
Max-plus algebra is defined as the set of all real numbers with two binary operations (maximum and addition). This combination of the operations forms a very applicable tool for the investigation of systems working in discrete steps (discrete event dynamic systems). The search for the steady states in such systems leads to the study of the eigenvectors of the production matrix in the corresponding
-
Diagnosability verification using LTL model checking Discrete Event Dyn. Syst. (IF 2.0) Pub Date : 2022-04-04 Thiago M. Tuxi, Lilian K. Carvalho, Eduardo V. L. Nunes, Antonio E. C. da Cunha
-
Observation-assisted heuristic synthesis of covert attackers against unknown supervisors Discrete Event Dyn. Syst. (IF 2.0) Pub Date : 2022-03-09 Liyong Lin, Ruochen Tai, Yuting Zhu, Rong Su
In this work, we address the problem of synthesis of covert attackers in the setup where the model of the plant is available, but the model of the supervisor is unknown, to the adversary. To compensate the lack of knowledge on the supervisor, we assume that the adversary has recorded a (prefix-closed) finite set of observations of the runs of the closed-loop system, which can be used for assisting
-
Transformational supervisor synthesis for evolving systems Discrete Event Dyn. Syst. (IF 2.0) Pub Date : 2022-02-23 Sander Thuijsman, Michel Reniers
Supervisory controller synthesis is a means to compute correct-by-construction controllers for discrete event systems. As these systems and their requirements evolve over time, an updated supervisor needs to be computed each time an adaptation takes place. We consider the case that a supervisor has been synthesized for a given model, after which this model is (slightly) adapted. We investigate how
-
Discovering petri nets including silent transitions. A repairing approach based on structural patterns Discrete Event Dyn. Syst. (IF 2.0) Pub Date : 2022-02-07 Román Pomares-Angelino, Ernesto López-Mellado
The paper presents a novel approach for discovering Petri nets (PN) that include silent transitions from logs of event sequences. We propose a repairing method that extends existing discovery techniques that do not deal with silent transitions; such techniques may yield substructures that involve deadlocks. Such substructures, called inconsistent (IS), are detected through a structural pattern. IS
-
A general language-based framework for specifying and verifying notions of opacity Discrete Event Dyn. Syst. (IF 2.0) Pub Date : 2022-02-02 Andrew Wintenberg, Matthew Blischke, Stéphane Lafortune, Necmiye Ozay
Opacity is an information flow property that captures the notion of plausible deniability in dynamic systems, that is whether an intruder can deduce that “secret” behavior has occurred. In this paper we provide a general framework of opacity to unify the many existing notions of opacity that exist for discrete event systems. We use this framework to discuss language-based and state-based notions of
-
Local and global robustness with q-step delay for max-plus linear systems Discrete Event Dyn. Syst. (IF 2.0) Pub Date : 2021-12-20 Yingxuan Yin, Yuegang Tao, Cailu Wang, Haiyong Chen
This paper studies the local and global robustness with q-step delay of max-plus linear systems, which requires part or all components of the state vectors remain unchanged under the bounded parameter perturbations after a finite number of steps. A graph approach based on the circuit with tail is proposed to determine the variable elements with respect to the local and global robustness. This approach
-
Discrete-event systems subject to unknown sensor attacks Discrete Event Dyn. Syst. (IF 2.0) Pub Date : 2021-12-10 Alves, Michel R. C., Pena, Patrícia N., Rudie, Karen
This work is set in the context of supervisory control of discrete-event systems under partial observation. Attackers that are able to insert or erase occurrences of particular output symbols can tamper with the supervisor’s observation and by doing so, can lead the controlled system to undesirable states. We consider a scenario with multiple attackers, each one being an element of a set, called the
-
Parallel decomposition and concurrent satisfaction for heterogeneous multi-robot task and motion planning under temporal logic specifications Discrete Event Dyn. Syst. (IF 2.0) Pub Date : 2021-11-27 Zheng, Huanfei, Wang, Yue
This paper presents an automaton-based task and motion planning framework for multi-robot systems (MRS) to satisfy finite words of linear temporal logic (LTL) task specifications in parallel and concurrently. A parallel decomposition algorithm is developed to iteratively decompose a global task specification into a set of smaller subtask automata. Robots are assigned to the smallest task component
-
Decentralized diagnosis of discrete event systems subject to permanent sensor failures Discrete Event Dyn. Syst. (IF 2.0) Pub Date : 2021-11-08 Wada, Akihito, Takai, Shigemasa
In this paper, we consider a decentralized failure diagnosis problem for discrete event systems. Each local diagnoser makes a diagnosis decision based on local event observations. A sensor that detects the occurrence of an event may possibly fail due to, for example, aging degradation. It is desirable that the occurrence of any failure string should be correctly detected in the presence of sensor failures
-
Supervisory controller synthesis and implementation for safety PLCs Discrete Event Dyn. Syst. (IF 2.0) Pub Date : 2021-11-06 Reijnen, Ferdie F. H., Erens, Toby R., van de Mortel-Fronczak, Joanna M., Rooda, Jacobus E.
The development of supervisory controllers for cyber-physical systems is a laborious and error-prone process. Supervisor synthesis enables control designers to automatically synthesize a correct-by-construction supervisor from a model of the plant combined with a model of the control requirements. From the supervisor model, controller code can be generated which is suitable for the implementation on
-
Hierarchical planning in a supervisory control context with compositional abstraction Discrete Event Dyn. Syst. (IF 2.0) Pub Date : 2021-09-14 Vilela, Juliana, Hill, Richard
Hierarchy is a tool that has been applied to improve the scalability of solving planning problems modeled using Supervisory Control Theory. In the work of Hill and Lafortune (2016), the notion of cost equivalence was employed to generate an abstraction of the supervisor that, with additional conditions, guarantees that an optimal plan generated on the abstraction is also optimal when applied to the
-
Weakly linear systems for matrices over the max-plus quantale Discrete Event Dyn. Syst. (IF 2.0) Pub Date : 2021-09-13 Stamenković, Aleksandar, Ćirić, Miroslav, Djurdjanović, Dragan
In this paper we introduce and study weakly linear systems, i.e. systems consisting of matrix inequalities Eqs. 17–20, over the max-plus quantale which is also known as complete max-plus algebra. We prove the existence of the greatest solution contained in a given matrix X0, and present a procedure for its computation. In the case of weakly linear systems consisting of finitely many matrix inequalities
-
Interpreted synchronous extension of time Petri nets Discrete Event Dyn. Syst. (IF 2.0) Pub Date : 2021-09-08 Godary-Dejean, Karen, Leroux, Hélène, Andreu, David
Our work is integrated into a global methodology to design synchronously executed embedded critical systems. It is used for the development of medical devices implanted into human body to perform functional electrical stimulation solutions (used in pacemakers, deep brain stimulation...). These systems are of course critical and real time, and the reliability of their behaviors must be guaranteed. These
-
Probabilistic state estimation for labeled continuous time Markov models with applications to attack detection Discrete Event Dyn. Syst. (IF 2.0) Pub Date : 2021-09-08 Lefebvre, Dimitri, Seatzu, Carla, Hadjicostis, Christoforos N., Giua, Alessandro
This paper is about state estimation in a timed probabilistic setting. The main contribution is a general procedure to design an observer for computing the probabilities of the states for labeled continuous time Markov models as functions of time, based on a sequence of observations and their associated time stamps that have been collected thus far. Two notions of state consistency with respect to
-
Optimal Modular Control of Discrete Event Systems with Distinguishers and Approximations Discrete Event Dyn. Syst. (IF 2.0) Pub Date : 2021-08-09 Malik, Robi, Teixeira, Marcelo
This paper proposes algorithms for supervisor synthesis in discrete event system models with distinguishers. Distinguishers are special components responsible to select an enabled event from a group of related refined events. They are a helpful modelling tool, but their use increases the state space and makes supervisor synthesis more difficult. The paper shows how general algorithms for modular or
-
Formal specification and verification of decentralized self-adaptive systems using symmetric nets Discrete Event Dyn. Syst. (IF 2.0) Pub Date : 2021-08-05 Camilli, Matteo, Capra, Lorenzo
Engineering distributed self-adaptive systems is challenging due to multiple interacting components, some of which monitor and possibly modify the behavior of managed components that operate in highly dynamic settings. Formalizing such systems having a decentralized adaptation control has been recognized as a hard task. In this article, we introduce a formal framework based on Symmetric Nets (a well-established
-
Behaviour equivalent max-plus automata for timed petri nets under open-loop race-policy semantics Discrete Event Dyn. Syst. (IF 2.0) Pub Date : 2021-07-31 Triska, Lukas, Moor, Thomas
Timed Petri nets and max-plus automata are well known modelling frameworks for timed discrete-event systems. In this paper we present an iterative procedure that constructs a max-plus automaton from a timed Petri net while retaining the timed behaviour. Regarding the Petri net, we essentially impose three assumptions: (a) the Petri net must be bounded, i.e, the reachability graph must be finite; (b)
-
Comparing the notions of opacity for discrete-event systems Discrete Event Dyn. Syst. (IF 2.0) Pub Date : 2021-07-27 Jiří Balun, Tomáš Masopust
Opacity is an information flow property characterizing whether a system reveals its secret to a passive observer. Several notions of opacity have been introduced in the literature. We study the notions of language-based opacity, current-state opacity, initial-state opacity, initial-and-final-state opacity, K-step opacity, and infinite-step opacity. Comparing the notions is a natural question that has
-
Failure detection and localization for timed event graphs in ( max , + ) $(\max \limits ,+)$ -algebra Discrete Event Dyn. Syst. (IF 2.0) Pub Date : 2021-07-23 Euriell Le Corronc, Yannick Pencolé, Alexandre Sahuguède, Claire Paya
In this paper, we address the problem of failure detection and localization in a Timed Discrete Event System (TDES) such \((\max \limits ,+)\)-linear system graphically modeled by a Timed Event Graph (TEG). The considered failures are changes on holding times or tokens of the TEG places that can provoke shifts between an observed outcoming timed flow and an expected outcoming timed flow (for a given
-
Counter approach for the estimation of optimal sequences in Partially Observable Untimed Petri Nets Discrete Event Dyn. Syst. (IF 2.0) Pub Date : 2021-05-15 P. Declerck
In this paper, we consider the on-line estimation of optimal current subsequences in Partially Observable Untimed Petri Nets. Applying the counter approach classically used in max-plus algebra for Timed Petri nets, the idea is to exploit the assumption of a non immediate consumption of the tokens for each place which introduces an order of precedence between events. The approach can estimate a global
-
A receding horizon event-driven control strategy for intelligent traffic management Discrete Event Dyn. Syst. (IF 2.0) Pub Date : 2021-04-30 Walter Lucia, Giuseppe Franzè, Domenico Famularo
In this paper, the intelligent traffic management within a smart city environment is addressed by developing an ad-hoc model predictive control strategy based on an event-driven formulation. To this end, a constrained hybrid system description is considered for safety verification purposes and a low-demanding receding horizon controller is then derived by exploiting set-theoretic arguments. Simulations
-
Hierarchical scheduling learning optimisation of two-area active distribution system considering peak shaving demand of power grid Discrete Event Dyn. Syst. (IF 2.0) Pub Date : 2021-04-14 Hao Tang, Chang Liu, Yonglun Cao, Kai Lv, Qianli Zhang
Aiming at industrial parks and business parks equipped with photovoltaic (PV) power plants and vanadium redox battery energy storage devices, this work studies the collaborative scheduling optimisation problem of real-time response of two-area active distribution system to the random peak shaving demand of large power grids. Firstly, considering the randomness of source and load, the stochastic dynamic
-
On computing the supremal right-closed control invariant subset of a right-closed set of markings for an arbitrary petri net Discrete Event Dyn. Syst. (IF 2.0) Pub Date : 2021-03-25 Roshanak Khaleghi, Ramavarapu S. Sreenivas
A set of non-negative integral vectors is said to be right-closed if the presence of a vector in the set implies all term-wise larger vectors also belong to the set. A set of markings is control invariant with respect to a Petri Net (PN) structure if the firing of any uncontrollable transition at any marking in this set results in a new marking that is also in the set. Every right-closed set of markings
-
A mean field absorbing control model for interacting objects systems Discrete Event Dyn. Syst. (IF 2.0) Pub Date : 2021-03-02 M. Elena Martínez-Manzanares, J. Adolfo Minjárez-Sosa
We study a class of discrete-time stochastic systems composed of a large number of N interacting objects, which are classified in a finite number of classes. The behavior of the objects is controlled by a central decision-maker as follows. At each stage, once the configuration of the system is observed, the controller takes a decision; then a cost is incurred and there is a positive probability the
-
Contention-resolving model predictive control for an intelligent intersection traffic model Discrete Event Dyn. Syst. (IF 2.0) Pub Date : 2021-03-01 Ningshi Yao, Fumin Zhang
We address the problem of optimally scheduling automated vehicles crossing an intelligent intersection by assigning vehicles with priorities and desired speed. An idealized intersection traffic model is established for the development and verification of the required algorithms. We formulate the intersection scheduling problem as a mixed integer programming (or MIP) problem which co-designs the priority
-
Editorial - Thirty years of J-DEDS: moving on with new leadership Discrete Event Dyn. Syst. (IF 2.0) Pub Date : 2021-01-26 Christoforos Hadjicostis,Stéphane Lafortune
-
Compositional coordinator synthesis of extended finite automata Discrete Event Dyn. Syst. (IF 2.0) Pub Date : 2021-01-07 Martijn A. Goorden, Martin Fabian, Joanna M. van de Mortel-Fronczak, Michel A. Reniers, Wan J. Fokkink, Jacobus E. Rooda
To avoid the state-space explosion problem, a set of supervisors may be synthesized using divide and conquer strategies, like modular or multilevel synthesis. Unfortunately, these supervisors may be conflicting, meaning that even though they are individually non-blocking, they are together blocking. Abstraction-based compositional nonblocking verification of extended finite automata provides means