Abstract
Petri nets (PNs) are a well-known family of formalisms whose definition immediately sets them, in a broad sense, as positive systems. Although they are originally discrete event models, their relaxation through continuization transforms them in continuous models. In this paper one of the most relevant timing interpretations of continuous PNs, unforced infinite servers semantics continuous PNs, is compared with linear positive systems and compartmental models.
Partially supported by the CICYT-FEDER project TIC2001-1819
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
Author information
Authors and Affiliations
Editor information
Rights and permissions
About this paper
Cite this paper
Silva, M., Recalde, L. Unforced Continuous Petri Nets and Positive Systems. In: Benvenuti, L., De Santis, A., Farina, L. (eds) Positive Systems. Lecture Notes in Control and Information Science, vol 294. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-44928-7_9
Download citation
DOI: https://doi.org/10.1007/978-3-540-44928-7_9
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-40342-5
Online ISBN: 978-3-540-44928-7
eBook Packages: Springer Book Archive