{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,8,15]],"date-time":"2025-08-15T00:18:03Z","timestamp":1755217083921,"version":"3.43.0"},"reference-count":18,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[1999,11,1]],"date-time":"1999-11-01T00:00:00Z","timestamp":941414400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[1999,11,1]],"date-time":"1999-11-01T00:00:00Z","timestamp":941414400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Formal Methods in System Design"],"published-print":{"date-parts":[[1999,11]]},"DOI":"10.1023\/a:1008701202999","type":"journal-article","created":{"date-parts":[[2002,12,22]],"date-time":"2002-12-22T11:37:32Z","timestamp":1040557052000},"page":"217-238","source":"Crossref","is-referenced-by-count":17,"title":["On-the-Fly Model Checking Under Fairness that Exploits Symmetry"],"prefix":"10.1007","volume":"15","author":[{"given":"Viktor","family":"Gyuris","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"A. Prasad","family":"Sistla","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"236621_CR1","unstructured":"S. Aggarwal, R.P. Kurshan, and K.K. Sabnani, \u201cA calculus for protocol specification and validation,\u201d in H. Ruden and C. West (Eds.), Protocol Specification, Testing and Verification III, pp. 19\u201334, North-Holland, 1983."},{"key":"236621_CR2","unstructured":"A.V. Aho, J. Hopcroft, and J.D. Ullman, The Design and Analysis of Computer Algorithms, Addison-Wesley, 1974."},{"key":"236621_CR3","unstructured":"G. Bhat, R. Cleaveland, and O. Grumberg, \u201cEfficient on-the-fly modelchecking for CTL,\u201d in Proceedings of the International Conference on Logic in Computer Science, San Diego, California, 1995."},{"key":"236621_CR4","doi-asserted-by":"crossref","unstructured":"E.M. Clarke, E.A. Emerson, and A.P. Sistla, \u201cAutomatic verification of finite state concurrent programs using temporal logic: A practical approach,\u201d in Proceedings of the ACM Symposium on Principles of Programming Languages, Austin, Texas, January 1983. Also appeared in ACM TOPLAS, April 1986.","DOI":"10.1145\/567067.567080"},{"key":"236621_CR5","doi-asserted-by":"crossref","unstructured":"E.M. Clarke, T. Filkorn, and S. Jha, \u201cExploiting symmetry in temporal logic model checking,\u201d in Proceedings of the 5th International Conference on Computer Aided Verification, Crete, Greece, June 1993.","DOI":"10.1007\/3-540-56922-7_37"},{"key":"236621_CR6","doi-asserted-by":"crossref","unstructured":"R. Cleaveland, \u201cAnalyzing concurrent systems using the concurrency workbench, functional programming, concurrency, simulation, and automated reasoning,\u201d LNCS 693, Springer-Verlag, pp. 129\u2013144, 1993.","DOI":"10.1007\/3-540-56883-2_8"},{"key":"236621_CR7","unstructured":"T.H. Cormen, C.E. Leiserson, and R.L. Rivest, Introduction to Algorithms, The MIT Press, 1990."},{"key":"236621_CR8","doi-asserted-by":"crossref","unstructured":"D. Dams, O. Grumberg, and R. Gerth, \u201cGeneration of reduced models for checking fragments of CTL,\u201d CAV93, LNCS 697, Springer-Verlag, 1993.","DOI":"10.1007\/3-540-56922-7_39"},{"key":"236621_CR9","doi-asserted-by":"crossref","unstructured":"E.A. Emerson and A.P. Sistla, \u201cSymmetry and model checking,\u201d in Proceedings of the 5th International Conference on Computer Aided Verification, Crete, Greece, June 1993.","DOI":"10.1007\/3-540-56922-7_38"},{"key":"236621_CR10","doi-asserted-by":"crossref","unstructured":"E.A. Emerson and A.P. Sistla, \u201cUtilizing symmetry when model checking under fairness assumptions: An automata-theoretic approach,\u201d in Proceedings of the 7th International Conference on Computer Aided Verification, Leige, Belgium, July 1995.","DOI":"10.1007\/3-540-60045-0_59"},{"key":"236621_CR11","doi-asserted-by":"crossref","unstructured":"P. Godefroid, \u201cPartial-order methods for the verification of concurrent systems,\u201d LNCS 1032, Springer-Verlag, 1996.","DOI":"10.1007\/3-540-60761-7"},{"key":"236621_CR12","doi-asserted-by":"crossref","unstructured":"G.J. Holzmann and D. Peled, \u201cThe state of SPIN,\u201d in Proceedings of the 8th International Conference on Computer Aided Verification, July 1996.","DOI":"10.1007\/3-540-61474-5_85"},{"key":"236621_CR13","doi-asserted-by":"crossref","unstructured":"C.N. Ip and D.L. Dill, \u201cBetter verification through symmetry,\u201d Intl. Symposium on Computer Hardware Description Languages and their Application, April 1993. Also in Formal Methods in System Design\n9 1\/2, pp. 41\u201375, 1996.","DOI":"10.1007\/BF00625968"},{"key":"236621_CR14","unstructured":"K. Jensen, \u201cColored petri nets: Basic concepts, analysis methods, and practical use,\u201d Vol. 2: Analysis Methods, EATCS Monographs, Springer-Verlag, 1994."},{"key":"236621_CR15","doi-asserted-by":"crossref","unstructured":"K. Jensen and G. Rozenberg (Eds.), \u201cHigh-level petri nets: Theory and application,\u201d Springer-Verlag, 1991.","DOI":"10.1007\/978-3-642-84524-6"},{"key":"#cr-split#-236621_CR16.1","unstructured":"R.P. Kurshan, \"Testing containment of omega-regular languages,\" Bell Labs. Tech. Report 1121-861010-33 (1986)"},{"key":"#cr-split#-236621_CR16.2","unstructured":"conference version in R.P. Kurshan, \"Reducibility in analysis of coordination,\" LNCS 103, Springer-Verlag, pp. 19-39, 1987."},{"key":"236621_CR17","volume-title":"Computer aided verification of coordinated processes: The automata theoretic approach","author":"R.P. Kurshan","year":"1994","unstructured":"R.P. Kurshan, \u201cComputer aided verification of coordinated processes: The automata theoretic approach,\u201d Princeton Univerity Press, Princeton NJ, 1994."}],"container-title":["Formal Methods in System Design"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1023\/A:1008701202999.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1023\/A:1008701202999\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1023\/A:1008701202999.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,8,5]],"date-time":"2025-08-05T04:39:17Z","timestamp":1754368757000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1023\/A:1008701202999"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1999,11]]},"references-count":18,"journal-issue":{"issue":"3","published-print":{"date-parts":[[1999,11]]}},"alternative-id":["236621"],"URL":"https:\/\/doi.org\/10.1023\/a:1008701202999","relation":{},"ISSN":["0925-9856","1572-8102"],"issn-type":[{"type":"print","value":"0925-9856"},{"type":"electronic","value":"1572-8102"}],"subject":[],"published":{"date-parts":[[1999,11]]}}}