{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,5]],"date-time":"2026-06-05T02:58:27Z","timestamp":1780628307077,"version":"3.54.1"},"publisher-location":"Berlin, Heidelberg","reference-count":35,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540538639","type":"print"},{"value":"9783540463696","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1991]]},"DOI":"10.1007\/3-540-53863-1_22","type":"book-chapter","created":{"date-parts":[[2012,2,25]],"date-time":"2012-02-25T22:14:29Z","timestamp":1330208069000},"page":"79-112","source":"Crossref","is-referenced-by-count":51,"title":["Convex geometry and semiflows in P\/T nets. A comparative study of algorithms for computation of minimal p-semiflows"],"prefix":"10.1007","author":[{"given":"J. M.","family":"Colom","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"M.","family":"Silva","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2005,6,8]]},"reference":[{"key":"4_CR1","unstructured":"ALAIWAN H.,MEMMI G.: Algorithmes de Recherche des Solutions Entieres Positives d'un Systeme Lineaire d'Equations Homogenes. Revue Technique-CSF,vol.14, n o 1, Mars, pp. 125\u2013135."},{"key":"4_CR2","unstructured":"Petri Nets: Central Models and their Properties. Advances in Petri Nets 1986, Proceedings of an Advanced Course, Bad Honnef, September 1986. LNCS 254, Springer Verlag, Berlin."},{"key":"4_CR3","doi-asserted-by":"crossref","unstructured":"BALINSKI, M.L.: An Algorithm for Finding all Vertices of Convex Polyhedral Sets. SIAM IX, pp. 72\u201378.","DOI":"10.1137\/0109008"},{"key":"4_CR4","unstructured":"BRAMS G.W.: R\u00e9seaux de Petri. Theorie et pratique, Masson, Paris."},{"key":"4_CR5","doi-asserted-by":"crossref","unstructured":"CHERNIKOVA N.V.: Algorithm for Finding a General Formula for the Nonnegative Solutions of a System of Linear Equations, U.S.S.R. Computational Mathematics and Mathematical Physics IV, pp. 151\u2013156.","DOI":"10.1016\/0041-5553(64)90009-6"},{"key":"4_CR6","volume-title":"Linear Programming","author":"V. Chvatal","year":"1983","unstructured":"CHVATAL V.: Linear Programming, W.H. Freeman and Company, New York, 1983."},{"key":"4_CR7","unstructured":"COLOM J.M.: M\u00e9todos de an\u00e1lisis estructural de Redes de Petri basados en Programaci\u00f3n Lineal y Geometr\u00eda Convexa. Tesis Doctoral. Universidad de Zaragoza. June 1989."},{"key":"4_CR8","unstructured":"DANTZIG G.B.: Linear Programming and Extensions. Princeton University Press."},{"key":"4_CR9","doi-asserted-by":"crossref","unstructured":"DINES L.L.: On Positive Solutions of a System of Linear Equations, Annals of Mathematics 28, pp. 386\u2013392.","DOI":"10.2307\/1968384"},{"key":"4_CR10","doi-asserted-by":"crossref","unstructured":"DUFFIN R.J.: On Fourier's Analysis of Linear Inequality Systems, Mathematical Programming Study 1, American Elsevier Publishing Company, New York, pp. 71\u201395.","DOI":"10.1007\/BFb0121242"},{"key":"4_CR11","doi-asserted-by":"crossref","unstructured":"DYER M.E., PROLL L.G.: An Algorithm for Determining All Extreme Points of a Convex Polytope. Math. Programming XII, pp. 81\u201396.","DOI":"10.1007\/BF01593771"},{"key":"4_CR12","unstructured":"FARKAS J.: Theorie der einfachen Ungleichungen. In: Journal f\u00fcr die reine und andgewandte Mathematik, 124, pp. 1\u201327."},{"key":"4_CR13","doi-asserted-by":"crossref","unstructured":"FOURIER J.B.J.: Solution d'une Question Particuliere du Calcul des Inegalit\u00e9s. In Oeuvres II, pp. 317\u2013328, Gauthier-Villars, Paris.","DOI":"10.1017\/CBO9781139568159.016"},{"key":"4_CR14","doi-asserted-by":"crossref","unstructured":"GENRICH H.J.: Predicate\/Transition Nets. In [APN 87], pp. 207\u2013247.","DOI":"10.1007\/BFb0046841"},{"key":"4_CR15","unstructured":"HADLEY G.: Linear Programming. Addison Wesley, Reading, Massachusetts."},{"key":"4_CR16","doi-asserted-by":"crossref","unstructured":"JENSEN K.: Coloured Petri Nets. In [APN 87], pp. 248\u2013299.","DOI":"10.1007\/BFb0046842"},{"key":"4_CR17","doi-asserted-by":"crossref","unstructured":"KANNAN, R., BACHEM A.: Polynomial Algorithms for Computing the Smith and Hermite Normal Forms of an Integer Matrix. SIAM J. Comp., vol. 8, pp. 499\u2013507.","DOI":"10.1137\/0208040"},{"key":"4_CR18","unstructured":"KOHLER D.A.: Projections of Convex Polyhedral Sets. Report ORC 67-29, Operations Research Center, University of California at Berkeley."},{"key":"4_CR19","doi-asserted-by":"crossref","unstructured":"KRUCKEBERG F., JAXY M.: Mathematical Methods for Calculating Invariants in Petri Nets, Advances in Petri Nets 1987 (Ed. Grzegorz Rozenberg) LNCS 266, Springer Verlag.","DOI":"10.1007\/3-540-18086-9_22"},{"key":"4_CR20","doi-asserted-by":"crossref","unstructured":"LANGFORD C.H: Some Theorems on deducibility.Annals of Mathematics I,28, pp.16\u201340.","DOI":"10.2307\/1968352"},{"key":"4_CR21","doi-asserted-by":"crossref","unstructured":"MANAS M., NEDOMA J.: Finding All Vertices of a Convex Polyhedron. Numer. Math. XII, pp.226\u2013229.","DOI":"10.1007\/BF02162916"},{"key":"4_CR22","unstructured":"MARTINEZ J., SILVA M.: A Simple and Fast Algorithm to Obtain all Invariants of a Generalized Petri Net. Second European Workshop on Application and Theory of Petri Nets, Bad Honnef, September, pp. 411\u2013422."},{"key":"4_CR23","unstructured":"MARTINEZ J.: Contribuci\u00f3n al An\u00e1lisis y Modelado de Sistemas Concurrentes mediante Redes de Petri. Tesis Doctoral. Universidad de Zaragoza, Octubre 1984."},{"key":"4_CR24","doi-asserted-by":"crossref","unstructured":"MATTHEISS T.H.: An Algorithm for Determining Irrelevant Constraints an All Vertices in Systems of Linear Inequalities. Operations Res. 21, pp. 247\u2013260.","DOI":"10.1287\/opre.21.1.247"},{"key":"4_CR25","doi-asserted-by":"crossref","unstructured":"MATHEISS T.H.,RUBIN D.S.: A Survey and Comparison of Methods for Finding all Vertices of Convex Polyhedral Sets Mathematics of Ops. Res., Vol.5, No.2, May, pp.167\u2013185.","DOI":"10.1287\/moor.5.2.167"},{"key":"4_CR26","unstructured":"MEMMI G: Fuites et semiflots dans les r\u00e9seaux de Petri. Th\u00e9se de Docteur Ingenieur. Univ. Pierre et Marie Curie, Paris VI, Paris, Decembre."},{"key":"4_CR27","unstructured":"MOTZKIN T.S.: Beitrage zur Theorie der Linearen Ungleichungen, Doctoral Thesis, University of Zurich."},{"key":"4_CR28","doi-asserted-by":"crossref","unstructured":"MURTY K.G.: Solving the Fixed Charge Problem by Ranking the Extreme Points. Operations Res. XVI, pp. 268\u2013279.","DOI":"10.1287\/opre.16.2.268"},{"key":"4_CR29","doi-asserted-by":"crossref","unstructured":"MURTY K.G.: Adjacency on Convex Polyhedra, SIAM. Rev. XIII, pp. 377\u2013386.","DOI":"10.1137\/1013066"},{"key":"4_CR30","unstructured":"SILVA M.: Las Redes de Petri en la Autom\u00e1tica y la Inform\u00e1tica. Editorial AC, Madrid."},{"key":"4_CR31","doi-asserted-by":"crossref","unstructured":"SILVA M., COLOM J.M.: On the Computation of Structural Synchronic Invariants in P\/T nets, Advances in Petri Nets 1988 (g. Rozenberg, ed.), LNCS 340, Springer Verlag, Berlin, pp 386\u2013417.","DOI":"10.1007\/3-540-50580-6_39"},{"key":"4_CR32","unstructured":"TOUDIC J.M.: Algorithmes d'analyse structurelle de r\u00e9seaux de Petri. These 3\u00e9me Cycle, Universit\u00e9 Pierre et Marie Curie, Paris VI, Octobre."},{"key":"4_CR33","unstructured":"TREVES N.: Le Calcul d'Invariants dans le R\u00e9seaux de Petri a Predicats Transitions Unaires. Th\u00e9se de Docteur de 3\u00e9me cycle, Univ. de Paris-Sud, Centre d'Orsay, Novembre, Paris."},{"key":"4_CR34","doi-asserted-by":"crossref","unstructured":"WILLIAMS H.P.: Fourier-Motzkin Elimination Extension to Integer Programming Problems. Journal of Combinatorial theory (A) 21, pp. 118\u2013123.","DOI":"10.1016\/0097-3165(76)90055-8"},{"key":"4_CR35","doi-asserted-by":"crossref","unstructured":"WILLIAMS H.P.: Fourier's Method of Linear Programming and its Dual, American Mathematical Monthly, Nov. 1986, pp. 681\u2013695.","DOI":"10.1080\/00029890.1986.11971923"}],"container-title":["Lecture Notes in Computer Science","Advances in Petri Nets 1990"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-53863-1_22.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,12,31]],"date-time":"2021-12-31T03:31:21Z","timestamp":1640921481000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-53863-1_22"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1991]]},"ISBN":["9783540538639","9783540463696"],"references-count":35,"URL":"https:\/\/doi.org\/10.1007\/3-540-53863-1_22","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[1991]]}}}