{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,7,30]],"date-time":"2025-07-30T15:18:35Z","timestamp":1753888715532},"reference-count":34,"publisher":"Elsevier BV","issue":"3","license":[{"start":{"date-parts":[[1982,6,1]],"date-time":"1982-06-01T00:00:00Z","timestamp":391737600000},"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":11369,"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":[[1982,6]]},"DOI":"10.1016\/0304-3975(82)90067-6","type":"journal-article","created":{"date-parts":[[2002,7,25]],"date-time":"2002-07-25T23:48:55Z","timestamp":1027640935000},"page":"227-258","source":"Crossref","is-referenced-by-count":65,"title":["A unified approach for studying the properties of transition systems"],"prefix":"10.1016","volume":"18","author":[{"given":"Joseph","family":"Sifakis","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/0304-3975(82)90067-6_BIB1","first-page":"435","article-title":"Semantics and termination of non-deterministic recursive programs","author":"de Bakker","year":"1976","journal-title":"3rd International Colloquium Automata Languages and Programming"},{"key":"10.1016\/0304-3975(82)90067-6_BIB2","series-title":"Operating Systems Principles","author":"Hansen","year":"1973"},{"issue":"3","key":"10.1016\/0304-3975(82)90067-6_BIB3","doi-asserted-by":"crossref","first-page":"338","DOI":"10.1145\/357103.357109","article-title":"Synthesis of resource invariants for concurrent programs","volume":"2","author":"Clarke","year":"1980","journal-title":"ACM Trans. Progr. Languages and Systems"},{"key":"10.1016\/0304-3975(82)90067-6_BIB4","first-page":"84","article-title":"Automatic discovery of linear restraints among variables of a program","author":"Cousot","year":"1978","journal-title":"Proc. 5th ACM Symposium on Principles of Programming Languages"},{"key":"10.1016\/0304-3975(82)90067-6_BIB5","first-page":"269","article-title":"Systematic design of program analysis frameworks","author":"Cousot","year":"1979","journal-title":"Proc. 6th ACM Symposium on Principles of Programming Languages"},{"issue":"9","key":"10.1016\/0304-3975(82)90067-6_BIB6","doi-asserted-by":"crossref","first-page":"569","DOI":"10.1145\/365559.365617","article-title":"Solution of a problem in concurrent programming control","volume":"8","author":"Dijkstra","year":"1965","journal-title":"Comm. ACM"},{"issue":"11","key":"10.1016\/0304-3975(82)90067-6_BIB7","doi-asserted-by":"crossref","first-page":"643","DOI":"10.1145\/361179.361202","article-title":"Self stabilizing system in spite of distributed control","volume":"17","author":"Dijkstra","year":"1974","journal-title":"Comm. ACM"},{"issue":"8","key":"10.1016\/0304-3975(82)90067-6_BIB8","doi-asserted-by":"crossref","first-page":"453","DOI":"10.1145\/360933.360975","article-title":"Guarded commands, non determinacy and formal derivation of programs","volume":"18","author":"Dijkstra","year":"1975","journal-title":"Comm. ACM"},{"key":"10.1016\/0304-3975(82)90067-6_BIB9","series-title":"A Discipline of Programming","author":"Dijkstra","year":"1976"},{"key":"10.1016\/0304-3975(82)90067-6_BIB10","series-title":"Formal description of programming concepts","first-page":"589","article-title":"Non determinism and the correctness of parallel programs","author":"Flon","year":"1978"},{"key":"10.1016\/0304-3975(82)90067-6_BIB11","first-page":"136","article-title":"A relational model for non-deterministic programs and predicate transformers","volume":"83","author":"Guerreiro","year":"1980"},{"key":"10.1016\/0304-3975(82)90067-6_BIB12","series-title":"Research Report No. 200","article-title":"Relational semantics of strongly communicating sequential processes","author":"Guerreiro","year":"1980"},{"key":"10.1016\/0304-3975(82)90067-6_BIB13","series-title":"Analysis of production schemata by Petri nets","author":"Hack","year":"1972"},{"issue":"7","key":"10.1016\/0304-3975(82)90067-6_BIB14","doi-asserted-by":"crossref","first-page":"379","DOI":"10.1145\/358886.358892","article-title":"On folk theorems","volume":"23","author":"Harel","year":"1980","journal-title":"Comm. ACM"},{"issue":"3","key":"10.1016\/0304-3975(82)90067-6_BIB15","doi-asserted-by":"crossref","first-page":"461","DOI":"10.1145\/322077.322088","article-title":"Some properties of predicate transformers","volume":"25","author":"Hoare","year":"1978","journal-title":"JACM"},{"key":"10.1016\/0304-3975(82)90067-6_BIB16","series-title":"Technical Report No. 117","article-title":"Vector replacement systems: a formalism for modeling asynchronous systems","author":"Keller","year":"1972"},{"issue":"7","key":"10.1016\/0304-3975(82)90067-6_BIB17","doi-asserted-by":"crossref","first-page":"371","DOI":"10.1145\/360248.360251","article-title":"Formal verification of parallel programs","volume":"19","author":"Keller","year":"1976","journal-title":"Comm. ACM"},{"key":"10.1016\/0304-3975(82)90067-6_BIB18","doi-asserted-by":"crossref","first-page":"25","DOI":"10.1016\/0304-3975(77)90041-X","article-title":"On reduction of asynchronous systems","volume":"5","author":"Kwong","year":"1977","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/0304-3975(82)90067-6_BIB19","series-title":"Semantics of Concurrent computation","article-title":"On the absence of livelocks in parallel programs","volume":"70","author":"Kwong","year":"1979"},{"key":"10.1016\/0304-3975(82)90067-6_BIB20","series-title":"Report R338","article-title":"Formal derivation of strongly correct parallel programs","author":"van Lamsweerde","year":"1976"},{"key":"10.1016\/0304-3975(82)90067-6_BIB21","first-page":"174","article-title":"\u2018Sometime\u2019 is sometimes \u2018not never\u2019 \u2014On the temporal logic of programs","author":"Lamport","year":"1980","journal-title":"Proc. 7th Annual ACM Symposium on Principles of Programming Languages"},{"key":"10.1016\/0304-3975(82)90067-6_BIB22","article-title":"Liveness in Petri nets","author":"Lautenbach","year":"1975","journal-title":"GMD Internal report"},{"key":"10.1016\/0304-3975(82)90067-6_BIB23","first-page":"385","article-title":"The modal logic of programs","volume":"71","author":"Manna","year":"1979"},{"issue":"19","key":"10.1016\/0304-3975(82)90067-6_BIB24","first-page":"5","article-title":"Proving properties of processes","volume":"XI","author":"Mazurkiewicz","year":"1974","journal-title":"Algorytmy"},{"key":"10.1016\/0304-3975(82)90067-6_BIB25","first-page":"59","article-title":"Fixpoint induction and proofs of program properties","author":"Park","year":"1969","journal-title":"Machine Intelligence 5"},{"issue":"3","key":"10.1016\/0304-3975(82)90067-6_BIB26","doi-asserted-by":"crossref","first-page":"223","DOI":"10.1145\/356698.356702","article-title":"Petri-nets","volume":"9","author":"Peterson","year":"1977","journal-title":"Comput. Surveys ACM"},{"key":"10.1016\/0304-3975(82)90067-6_BIB27","first-page":"1","article-title":"The temporal semantics of concurrent programs","volume":"70","author":"Pnueli","year":"1979"},{"key":"10.1016\/0304-3975(82)90067-6_BIB28","author":"Queille","year":"1980","journal-title":"Iterative methods for the analysis of Petri nets"},{"key":"10.1016\/0304-3975(82)90067-6_BIB29","series-title":"MFCS '76","first-page":"472","article-title":"Dijkstra's predicate transformer, non-determinism, recursion and termination","volume":"45","author":"de Roever","year":"1976"},{"key":"10.1016\/0304-3975(82)90067-6_BIB30","doi-asserted-by":"crossref","first-page":"183","DOI":"10.1016\/0304-3975(76)90032-3","article-title":"Correctness of parallel programs: the Church-Rosser approach","volume":"2","author":"Rosen","year":"1976","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/0304-3975(82)90067-6_BIB31","series-title":"Th\u00e8se d'Etat","article-title":"Le contr\u00f4le des syst\u00e8mes asynchrones: concepts, propri\u00e9t\u00e9s, analyse statique","author":"Sifakis","year":"1979"},{"key":"10.1016\/0304-3975(82)90067-6_BIB32","first-page":"587","article-title":"Deadlocks and livelocks in transition systems","volume":"88","author":"Sifakis","year":"1980"},{"issue":"3","key":"10.1016\/0304-3975(82)90067-6_BIB33","doi-asserted-by":"crossref","first-page":"73","DOI":"10.2307\/2268577","article-title":"On the calculus of relations","volume":"6","author":"Tarski","year":"1941","journal-title":"J. Symbolic Logic"},{"key":"10.1016\/0304-3975(82)90067-6_BIB34","doi-asserted-by":"crossref","first-page":"285","DOI":"10.2140\/pjm.1955.5.285","article-title":"A lattice-theoretical fixpoint theorem and its applications","volume":"5","author":"Tarski","year":"1955","journal-title":"Pacific J. Math."}],"container-title":["Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0304397582900676?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0304397582900676?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:26:30Z","timestamp":1555111590000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0304397582900676"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1982,6]]},"references-count":34,"journal-issue":{"issue":"3","published-print":{"date-parts":[[1982,6]]}},"alternative-id":["0304397582900676"],"URL":"https:\/\/doi.org\/10.1016\/0304-3975(82)90067-6","relation":{},"ISSN":["0304-3975"],"issn-type":[{"value":"0304-3975","type":"print"}],"subject":[],"published":{"date-parts":[[1982,6]]}}}