Abstract
Petri nets are a widely-used model for parallel and distributed systems of concurrent systems using common resources. They admit a precise algebraic formalization as vector addition or vector replacement systems. If one considers symmetric VRS’s, it turns out that they are equivalent to finitely presented commutative semigroups or to binomial ideals in a multivariate ring over ℚ.
We outline and survey the interaction between these domains of computational algebra, system modeling and verification, and, in particular, complexity theory. While many of the fundamental computational problems in these areas turn out to be very complex (i.e., EXPSPACE-complete or even worse, we also present some new results concerning better complexity for restricted subclasses of the problems.
Chapter PDF
Similar content being viewed by others
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2010 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Mayr, E.W. (2010). From Petri Nets to Polynomials: Modeling, Algorithms, and Complexity (Abstract) (Invited Talk) . In: Gerdt, V.P., Koepf, W., Mayr, E.W., Vorozhtsov, E.V. (eds) Computer Algebra in Scientific Computing. CASC 2010. Lecture Notes in Computer Science, vol 6244. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-15274-0_18
Download citation
DOI: https://doi.org/10.1007/978-3-642-15274-0_18
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-15273-3
Online ISBN: 978-3-642-15274-0
eBook Packages: Computer ScienceComputer Science (R0)