• Corpus ID: 244462838

Max-algebraic hybrid automata: Modelling and equivalences

@article{Gupta2021MaxalgebraicHA,
  title={Max-algebraic hybrid automata: Modelling and equivalences},
  author={A. Gupta and Bart De Schutter and Jacob van der Woude and Ton J. J. van den Boom},
  journal={ArXiv},
  year={2021},
  volume={abs/2111.10318}
}
This article introduces the novel framework of max-algebraic hybrid automata as a hybrid modelling language in the max-plus algebra. We show that the modelling framework unifies and extends the switching max-plus linear systems framework and is analogous to the discrete hybrid automata framework in conventional algebra. In addition, we show that the framework serves as a bridge between automata-theoretic models in max-plus algebra and switching max-plus linear systems. In doing so, we formalise… 

Figures from this paper

References

SHOWING 1-10 OF 29 REFERENCES
Performance evaluation of (max, +) automata
  • S. Gaubert
  • Computer Science, Mathematics
    IEEE Trans. Autom. Control.
  • 1995
TLDR
This formalism, which extends both conventional automata and (max,+) linear representations, covers a class of systems with synchronization phenomena and variable schedules and considers performance evaluation in the worst, mean, and optimal cases.
HYSDEL-a tool for generating computational hybrid models for analysis and synthesis problems
TLDR
This paper presents HYSDEL (hybrid systems description language), a high-level modeling language for DHA, and a set of tools for translating DHA into any of the former hybrid models, and shows the modeling capabilities ofHYSDEL and how the different models allow to use several computational tools.
Equivalence of dynamical systems by bisimulation
TLDR
B bisimulation is shown to be a notion which unifies the concepts of state-space equivalence and state- Space reduction, and which allows to study equivalence of systems with nonminimal state- space dimension.
Synchronization and Linearity: An Algebra for Discrete Event Systems
TLDR
This book proposes a unified mathematical treatment of a class of 'linear' discrete event systems, which contains important subclasses of Petri nets and queuing networks with synchronization constraints, which is shown to parallel the classical linear system theory in several ways.
Modeling and analysis of timed Petri nets using heaps of pieces
TLDR
It is shown that safe timed Petri nets can be represented by special automata over the (max,+) semiring, which compute the height of heaps of pieces, and a heap-based throughput formula is obtained, which is simpler to compute than its traditional timed event graph version.
Model predictive scheduling of semi-cyclic discrete-event systems using switching max-plus linear models and dynamic graphs
TLDR
A unified modeling framework in which different types of semi-cyclic discrete-event systems can be described by switching max-plus linear (SMPL) models is introduced and a dynamic graph is used to visualize the evolution of an SMPL system over a certain period in a graphical way and to describe the order relations of the system events.
ON THE BEHAVIOUR OF CLASSES OF MIN-MAX-PLUS SYSTEMS
TLDR
This thesis model a railroad network by means of the (max,+) algebra, and develops some theory concerning graphs corresponding to the ( max,+) matrix for bipartite and seperated DES systems.
Modeling and control of switching max-plus-linear systems with random and deterministic switching
TLDR
It is shown that a switching max-plus-linear system can be written as a piecewise affine system or as a constrained max-min- plus-scaling system, and a stabilizing model predictive controller for SMPL systems with deterministic and/or stochastic switching is developed.
Introduction to Discrete Event Systems
TLDR
This edition includes recent research results pertaining to the diagnosis of discrete event systems, decentralized supervisory control, and interval-based timed automata and hybrid automata models.
...
1
2
3
...