{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,1,23]],"date-time":"2024-01-23T23:05:32Z","timestamp":1706051132567},"reference-count":25,"publisher":"Elsevier BV","issue":"2","license":[{"start":{"date-parts":[[1994,12,1]],"date-time":"1994-12-01T00:00:00Z","timestamp":786240000000},"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":6803,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Theoretical Computer Science"],"published-print":{"date-parts":[[1994,12]]},"DOI":"10.1016\/0304-3975(94)90113-9","type":"journal-article","created":{"date-parts":[[2002,7,25]],"date-time":"2002-07-25T23:47:32Z","timestamp":1027640852000},"page":"377-404","source":"Crossref","is-referenced-by-count":4,"title":["Fair Petri nets and structural induction for rings of processes"],"prefix":"10.1016","volume":"135","author":[{"given":"Jianan","family":"Li","sequence":"first","affiliation":[]},{"given":"Ichiro","family":"Suzuki","sequence":"additional","affiliation":[]},{"given":"Masafumi","family":"Yamashita","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/0304-3975(94)90113-9_BIB1","doi-asserted-by":"crossref","first-page":"307","DOI":"10.1016\/0020-0190(86)90071-2","article-title":"Limits for automatic verification of finite-state concurrent systems","volume":"15","author":"Apt","year":"1986","journal-title":"Inform. Process. Lett."},{"issue":"2","key":"10.1016\/0304-3975(94)90113-9_BIB2","article-title":"The undecidability of propositional temporal logic for Petri nets","volume":"6","author":"Cherkasova","year":"1987","journal-title":"Comput. Artificial Intelligence"},{"key":"10.1016\/0304-3975(94)90113-9_BIB3","doi-asserted-by":"crossref","first-page":"240","DOI":"10.1145\/10590.10611","article-title":"Reasoning about networks with many identical finite-state processes","author":"Clarke","year":"1986","journal-title":"Proc. 5th Annual ACM Symposium on Principles of Distributed Computing"},{"issue":"2","key":"10.1016\/0304-3975(94)90113-9_BIB4","doi-asserted-by":"crossref","first-page":"115","DOI":"10.1007\/BF00289519","article-title":"Hierarchical ordering of sequential processes","volume":"1","author":"Dijkstra","year":"1971","journal-title":"Acta Inform."},{"key":"10.1016\/0304-3975(94)90113-9_BIB5","series-title":"Technical Report TR88-378.02","article-title":"Reasoning about systems with many processes","author":"German","year":"1988"},{"key":"10.1016\/0304-3975(94)90113-9_BIB6","doi-asserted-by":"crossref","first-page":"305","DOI":"10.1016\/0304-3975(89)90053-4","article-title":"Problems concerning fairness and temporal logic for conflict-free Petri nets","volume":"64","author":"Howell","year":"1989","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/0304-3975(94)90113-9_BIB7","doi-asserted-by":"crossref","first-page":"341","DOI":"10.1016\/0304-3975(91)90228-T","article-title":"A taxonomy of fairness and temporal logic problem for Petri nets","volume":"82","author":"Howell","year":"1991","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/0304-3975(94)90113-9_BIB8","first-page":"239","article-title":"A structural induction theorem for processes","author":"Kurshan","year":"1989","journal-title":"Proc. 8th ACM Symp. Principles of Distributed Computing"},{"issue":"2","key":"10.1016\/0304-3975(94)90113-9_BIB9","doi-asserted-by":"crossref","first-page":"115","DOI":"10.1109\/32.265633","article-title":"A new structural induction theorem for rings of temporal Petri nets","volume":"20","author":"Li","year":"1994","journal-title":"IEEE Transactions on Software Engineering"},{"key":"10.1016\/0304-3975(94)90113-9_BIB11_1","first-page":"823","article-title":"Application of temporal Petri nets to verification of handshake daisy chain arbiters","author":"Lu","year":"1987","journal-title":"Proceedings of the 29th Midwest Symposium on Circuits and Systems"},{"key":"10.1016\/0304-3975(94)90113-9_BIB11_2","series-title":"The Correctness Problem in Computer Science","first-page":"215","article-title":"Verification of concurrent programs: the temporal frame-work","author":"Manna","year":"1981"},{"issue":"2","key":"10.1016\/0304-3975(94)90113-9_BIB12","doi-asserted-by":"crossref","first-page":"68","DOI":"10.1145\/357233.357237","article-title":"Synthesis of communication processes from temporal logic specifications","volume":"6","author":"Manna","year":"1984","journal-title":"ACM Transactions Programming Languages and Systems"},{"key":"10.1016\/0304-3975(94)90113-9_BIB13","doi-asserted-by":"crossref","first-page":"265","DOI":"10.1016\/0167-6423(85)90015-2","article-title":"Distributed mutual exclusion on a ring of processes","volume":"5","author":"Martin","year":"1985","journal-title":"Sci. Comput. Programming"},{"issue":"4","key":"10.1016\/0304-3975(94)90113-9_BIB14","doi-asserted-by":"crossref","first-page":"541","DOI":"10.1109\/5.24143","article-title":"Petri nets: Properties, analysis and applications","volume":"77","author":"Murata","year":"1989","journal-title":"Proc. IEEE"},{"key":"10.1016\/0304-3975(94)90113-9_BIB15","first-page":"167","article-title":"Concurrency and automata on infinite sequences","volume":"104","author":"Park","year":"1981"},{"key":"10.1016\/0304-3975(94)90113-9_BIB16","doi-asserted-by":"crossref","first-page":"37","DOI":"10.1109\/T-C.1972.223429","article-title":"Asynchronous arbiters","author":"Plummer","year":"1972","journal-title":"IEEE Transactions on Computers C-21"},{"key":"10.1016\/0304-3975(94)90113-9_BIB17","first-page":"46","article-title":"The temporal logic of programs","author":"Pnueli","year":"1977","journal-title":"Proc. 18th Symp. on Foundations of Computer Science"},{"key":"10.1016\/0304-3975(94)90113-9_BIB18","doi-asserted-by":"crossref","first-page":"217","DOI":"10.1016\/0304-3975(87)90008-9","article-title":"The complementation problem for Buchi automata with applications to temporal logic","volume":"49","author":"Sistla","year":"1987","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/0304-3975(94)90113-9_BIB19","series-title":"Proceedings of the 9th Annual Conference on Information Sciences and Systems","first-page":"641","article-title":"Fundamental properties and applications of temporal Petri nets","author":"Suzuki","year":"1985"},{"key":"10.1016\/0304-3975(94)90113-9_BIB20","doi-asserted-by":"crossref","first-page":"213","DOI":"10.1016\/0020-0190(88)90211-6","article-title":"Proving properties of a ring of finite state machines","volume":"28","author":"Suzuki","year":"1988","journal-title":"Inform. Process. Lett."},{"issue":"11","key":"10.1016\/0304-3975(94)90113-9_BIB21","doi-asserted-by":"crossref","first-page":"1273","DOI":"10.1109\/32.60315","article-title":"Formal analysis of the alternating bit protocol by temporal Petri nets","volume":"16","author":"Suzuki","year":"1990","journal-title":"IEEE Trans. Software Engng."},{"issue":"5","key":"10.1016\/0304-3975(94)90113-9_BIB22","doi-asserted-by":"crossref","first-page":"696","DOI":"10.1109\/12.24271","article-title":"Temporal Petri nets and their application to modeling and analysis of handshake daisy chain arbiter","volume":"38","author":"Suzuki","year":"1989","journal-title":"IEEE Trans. Comput."},{"issue":"12","key":"10.1016\/0304-3975(94)90113-9_BIB23","first-page":"2001","article-title":"Verification and synthesis of concurrent programs using Petri nets and temporal logic","volume":"E73","author":"Uchihira","year":"1990","journal-title":"Trans. IEICE"},{"key":"10.1016\/0304-3975(94)90113-9_BIB24","doi-asserted-by":"crossref","first-page":"311","DOI":"10.1016\/0304-3975(83)90115-9","article-title":"Infinite behavior of Petri nets","volume":"25","author":"Valk","year":"1983","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/0304-3975(94)90113-9_BIB25","series-title":"Automatic Verification Methods for Finite State Systems","first-page":"68","article-title":"Verifying properties of large sets of processes with network invariants","volume":"407","author":"Wolper","year":"1990"}],"container-title":["Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0304397594901139?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0304397594901139?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,12]],"date-time":"2019-04-12T23:52:02Z","timestamp":1555113122000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0304397594901139"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1994,12]]},"references-count":25,"journal-issue":{"issue":"2","published-print":{"date-parts":[[1994,12]]}},"alternative-id":["0304397594901139"],"URL":"https:\/\/doi.org\/10.1016\/0304-3975(94)90113-9","relation":{},"ISSN":["0304-3975"],"issn-type":[{"value":"0304-3975","type":"print"}],"subject":[],"published":{"date-parts":[[1994,12]]}}}