Mathematical methods for calculating invariants in Petri nets
- 1 January 1987
- book chapter
- Published by Springer Nature in Lecture Notes in Computer Science
- p. 104-131
- https://doi.org/10.1007/3-540-18086-9_22
Abstract
No abstract availableKeywords
This publication has 14 references indexed in Scilit:
- A simple and Fast Algorithm to Obtain all Invariants of a Generalised Petri NetPublished by Springer Nature ,1982
- System modelling with high-level Petri netsTheoretical Computer Science, 1981
- Coloured petri nets and the invariant-methodTheoretical Computer Science, 1981
- Polynomial Algorithms for Computing the Smith and Hermite Normal Forms of an Integer MatrixSIAM Journal on Computing, 1979
- Polynomial time algorithms in the theory of linear diophantine equationsLecture Notes in Computer Science, 1977
- The Exact Solution of Systems of Linear Equations with Polynomial CoefficientsJournal of the ACM, 1973
- Generation of all integer points for given sets of linear inequalitiesMathematical Programming, 1972
- Algorithms for Hermite and Smith normal matrices and linear Diophantine equationsMathematics of Computation, 1971
- Über homogene lineare UngleichungssystemeZAMM - Journal of Applied Mathematics and Mechanics / Zeitschrift für Angewandte Mathematik und Mechanik, 1956
- Sur l'introduction des variables continues dans la théorie des nombres.Journal für die reine und angewandte Mathematik (Crelles Journal), 1851