{"id":"https://openalex.org/W1507304612","doi":"https://doi.org/10.1007/3-540-36135-9_5","title":"A Nested Depth First Search Algorithm for Model Checking with Symmetry Reduction","display_name":"A Nested Depth First Search Algorithm for Model Checking with Symmetry Reduction","publication_year":2002,"publication_date":"2002-01-01","ids":{"openalex":"https://openalex.org/W1507304612","doi":"https://doi.org/10.1007/3-540-36135-9_5","mag":"1507304612"},"language":"en","primary_location":{"id":"doi:10.1007/3-540-36135-9_5","is_oa":true,"landing_page_url":"https://doi.org/10.1007/3-540-36135-9_5","pdf_url":"https://link.springer.com/content/pdf/10.1007%2F3-540-36135-9_5.pdf","source":{"id":"https://openalex.org/S106296714","display_name":"Lecture notes in computer science","issn_l":"0302-9743","issn":["0302-9743","1611-3349"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319900","host_organization_name":"Springer Science+Business Media","host_organization_lineage":["https://openalex.org/P4310319900","https://openalex.org/P4310319965"],"host_organization_lineage_names":["Springer Science+Business Media","Springer Nature"],"type":"book series"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Lecture Notes in Computer Science","raw_type":"book-chapter"},"type":"book-chapter","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"bronze","oa_url":"https://link.springer.com/content/pdf/10.1007%2F3-540-36135-9_5.pdf","any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5077791579","display_name":"Dragan Bo\u0161na\u010dki","orcid":"https://orcid.org/0000-0003-4371-4436"},"institutions":[{"id":"https://openalex.org/I83019370","display_name":"Eindhoven University of Technology","ror":"https://ror.org/02c2kyt77","country_code":"NL","type":"education","lineage":["https://openalex.org/I83019370"]}],"countries":["NL"],"is_corresponding":true,"raw_author_name":"Dragan Bo\u0161na\u010dki","raw_affiliation_strings":["Dept. of Math. and Computer Science, Eindhoven University of Technology, The Netherlands","EINDHOVEN UNIVERSITY OF TECHNOLOGY"],"affiliations":[{"raw_affiliation_string":"Dept. of Math. and Computer Science, Eindhoven University of Technology, The Netherlands","institution_ids":["https://openalex.org/I83019370"]},{"raw_affiliation_string":"EINDHOVEN UNIVERSITY OF TECHNOLOGY","institution_ids":["https://openalex.org/I83019370"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5077791579"],"corresponding_institution_ids":["https://openalex.org/I83019370"],"apc_list":{"value":5000,"currency":"EUR","value_usd":5392},"apc_paid":null,"fwci":1.0798,"has_fulltext":true,"cited_by_count":9,"citation_normalized_percentile":{"value":0.76028739,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":94},"biblio":{"volume":null,"issue":null,"first_page":"65","last_page":"80"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10142","display_name":"Formal Methods in Verification","score":0.9998999834060669,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T10142","display_name":"Formal Methods in Verification","score":0.9998999834060669,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T10743","display_name":"Software Testing and Debugging Techniques","score":0.9988999962806702,"subfield":{"id":"https://openalex.org/subfields/1712","display_name":"Software"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T10126","display_name":"Logic, programming, and type systems","score":0.9977999925613403,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.727134644985199},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.5828462839126587},{"id":"https://openalex.org/keywords/debugging","display_name":"Debugging","score":0.5680718421936035},{"id":"https://openalex.org/keywords/reduction","display_name":"Reduction (mathematics)","score":0.560640275478363},{"id":"https://openalex.org/keywords/bisimulation","display_name":"Bisimulation","score":0.5486713647842407},{"id":"https://openalex.org/keywords/equivalence","display_name":"Equivalence (formal languages)","score":0.525905966758728},{"id":"https://openalex.org/keywords/automaton","display_name":"Automaton","score":0.477077841758728},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.4597035348415375},{"id":"https://openalex.org/keywords/context","display_name":"Context (archaeology)","score":0.45249032974243164},{"id":"https://openalex.org/keywords/feature","display_name":"Feature (linguistics)","score":0.4290873110294342},{"id":"https://openalex.org/keywords/state-space","display_name":"State space","score":0.42809516191482544},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.2180258333683014},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.1919001042842865},{"id":"https://openalex.org/keywords/programming-language","display_name":"Programming language","score":0.09078508615493774}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.727134644985199},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.5828462839126587},{"id":"https://openalex.org/C168065819","wikidata":"https://www.wikidata.org/wiki/Q845566","display_name":"Debugging","level":2,"score":0.5680718421936035},{"id":"https://openalex.org/C111335779","wikidata":"https://www.wikidata.org/wiki/Q3454686","display_name":"Reduction (mathematics)","level":2,"score":0.560640275478363},{"id":"https://openalex.org/C135315306","wikidata":"https://www.wikidata.org/wiki/Q866364","display_name":"Bisimulation","level":2,"score":0.5486713647842407},{"id":"https://openalex.org/C2780069185","wikidata":"https://www.wikidata.org/wiki/Q7977945","display_name":"Equivalence (formal languages)","level":2,"score":0.525905966758728},{"id":"https://openalex.org/C112505250","wikidata":"https://www.wikidata.org/wiki/Q787116","display_name":"Automaton","level":2,"score":0.477077841758728},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.4597035348415375},{"id":"https://openalex.org/C2779343474","wikidata":"https://www.wikidata.org/wiki/Q3109175","display_name":"Context (archaeology)","level":2,"score":0.45249032974243164},{"id":"https://openalex.org/C2776401178","wikidata":"https://www.wikidata.org/wiki/Q12050496","display_name":"Feature (linguistics)","level":2,"score":0.4290873110294342},{"id":"https://openalex.org/C72434380","wikidata":"https://www.wikidata.org/wiki/Q230930","display_name":"State space","level":2,"score":0.42809516191482544},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.2180258333683014},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.1919001042842865},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.09078508615493774},{"id":"https://openalex.org/C86803240","wikidata":"https://www.wikidata.org/wiki/Q420","display_name":"Biology","level":0,"score":0.0},{"id":"https://openalex.org/C151730666","wikidata":"https://www.wikidata.org/wiki/Q7205","display_name":"Paleontology","level":1,"score":0.0},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.0},{"id":"https://openalex.org/C41895202","wikidata":"https://www.wikidata.org/wiki/Q8162","display_name":"Linguistics","level":1,"score":0.0},{"id":"https://openalex.org/C138885662","wikidata":"https://www.wikidata.org/wiki/Q5891","display_name":"Philosophy","level":0,"score":0.0},{"id":"https://openalex.org/C105795698","wikidata":"https://www.wikidata.org/wiki/Q12483","display_name":"Statistics","level":1,"score":0.0}],"mesh":[],"locations_count":4,"locations":[{"id":"doi:10.1007/3-540-36135-9_5","is_oa":true,"landing_page_url":"https://doi.org/10.1007/3-540-36135-9_5","pdf_url":"https://link.springer.com/content/pdf/10.1007%2F3-540-36135-9_5.pdf","source":{"id":"https://openalex.org/S106296714","display_name":"Lecture notes in computer science","issn_l":"0302-9743","issn":["0302-9743","1611-3349"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319900","host_organization_name":"Springer Science+Business Media","host_organization_lineage":["https://openalex.org/P4310319900","https://openalex.org/P4310319965"],"host_organization_lineage_names":["Springer Science+Business Media","Springer Nature"],"type":"book series"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Lecture Notes in Computer Science","raw_type":"book-chapter"},{"id":"pmh:oai:pure.tue.nl:openaire_cris_publications/c3417621-f602-4bc5-a1ff-d5c413743da1","is_oa":false,"landing_page_url":"https://research.tue.nl/en/publications/c3417621-f602-4bc5-a1ff-d5c413743da1","pdf_url":null,"source":{"id":"https://openalex.org/S4406922641","display_name":"TU/e Research Portal","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Bosnacki, D 2002, A nested depth first search algorithm for model checking with symmetry reduction. in D A Peled & M Y Vardi (eds), Formal Techniques for Networked and Distributed Systems (Proceedings 22nd IFIP WG6.1 International Conference, FORTE 2002, Houston TX, USA, November 11-14, 2002). Lecture Notes in Computer Science, vol. 2529, Springer, Berlin, pp. 65-80, 22nd IFIP WG 6.1 International Conference Formal Techniques for Networked and Distributed Systems (FORTE 2002), November 11-14, 2002, Houston, TX, USA, Houston, TX, United States, 11/11/02. https://doi.org/10.1007/3-540-36135-9_5","raw_type":"info:eu-repo/semantics/publishedVersion"},{"id":"pmh:oai:library.tue.nl:660566","is_oa":false,"landing_page_url":"http://repository.tue.nl/660566","pdf_url":null,"source":{"id":"https://openalex.org/S4406923046","display_name":"TU/e Research Portal (Eindhoven University of Technology)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"","raw_type":""},{"id":"pmh:tue:oai:pure.tue.nl:publications/c3417621-f602-4bc5-a1ff-d5c413743da1","is_oa":false,"landing_page_url":"https://research.tue.nl/nl/publications/c3417621-f602-4bc5-a1ff-d5c413743da1","pdf_url":null,"source":{"id":"https://openalex.org/S4306401843","display_name":"Data Archiving and Networked Services (DANS)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I1322597698","host_organization_name":"Royal Netherlands Academy of Arts and Sciences","host_organization_lineage":["https://openalex.org/I1322597698"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Formal Techniques for Networked and Distributed Systems (Proceedings 22nd IFIP WG6.1 International Conference, FORTE 2002, Houston TX, USA, November 11-14, 2002), 65 - 80","raw_type":"info:eu-repo/semantics/conferencepaper"}],"best_oa_location":{"id":"doi:10.1007/3-540-36135-9_5","is_oa":true,"landing_page_url":"https://doi.org/10.1007/3-540-36135-9_5","pdf_url":"https://link.springer.com/content/pdf/10.1007%2F3-540-36135-9_5.pdf","source":{"id":"https://openalex.org/S106296714","display_name":"Lecture notes in computer science","issn_l":"0302-9743","issn":["0302-9743","1611-3349"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319900","host_organization_name":"Springer Science+Business Media","host_organization_lineage":["https://openalex.org/P4310319900","https://openalex.org/P4310319965"],"host_organization_lineage_names":["Springer Science+Business Media","Springer Nature"],"type":"book series"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Lecture Notes in Computer Science","raw_type":"book-chapter"},"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":true,"pdf":true},"content_urls":{"pdf":"https://content.openalex.org/works/W1507304612.pdf","grobid_xml":"https://content.openalex.org/works/W1507304612.grobid-xml"},"referenced_works_count":17,"referenced_works":["https://openalex.org/W1485856091","https://openalex.org/W1517165545","https://openalex.org/W1536783297","https://openalex.org/W1560050980","https://openalex.org/W1604838600","https://openalex.org/W1612453857","https://openalex.org/W1655990431","https://openalex.org/W1953283412","https://openalex.org/W1972065960","https://openalex.org/W1977553951","https://openalex.org/W1984957636","https://openalex.org/W2012935476","https://openalex.org/W2019881090","https://openalex.org/W2055558998","https://openalex.org/W2166158916","https://openalex.org/W2340735175","https://openalex.org/W2912102632"],"related_works":["https://openalex.org/W1495872178","https://openalex.org/W1522712643","https://openalex.org/W4321442002","https://openalex.org/W2102135785","https://openalex.org/W2136070637","https://openalex.org/W2604841551","https://openalex.org/W2089409100","https://openalex.org/W1968437296","https://openalex.org/W2162510824","https://openalex.org/W1524401886"],"abstract_inverted_index":null,"counts_by_year":[{"year":2018,"cited_by_count":1},{"year":2017,"cited_by_count":1}],"updated_date":"2026-04-04T16:13:02.066488","created_date":"2025-10-10T00:00:00"}