For the most recent entries see the
Petri Nets Newsletter.
Mayr, E.W.
-
Mayr, Ernst W.:
It Is on the Boundary: Complexity Considerations for Polynomial Ideals.
2000.
-
Kleine Büning, H.;
Lettmann, T.;
Mayr, E.W.:
Projections of Vector Addition System Reachability Sets are Semilinear.
1989.
-
Kleine Büning, H.;
Lettmann, T.;
Mayr, E.W.:
Projections of Vector Addition System Reachability Sets are Semilinear.
1988.
-
Mayr, E.W.:
An Algorithm for the General Petri Net Reachability Problem.
1981.
-
Mayr, E.W.:
Persistence of Vector Replacement Systems is Decidable.
1981.
-
Mayr, E.W.;
Meyer, A.R.:
The Complexity of the Finite Containment Problem for Petri Nets.
1981.
-
Mayr, E.W.:
Ein Algorithmus für das allgemeine Erreichbarkeitsproblem bei Petrinetzen und damit zusammenhängende Probleme.
1980.
-
Mayr, E.W.:
The Complexity of the Finite Containment Problem for Petri Nets.
1977.
-
Mayr, E.W.:
Einige Sätze über Umformungen und verklemmungsfreie Führbarkeit bei bewerteten Petri-Netzen.
1975.
Do you need a refined search? Try our search engine
which allows complex field-based queries.
Are you trying to get in contact with an author? Try our
database of Petri net researchers.
Back to the Petri Nets Bibliography