{"id":"https://openalex.org/W1523327481","doi":"https://doi.org/10.1007/11691372_8","title":"Efficient Guided Symbolic Reachability Using Reachability Expressions","display_name":"Efficient Guided Symbolic Reachability Using Reachability Expressions","publication_year":2006,"publication_date":"2006-01-01","ids":{"openalex":"https://openalex.org/W1523327481","doi":"https://doi.org/10.1007/11691372_8","mag":"1523327481"},"language":"en","primary_location":{"id":"doi:10.1007/11691372_8","is_oa":false,"landing_page_url":"https://doi.org/10.1007/11691372_8","pdf_url":null,"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":false,"oa_status":"closed","oa_url":null,"any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5042234872","display_name":"Dina Thomas","orcid":null},"institutions":[{"id":"https://openalex.org/I162827531","display_name":"Indian Institute of Technology Bombay","ror":"https://ror.org/02qyf5152","country_code":"IN","type":"education","lineage":["https://openalex.org/I162827531"]}],"countries":["IN"],"is_corresponding":true,"raw_author_name":"Dina Thomas","raw_affiliation_strings":["Indian Institute of Technology, Bombay, India"],"affiliations":[{"raw_affiliation_string":"Indian Institute of Technology, Bombay, India","institution_ids":["https://openalex.org/I162827531"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5089236765","display_name":"Supratik Chakraborty","orcid":"https://orcid.org/0000-0002-7527-7675"},"institutions":[{"id":"https://openalex.org/I162827531","display_name":"Indian Institute of Technology Bombay","ror":"https://ror.org/02qyf5152","country_code":"IN","type":"education","lineage":["https://openalex.org/I162827531"]}],"countries":["IN"],"is_corresponding":false,"raw_author_name":"Supratik Chakraborty","raw_affiliation_strings":["Indian Institute of Technology, Bombay, India"],"affiliations":[{"raw_affiliation_string":"Indian Institute of Technology, Bombay, India","institution_ids":["https://openalex.org/I162827531"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5027806769","display_name":"Paritosh K. Pandya","orcid":"https://orcid.org/0000-0001-7085-0148"},"institutions":[{"id":"https://openalex.org/I11947397","display_name":"Tata Institute of Fundamental Research","ror":"https://ror.org/03ht1xw27","country_code":"IN","type":"education","lineage":["https://openalex.org/I11947397","https://openalex.org/I2799351866","https://openalex.org/I3149292468"]}],"countries":["IN"],"is_corresponding":false,"raw_author_name":"Paritosh Pandya","raw_affiliation_strings":["Tata Institute of Fundamental Research, India"],"affiliations":[{"raw_affiliation_string":"Tata Institute of Fundamental Research, India","institution_ids":["https://openalex.org/I11947397"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5042234872"],"corresponding_institution_ids":["https://openalex.org/I162827531"],"apc_list":{"value":5000,"currency":"EUR","value_usd":5392},"apc_paid":null,"fwci":2.5103,"has_fulltext":false,"cited_by_count":7,"citation_normalized_percentile":{"value":0.87953263,"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":"120","last_page":"134"},"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/T10904","display_name":"Embedded Systems Design Techniques","score":0.9986000061035156,"subfield":{"id":"https://openalex.org/subfields/1708","display_name":"Hardware and Architecture"},"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/T10933","display_name":"Real-Time Systems Scheduling","score":0.9961000084877014,"subfield":{"id":"https://openalex.org/subfields/1708","display_name":"Hardware and Architecture"},"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/reachability","display_name":"Reachability","score":0.9712552428245544},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.7830283641815186},{"id":"https://openalex.org/keywords/automaton","display_name":"Automaton","score":0.6796375513076782},{"id":"https://openalex.org/keywords/asynchronous-communication","display_name":"Asynchronous communication","score":0.6397538185119629},{"id":"https://openalex.org/keywords/equivalence","display_name":"Equivalence (formal languages)","score":0.5965139269828796},{"id":"https://openalex.org/keywords/reachability-problem","display_name":"Reachability problem","score":0.5259647369384766},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.49969935417175293},{"id":"https://openalex.org/keywords/model-checking","display_name":"Model checking","score":0.45036551356315613},{"id":"https://openalex.org/keywords/set","display_name":"Set (abstract data type)","score":0.42569243907928467},{"id":"https://openalex.org/keywords/formal-equivalence-checking","display_name":"Formal equivalence checking","score":0.41986048221588135},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.3935295641422272},{"id":"https://openalex.org/keywords/programming-language","display_name":"Programming language","score":0.2148110568523407},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.20388099551200867},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.1831594705581665}],"concepts":[{"id":"https://openalex.org/C136643341","wikidata":"https://www.wikidata.org/wiki/Q1361526","display_name":"Reachability","level":2,"score":0.9712552428245544},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7830283641815186},{"id":"https://openalex.org/C112505250","wikidata":"https://www.wikidata.org/wiki/Q787116","display_name":"Automaton","level":2,"score":0.6796375513076782},{"id":"https://openalex.org/C151319957","wikidata":"https://www.wikidata.org/wiki/Q752739","display_name":"Asynchronous communication","level":2,"score":0.6397538185119629},{"id":"https://openalex.org/C2780069185","wikidata":"https://www.wikidata.org/wiki/Q7977945","display_name":"Equivalence (formal languages)","level":2,"score":0.5965139269828796},{"id":"https://openalex.org/C2777669093","wikidata":"https://www.wikidata.org/wiki/Q17141570","display_name":"Reachability problem","level":3,"score":0.5259647369384766},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.49969935417175293},{"id":"https://openalex.org/C110251889","wikidata":"https://www.wikidata.org/wiki/Q1569697","display_name":"Model checking","level":2,"score":0.45036551356315613},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.42569243907928467},{"id":"https://openalex.org/C96654402","wikidata":"https://www.wikidata.org/wiki/Q5469962","display_name":"Formal equivalence checking","level":3,"score":0.41986048221588135},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.3935295641422272},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.2148110568523407},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.20388099551200867},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.1831594705581665},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1007/11691372_8","is_oa":false,"landing_page_url":"https://doi.org/10.1007/11691372_8","pdf_url":null,"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"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":17,"referenced_works":["https://openalex.org/W1482530017","https://openalex.org/W1486272257","https://openalex.org/W1489391022","https://openalex.org/W1523327481","https://openalex.org/W1595213177","https://openalex.org/W2006228911","https://openalex.org/W2008212717","https://openalex.org/W2061438988","https://openalex.org/W2080267935","https://openalex.org/W2118837621","https://openalex.org/W2120005189","https://openalex.org/W2125759056","https://openalex.org/W2150119568","https://openalex.org/W2150309803","https://openalex.org/W3149523047","https://openalex.org/W4249269563","https://openalex.org/W4285719527"],"related_works":["https://openalex.org/W2884574904","https://openalex.org/W2130664212","https://openalex.org/W4253760428","https://openalex.org/W2047831585","https://openalex.org/W1554767603","https://openalex.org/W3208672221","https://openalex.org/W3017277461","https://openalex.org/W4287199681","https://openalex.org/W2032445854","https://openalex.org/W1565729639"],"abstract_inverted_index":null,"counts_by_year":[{"year":2016,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}