Skip to main content Accessibility help
×
Hostname: page-component-78c5997874-g7gxr Total loading time: 0 Render date: 2024-11-02T21:19:56.215Z Has data issue: false hasContentIssue false

Algebraic system analysis of timed Petri nets

Published online by Cambridge University Press:  05 May 2010

Get access

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 - 170
Publisher: Cambridge University Press
Print publication year: 1998

Access options

Get access to the full version of this content by using one of the access options below. (Log in options will check for institutional or personal access. Content may require purchase if you do not have access.)

Save book to Kindle

To save this book to your Kindle, first ensure [email protected] is added to your Approved Personal Document E-mail List under your Personal Document Settings on the Manage Your Content and Devices page of your Amazon account. Then enter the ‘name’ part of your Kindle email address below. Find out more about saving to your Kindle.

Note you can select to save to either the @free.kindle.com or @kindle.com variations. ‘@free.kindle.com’ emails are free but can only be saved to your device when it is connected to wi-fi. ‘@kindle.com’ emails can be delivered even when you are not connected to wi-fi, but note that service fees apply.

Find out more about the Kindle Personal Document Service.

Available formats
×

Save book to Dropbox

To save content items to your account, please confirm that you agree to abide by our usage policies. If this is the first time you use this feature, you will be asked to authorise Cambridge Core to connect with your account. Find out more about saving content to Dropbox.

Available formats
×

Save book to Google Drive

To save content items to your account, please confirm that you agree to abide by our usage policies. If this is the first time you use this feature, you will be asked to authorise Cambridge Core to connect with your account. Find out more about saving content to Google Drive.

Available formats
×