{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,18]],"date-time":"2025-10-18T23:06:18Z","timestamp":1760828778629},"reference-count":36,"publisher":"Elsevier BV","issue":"1","license":[{"start":{"date-parts":[[1994,10,1]],"date-time":"1994-10-01T00:00:00Z","timestamp":780969600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2013,7,17]],"date-time":"2013-07-17T00:00:00Z","timestamp":1374019200000},"content-version":"vor","delay-in-days":6864,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Science of Computer Programming"],"published-print":{"date-parts":[[1994,10]]},"DOI":"10.1016\/0167-6423(94)00011-5","type":"journal-article","created":{"date-parts":[[2002,7,26]],"date-time":"2002-07-26T04:09:22Z","timestamp":1027656562000},"page":"55-89","source":"Crossref","is-referenced-by-count":10,"title":["Petri-net-based deadlock analysis of Process Algebra programs"],"prefix":"10.1016","volume":"23","author":[{"given":"P.","family":"Rondogiannis","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"M.H.M.","family":"Cheng","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/0167-6423(94)00011-5_BIB1","article-title":"The draft formal definition of Ada","author":"Astesiano","year":"1986","journal-title":"Consorzio per la Ricersa e le Applicazioni di Informatica"},{"key":"10.1016\/0167-6423(94)00011-5_BIB2","series-title":"Automatic Verification Methods for Finite State Systems","year":"1990"},{"key":"10.1016\/0167-6423(94)00011-5_BIB3","series-title":"Advances in Petri Nets 1990","first-page":"1","article-title":"A survey of behaviour and equivalence preserving refinements of Petri nets","author":"Brauer","year":"1991"},{"key":"10.1016\/0167-6423(94)00011-5_BIB4","series-title":"Net Theory and Applications","first-page":"277","article-title":"Reduction of nets and parallel programs","author":"Berthelot","year":"1980"},{"key":"10.1016\/0167-6423(94)00011-5_BIB5","series-title":"Advances in Petri Nets 1985","first-page":"19","article-title":"Checking properties of nets using transformations","author":"Berthelot","year":"1986"},{"key":"10.1016\/0167-6423(94)00011-5_BIB6","series-title":"Petri Nets: Central Models and their Properties","first-page":"359","article-title":"Transformations and decompositions of nets","author":"Berthelot","year":"1987"},{"key":"10.1016\/0167-6423(94)00011-5_BIB7","series-title":"Th\u00e9se d'Etat","article-title":"Transformations et analyse de reseaux de Petri\u2014Application aux Protocoles","author":"Berthelot","year":"1983"},{"key":"10.1016\/0167-6423(94)00011-5_BIB8","first-page":"164","article-title":"A method of abstraction for Petri nets","author":"Chu","year":"1987","journal-title":"Proceedings International Workshop on Petri Nets and Performance Models"},{"key":"10.1016\/0167-6423(94)00011-5_BIB9","series-title":"Mathematical Models for the Semantics of Parallelism","first-page":"144","article-title":"CCS is an (augmented) contact-free C\/E system","author":"Degano","year":"1987"},{"key":"10.1016\/0167-6423(94)00011-5_BIB10","doi-asserted-by":"crossref","first-page":"59","DOI":"10.1007\/BF02915446","article-title":"A distributed operational semantics for CCS based on condition\/event systems","volume":"26","author":"Degano","year":"1988","journal-title":"Acta Inform."},{"key":"10.1016\/0167-6423(94)00011-5_BIB11","series-title":"Linear Time, Branching Time and Partial Order in Logics and Models for Concurrency","first-page":"438","article-title":"Partial orderings, descriptions and observations of nondeterministic concurrent processes","author":"Degano","year":"1989"},{"key":"10.1016\/0167-6423(94)00011-5_BIB12","series-title":"Communicating Sequential Processes","author":"Hoare","year":"1985"},{"key":"10.1016\/0167-6423(94)00011-5_BIB13","series-title":"Algorithmic Graph Theory","author":"Gibbons","year":"1989"},{"key":"10.1016\/0167-6423(94)00011-5_BIB14","doi-asserted-by":"crossref","first-page":"321","DOI":"10.1090\/dimacs\/003\/21","article-title":"Using partial orders to improve automatic verification methods","volume":"3","author":"Godefroid","year":"1991","journal-title":"DIMACS Series in Discrete Mathematics and Theoretical Computer Science 3"},{"key":"10.1016\/0167-6423(94)00011-5_BIB15","first-page":"295","article-title":"Net implementation of optimal simulations","author":"Janicki","year":"1990","journal-title":"Proceedings 11th International Conference on Application and Theory of Petri Nets"},{"issue":"10","key":"10.1016\/0167-6423(94)00011-5_BIB16","doi-asserted-by":"crossref","first-page":"1009","DOI":"10.1109\/TCS.1981.1084918","article-title":"Additional methods for reduction and expansion of marked graphs","volume":"28","author":"Johnsonbaugh","year":"1981","journal-title":"IEEE Trans. Circuits Systems"},{"key":"10.1016\/0167-6423(94)00011-5_BIB17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","DOI":"10.1007\/3-540-10235-3","article-title":"A Calculus of Communicating Systems","author":"Milner","year":"1980"},{"key":"10.1016\/0167-6423(94)00011-5_BIB18","series-title":"Communication and Concurrency","author":"Milner","year":"1989"},{"issue":"1","key":"10.1016\/0167-6423(94)00011-5_BIB19","doi-asserted-by":"crossref","first-page":"68","DOI":"10.1109\/TCS.1980.1084711","article-title":"Reduction and expansion of live and safe marked graphs","volume":"27","author":"Murata","year":"1980","journal-title":"IEEE Trans. Circuits Systems"},{"issue":"3","key":"10.1016\/0167-6423(94)00011-5_BIB20","doi-asserted-by":"crossref","first-page":"314","DOI":"10.1109\/32.21759","article-title":"Detection of ADA static deadlocks using Petri net invariants","volume":"15","author":"Murata","year":"1989","journal-title":"IEEE Trans. Software Engrg."},{"key":"10.1016\/0167-6423(94)00011-5_BIB21","series-title":"Advances in Petri Nets 1987","article-title":"Operational Petri net semantics for CCSP","author":"Olderog","year":"1987"},{"key":"10.1016\/0167-6423(94)00011-5_BIB22","series-title":"Habilitationsschrift","article-title":"Nets, terms and formulas: three views of concurrent processes and their relationship","author":"Olderog","year":"1988"},{"key":"10.1016\/0167-6423(94)00011-5_BIB23","series-title":"Kommunikation mit Automaten","author":"Petri","year":"1962"},{"key":"10.1016\/0167-6423(94)00011-5_BIB24","article-title":"Petri Nets","volume":"4","author":"Reisig","year":"1985"},{"key":"10.1016\/0167-6423(94)00011-5_BIB25","series-title":"Master's thesis","article-title":"Detecting deadlocks in CCS agents using Petri net reduction techniques","author":"Rondogiannis","year":"1991"},{"key":"10.1016\/0167-6423(94)00011-5_BIB26","article-title":"A Prolog system for detecting deadlocks in concurrent programs","author":"Rondogiannis","year":"1992","journal-title":"Proceedings International Conference on the Practical Applications of Prolog"},{"key":"10.1016\/0167-6423(94)00011-5_BIB27","doi-asserted-by":"crossref","first-page":"343","DOI":"10.1016\/0164-1212(88)90027-1","article-title":"A Petri net framework for automatic static analysis of Ada tasking behavior","volume":"8","author":"Shatz","year":"1988","journal-title":"J. Syst. Software"},{"key":"10.1016\/0167-6423(94)00011-5_BIB28","series-title":"Technical Report UIC-EECS 91-15","article-title":"Theory and application of Petri net reduction for Ada-tasking deadlock detection","author":"Shatz","year":"1991"},{"issue":"1","key":"10.1016\/0167-6423(94)00011-5_BIB29","doi-asserted-by":"crossref","first-page":"51","DOI":"10.1016\/0022-0000(83)90029-6","article-title":"A method for stepwise refinements and abstractions of Petri Nets","volume":"27","author":"Suzuki","year":"1983","journal-title":"J. Comput. Syst. Sci."},{"key":"10.1016\/0167-6423(94)00011-5_BIB30","series-title":"Lecture Notes in Computer Science","article-title":"Finite Representations of CCS and TCSP Programs by Automata and Petri Nets","author":"Taubner","year":"1989"},{"issue":"5","key":"10.1016\/0167-6423(94)00011-5_BIB31","doi-asserted-by":"crossref","first-page":"362","DOI":"10.1145\/69586.69587","article-title":"A general-purpose algorithm for analyzing concurrent programs","volume":"26","author":"Taylor","year":"1983","journal-title":"Comm. ACM"},{"key":"10.1016\/0167-6423(94)00011-5_BIB32","doi-asserted-by":"crossref","first-page":"57","DOI":"10.1007\/BF00263928","article-title":"Complexity of analyzing the synchronization structure of concurrent programs","volume":"19","author":"Taylor","year":"1983","journal-title":"Acta Inform."},{"key":"10.1016\/0167-6423(94)00011-5_BIB33","doi-asserted-by":"crossref","DOI":"10.1109\/ICDCS.1990.89289","article-title":"Applying Petri net reduction to support Ada-tasking deadlock detection","author":"Tu","year":"1990","journal-title":"Proceedings 10th International Conference on Distributed Computing Systems"},{"key":"10.1016\/0167-6423(94)00011-5_BIB34","doi-asserted-by":"crossref","first-page":"35","DOI":"10.1016\/0022-0000(79)90050-3","article-title":"Analysis of Petri nets by stepwise refinements","volume":"18","author":"Valette","year":"1979","journal-title":"J. Comput. Syst. Sci."},{"key":"10.1016\/0167-6423(94)00011-5_BIB35","first-page":"1","article-title":"Stubborn sets for reduced state space generation","volume":"2","author":"Valmari","year":"1989","journal-title":"Proceedings 10th International Conference on Application and Theory of Petri nets"},{"key":"10.1016\/0167-6423(94)00011-5_BIB36","first-page":"82","article-title":"Behaviour preserving refinements of Petri nets","volume":"246","author":"Vogler","year":"1987"}],"container-title":["Science of Computer Programming"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0167642394000115?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0167642394000115?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,12]],"date-time":"2019-04-12T17:55:49Z","timestamp":1555091749000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0167642394000115"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1994,10]]},"references-count":36,"journal-issue":{"issue":"1","published-print":{"date-parts":[[1994,10]]}},"alternative-id":["0167642394000115"],"URL":"https:\/\/doi.org\/10.1016\/0167-6423(94)00011-5","relation":{},"ISSN":["0167-6423"],"issn-type":[{"value":"0167-6423","type":"print"}],"subject":[],"published":{"date-parts":[[1994,10]]}}}