Convex geometry and semiflows in P/T nets. A comparative study of algorithms for computation of minimal p-semiflows
- 1 January 1991
- book chapter
- Published by Springer Nature
Abstract
No abstract availableKeywords
This publication has 19 references indexed in Scilit:
- Predicate/transition netsPublished by Springer Nature ,2006
- Coloured Petri netsPublished by Springer Nature ,2006
- Polynomial Algorithms for Computing the Smith and Hermite Normal Forms of an Integer MatrixSIAM Journal on Computing, 1979
- Fourier-Motzkin elimination extension to integer programming problemsJournal of Combinatorial Theory, Series A, 1976
- On fourier’s analysis of linear inequality systemsPublished by Springer Nature ,1974
- Adjacency on Convex PolyhedraSIAM Review, 1971
- Algorithm for finding a general formula for the non-negative solutions of a system of linear equationsUSSR Computational Mathematics and Mathematical Physics, 1964
- An Algorithm for Finding All Vertices of Convex Polyhedral SetsJournal of the Society for Industrial and Applied Mathematics, 1961
- On Positive Solutions of a System of Linear EquationsAnnals of Mathematics, 1926
- Some Theorems on DeducibilityAnnals of Mathematics, 1926