Book contents
- Frontmatter
- Contents
- Foreword
- Preface
- List of Participants
- An introduction to idempotency
- Tropical semirings
- Some automata-theoretic aspects of min-max-plus semirings
- The finite power property for rational sets of a free group
- The topological approach to the limitedness problem on distance automata
- Types and dynamics in partially additive categories
- Task resource models and (max, +) automata
- Algebraic system analysis of timed Petri nets
- Ergodic theorems for stochastic operators and discrete event networks.
- Computational issues in recursive stochastic systems
- Periodic points of nonexpansive maps
- A system-theoretic approach for discrete-event control of manufacturing systems
- Idempotent structures in the supervisory control of discrete event systems
- Maxpolynomials and discrete-event dynamic systems
- The Stochastic HJB equation and WKB method
- The Lagrange problem from the point of view of idempotent analysis
- A new differential equation for the dynamics of the Pareto sets
- Duality between probability and optimization
- Maslov optimization theory: topological aspect
- Random particle methods in (max, +) optimization problems
- The geometry of finite dimensional pseudomodules
- A general linear max-plus solution technique
- Axiomatics of thermodynamics and idempotent analysis
- The correspondence principle for idempotent calculus and some computer applications
Algebraic system analysis of timed Petri nets
Published online by Cambridge University Press: 05 May 2010
- Frontmatter
- Contents
- Foreword
- Preface
- List of Participants
- An introduction to idempotency
- Tropical semirings
- Some automata-theoretic aspects of min-max-plus semirings
- The finite power property for rational sets of a free group
- The topological approach to the limitedness problem on distance automata
- Types and dynamics in partially additive categories
- Task resource models and (max, +) automata
- Algebraic system analysis of timed Petri nets
- Ergodic theorems for stochastic operators and discrete event networks.
- Computational issues in recursive stochastic systems
- Periodic points of nonexpansive maps
- A system-theoretic approach for discrete-event control of manufacturing systems
- Idempotent structures in the supervisory control of discrete event systems
- Maxpolynomials and discrete-event dynamic systems
- The Stochastic HJB equation and WKB method
- The Lagrange problem from the point of view of idempotent analysis
- A new differential equation for the dynamics of the Pareto sets
- Duality between probability and optimization
- Maslov optimization theory: topological aspect
- Random particle methods in (max, +) optimization problems
- The geometry of finite dimensional pseudomodules
- A general linear max-plus solution technique
- Axiomatics of thermodynamics and idempotent analysis
- The correspondence principle for idempotent calculus and some computer applications
Summary
Abstract
We show that Continuous Timed Petri Nets (CTPN) can be modeled by generalized polynomial recurrent equations in the (min, +) semiring. We establish a correspondence between CTPN and Markov decision processes. We survey the basic system theoretical results available: behavioral (input–output) properties, algebraic representations, asymptotic regime. Particular attention is paid to the subclass of stable systems (with asymptotic linear growth).
Introduction
The fact that a subclass of Discrete Event Systems equations can be written linearly in the (min, +) or in the (max, +) semiring is now almost classical [9, 2]. The (min, +) linearity allows the presence of synchronization and saturation features but unfortunately prohibits the modeling of many interesting phenomena such as “birth” and “death” processes (multiplication of tokens) and concurrency. The purpose of this paper is to show that after some simplifications, these additional features can be represented by polynomial recurrences in the (min, +) semiring.
We introduce a fluid analogue of general Timed Petri Nets (in which the quantities of tokens are real numbers), called Continuous Timed Petri Nets (CTPN). We show that, assuming a stationary routing policy, the counter variables of a CTPN satisfy recurrence equations involving the operators min, +, ×. We interpret CTPN equations as dynamic programming equations of classical Markov Decision Problems: CTPN can be seen as the dedicated hardware executing the value iteration.
We set up a hierarchy of CTPN which mirrors the natural hierarchy of optimization problems (deterministic vs. stochastic, discounted vs. ergodic). For each level and sublevel of this hierarchy, we recall or introduce the required algebraic and analytic tools, provide input–output characterizations and give asymptotic results.
- Type
- Chapter
- Information
- Idempotency , pp. 145 - 170Publisher: Cambridge University PressPrint publication year: 1998
- 20
- Cited by