{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,1,21]],"date-time":"2025-01-21T05:05:49Z","timestamp":1737435949765,"version":"3.33.0"},"publisher-location":"Berlin, Heidelberg","reference-count":22,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540417910"},{"type":"electronic","value":"9783540452515"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2001]]},"DOI":"10.1007\/3-540-45251-6_30","type":"book-chapter","created":{"date-parts":[[2007,8,12]],"date-time":"2007-08-12T05:53:28Z","timestamp":1186898008000},"page":"518-533","source":"Crossref","is-referenced-by-count":8,"title":["A Heuristic for Symmetry Reductions with Scalarsets"],"prefix":"10.1007","author":[{"given":"Dragan","family":"Bo\u0161na\u010dki","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Leszek","family":"Holenderski","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Dennis","family":"Dams","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2001,3,16]]},"reference":[{"key":"30_CR1","unstructured":"D. Bo\u0161sna\u010dki, Enhancing State Space Reduction Techniques for Model Checking, Ph.D. Thesis, Department of Computer Science, Eindhoven University of Technology, expected in 2001."},{"key":"30_CR2","doi-asserted-by":"crossref","unstructured":"D. Bo\u0161na\u010dki, D. Dams, Integrating real time into Spin: a prototype implementation, in S. Budkowski, A. Cavalli, E. Najm (eds), Proc. of FORTE\/PSTV\u201998 (Formal Description Techniques and Protocol Specification, Testing and Verification), pp. 423\u2013438, Paris, France, 1998.","DOI":"10.1007\/978-0-387-35394-4_26"},{"key":"30_CR3","series-title":"Lect Notes Comput Sci","first-page":"1","volume-title":"SPIN\u20192000 (The 7th International SPIN Workshop on Model Checking of Software)","author":"D. Bo\u0161na\u010dki","year":"2000","unstructured":"D. Bo\u0161na\u010dki, D. Dams, L. Holenderski, Symmetric Spin, SPIN\u20192000 (The 7th International SPIN Workshop on Model Checking of Software), pp. 1\u201319, LNCS 1885, 2000."},{"key":"30_CR4","doi-asserted-by":"publisher","first-page":"77","DOI":"10.1007\/BF00625969","volume":"19","author":"E.M. Clarke","year":"1996","unstructured":"E.M. Clarke, R. Enders, T. Filkorn, S. Jha, Exploiting symmetry in temporal logic model checking, Formal Methods in System Design, Vol. 19, pp. 77\u2013104, 1996.","journal-title":"Formal Methods in System Design"},{"key":"30_CR5","unstructured":"E.M. Clarke, O. Grumberg, D.A. Peled, Model Checking, The MIT Press, 2000."},{"key":"30_CR6","doi-asserted-by":"crossref","unstructured":"C. Courcoubetis, M. Vardi, P. Wolper, M. Yannakakis, Memory eficient algorithm for the verification of temporal properties, Formal Methods in System Design I, pp. 275\u2013288, 1992.","DOI":"10.1007\/BF00121128"},{"key":"30_CR7","unstructured":"I. Dravapoulos, N. Pronios, S. Denazis et al, The Magic WAND, Deliverable 3D2, Wireless ATM MAC, Sep 1997."},{"key":"30_CR8","doi-asserted-by":"crossref","unstructured":"E.A. Emerson, Temporal and modal logic, in Jan van Leeuwen (ed.), Formal Models and Semantic, Vol. B of Handbook of Theoretical Computer Science, Chap. 16, pp. 995\u20131072, Elsevier\/The MIT Press, 1990.","DOI":"10.1016\/B978-0-444-88074-1.50021-4"},{"key":"30_CR9","series-title":"Lect Notes Comput Sci","doi-asserted-by":"publisher","first-page":"19","DOI":"10.1007\/BFb0035378","volume-title":"Proc. of TACAS\u201997 (Tools and Algorithms for the Construction and Analysis of Systems)","author":"E.A. Emerson","year":"1997","unstructured":"E.A. Emerson, S. Jha, D. Peled, Combining partial order and symmetry reductions, in Ed Brinksma (ed.), Proc. of TACAS\u201997 (Tools and Algorithms for the Construction and Analysis of Systems), LNCS 1217, pp. 19\u201334, Springer, 1997."},{"key":"30_CR10","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"463","DOI":"10.1007\/3-540-56922-7_38","volume-title":"Proc. of CAV\u201993 (Computer Aided Verification)","author":"E.A. Emerson","year":"1993","unstructured":"E.A. Emerson, A.P. Sistla, Symmetry and model checking, in C. Courcoubetis (ed.), Proc. of CAV\u201993 (Computer Aided Verification), LNCS 697, pp. 463\u2013478, Springer, 1993."},{"key":"30_CR11","doi-asserted-by":"crossref","unstructured":"E.A. Emerson, R.J. Trefler, Model checking real-time properties of symmetric systems, Proc. of the 23rd International Symposium on Mathematical Foundations of Computer Science (MFCS), pp. 427\u2013436, Aug. 1998.","DOI":"10.1007\/BFb0055792"},{"key":"30_CR12","volume-title":"Proc. of CHARME\u201999 (The 10th IFIP WG10.5 Advanced Research Working Conference on Correct Hardware Design and Verification Methods)","author":"E.A. Emerson","year":"1999","unstructured":"E.A. Emerson, R.J. Trefler, From asymmetry to full symmetry: new techniques for symmetry reduction in model checking, Proc. of CHARME\u201999 (The 10th IFIP WG10.5 Advanced Research Working Conference on Correct Hardware Design and Verification Methods), Bad Herrenalb, Germany, Sep. 1999."},{"issue":"4","key":"30_CR13","doi-asserted-by":"publisher","first-page":"617","DOI":"10.1145\/262004.262008","volume":"19","author":"E.A. Emerson","year":"1997","unstructured":"E.A. Emerson, A.P. Sistla, Utilizing symmetry when model-checking under fairness assumptions: an automata-theoretic approach, ACM Transactions on Pro-gramming Languages and Systems, 19(4):617\u2013638, July 1997.","journal-title":"ACM Transactions on Pro-gramming Languages and Systems"},{"key":"30_CR14","doi-asserted-by":"crossref","unstructured":"P. Godefroid, Exploiting symmetry when model-checking software, Proc. of FORTE\/PSTV\u201999 (Formal Methods for Protocol Engineering and Distributed Systems), pp. 257\u2013275, Beijing, Oct. 1999.","DOI":"10.1007\/978-0-387-35578-8_15"},{"key":"30_CR15","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"232","DOI":"10.1007\/3-540-63166-6_24","volume-title":"Proc. of CAV\u201997 (Computer Aided Verification)","author":"V. Gyuris","year":"1997","unstructured":"V. Gyuris, A.P. Sistla, On-the-fly model checking under fairness that exploits symmetry, in O. Grumberg (ed.), Proc. of CAV\u201997 (Computer Aided Verification), LNCS 1254, pp. 232\u2013243, Springer, 1997."},{"key":"30_CR16","unstructured":"G.J. Holzmann, Design and Validation of Communication Protocols, Prentice Hall, 1991. Also: http:\/\/netlib.bell-labs.com\/netlib\/spin\/whatispin.html"},{"key":"30_CR17","unstructured":"VEfication through symmetry, in D. Agnew, L. Claesen, R. Camposano (eds), Proc. of the 1993 Conference on Computer Hardware Description Languages and their Applications, Apr. 1993."},{"key":"30_CR18","doi-asserted-by":"publisher","first-page":"41","DOI":"10.1007\/BF00625968","volume":"9","author":"C.N. Ip","year":"1996","unstructured":"C.N. Ip, D.L. Dill, Better verification through symmetry. Formal Methods in System Design, Vol. 9, pp. 41\u201375, 1996.","journal-title":"Formal Methods in System Design"},{"key":"30_CR19","unstructured":"C.N. Ip, State Reduction Methods for Automatic Formal Verification, Ph.D. thesis, Department of Computer Science of Stanford University, Dec 1996."},{"key":"30_CR20","unstructured":"N.A. Lynch, Distributed Algorithms, Morgan Kaufmann Publishers, 1996."},{"key":"30_CR21","doi-asserted-by":"crossref","unstructured":"R. Nalumasu, G. Gopalakrishnan, Explicit-enumeration based Verification made Memory-eficient, Proc. of CHDL\u201995 (Computer Hardware Description Languages), 617\u2013622, Chiba, Japan, Aug. 1995.","DOI":"10.1109\/ASPDAC.1995.486378"},{"key":"30_CR22","series-title":"Lect Notes Comput Sci","first-page":"491","volume-title":"Advances in Petri Nets","author":"A. Valmari","year":"1990","unstructured":"A. Valmari, Stubborn sets for reduced state space generation, Advances in Petri Nets 1990, LNCS 483, pp. 491\u2013515, Springer, 1991."}],"container-title":["Lecture Notes in Computer Science","FME 2001: Formal Methods for Increasing Software Productivity"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-45251-6_30","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,1,20]],"date-time":"2025-01-20T08:45:32Z","timestamp":1737362732000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-45251-6_30"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2001]]},"ISBN":["9783540417910","9783540452515"],"references-count":22,"URL":"https:\/\/doi.org\/10.1007\/3-540-45251-6_30","relation":{},"ISSN":["0302-9743"],"issn-type":[{"type":"print","value":"0302-9743"}],"subject":[],"published":{"date-parts":[[2001]]}}}