{"id":"https://openalex.org/W1524646280","doi":"https://doi.org/10.1007/978-3-642-02930-1_20","title":"LTL Path Checking Is Efficiently Parallelizable","display_name":"LTL Path Checking Is Efficiently Parallelizable","publication_year":2009,"publication_date":"2009-01-01","ids":{"openalex":"https://openalex.org/W1524646280","doi":"https://doi.org/10.1007/978-3-642-02930-1_20","mag":"1524646280"},"language":"en","primary_location":{"id":"doi:10.1007/978-3-642-02930-1_20","is_oa":false,"landing_page_url":"https://doi.org/10.1007/978-3-642-02930-1_20","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/A5058480266","display_name":"Lars Kuhtz","orcid":null},"institutions":[{"id":"https://openalex.org/I91712215","display_name":"Saarland University","ror":"https://ror.org/01jdpyv68","country_code":"DE","type":"education","lineage":["https://openalex.org/I91712215"]}],"countries":["DE"],"is_corresponding":true,"raw_author_name":"Lars Kuhtz","raw_affiliation_strings":["Universit\u00e4t des Saarlandes, 66123, Saarbr\u00fccken, Germany"],"affiliations":[{"raw_affiliation_string":"Universit\u00e4t des Saarlandes, 66123, Saarbr\u00fccken, Germany","institution_ids":["https://openalex.org/I91712215"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5048189898","display_name":"Bernd Finkbeiner","orcid":"https://orcid.org/0000-0002-4280-8441"},"institutions":[{"id":"https://openalex.org/I91712215","display_name":"Saarland University","ror":"https://ror.org/01jdpyv68","country_code":"DE","type":"education","lineage":["https://openalex.org/I91712215"]}],"countries":["DE"],"is_corresponding":false,"raw_author_name":"Bernd Finkbeiner","raw_affiliation_strings":["Universit\u00e4t des Saarlandes, 66123, Saarbr\u00fccken, Germany"],"affiliations":[{"raw_affiliation_string":"Universit\u00e4t des Saarlandes, 66123, Saarbr\u00fccken, Germany","institution_ids":["https://openalex.org/I91712215"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5058480266"],"corresponding_institution_ids":["https://openalex.org/I91712215"],"apc_list":{"value":5000,"currency":"EUR","value_usd":5392},"apc_paid":null,"fwci":2.6066,"has_fulltext":false,"cited_by_count":23,"citation_normalized_percentile":{"value":0.90305281,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":89,"max":97},"biblio":{"volume":null,"issue":null,"first_page":"235","last_page":"246"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10142","display_name":"Formal Methods in Verification","score":0.9961000084877014,"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.9961000084877014,"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.9939000010490417,"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/T12326","display_name":"Network Packet Processing and Optimization","score":0.9373000264167786,"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/parallelizable-manifold","display_name":"Parallelizable manifold","score":0.9759311676025391},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.8490349054336548},{"id":"https://openalex.org/keywords/path","display_name":"Path (computing)","score":0.6358409523963928},{"id":"https://openalex.org/keywords/model-checking","display_name":"Model checking","score":0.5578271746635437},{"id":"https://openalex.org/keywords/parallel-computing","display_name":"Parallel computing","score":0.44870510697364807},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.39007461071014404},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.38942545652389526},{"id":"https://openalex.org/keywords/programming-language","display_name":"Programming language","score":0.2789061665534973}],"concepts":[{"id":"https://openalex.org/C148047603","wikidata":"https://www.wikidata.org/wiki/Q1014612","display_name":"Parallelizable manifold","level":2,"score":0.9759311676025391},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.8490349054336548},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.6358409523963928},{"id":"https://openalex.org/C110251889","wikidata":"https://www.wikidata.org/wiki/Q1569697","display_name":"Model checking","level":2,"score":0.5578271746635437},{"id":"https://openalex.org/C173608175","wikidata":"https://www.wikidata.org/wiki/Q232661","display_name":"Parallel computing","level":1,"score":0.44870510697364807},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.39007461071014404},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.38942545652389526},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.2789061665534973}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1007/978-3-642-02930-1_20","is_oa":false,"landing_page_url":"https://doi.org/10.1007/978-3-642-02930-1_20","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"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.379.7480","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.379.7480","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.avacs.org/fileadmin/Publikationen/Open/kuhtz.icalp09.pdf","raw_type":"text"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":26,"referenced_works":["https://openalex.org/W105220891","https://openalex.org/W154638891","https://openalex.org/W1479975624","https://openalex.org/W1489725951","https://openalex.org/W1491593738","https://openalex.org/W1559902149","https://openalex.org/W1562978104","https://openalex.org/W1563199150","https://openalex.org/W1827805140","https://openalex.org/W1998855954","https://openalex.org/W2009121158","https://openalex.org/W2026379532","https://openalex.org/W2028637393","https://openalex.org/W2031848583","https://openalex.org/W2101931376","https://openalex.org/W2105167627","https://openalex.org/W2118962824","https://openalex.org/W2126606154","https://openalex.org/W2127585076","https://openalex.org/W2154932413","https://openalex.org/W2181189727","https://openalex.org/W2182584682","https://openalex.org/W2485462522","https://openalex.org/W2497162265","https://openalex.org/W2914665703","https://openalex.org/W4285719527"],"related_works":["https://openalex.org/W4285069850","https://openalex.org/W1974634278","https://openalex.org/W4240963716","https://openalex.org/W2891970004","https://openalex.org/W4301075503","https://openalex.org/W1596637634","https://openalex.org/W4289687320","https://openalex.org/W2116366046","https://openalex.org/W925418074","https://openalex.org/W2119610731"],"abstract_inverted_index":null,"counts_by_year":[{"year":2021,"cited_by_count":2},{"year":2019,"cited_by_count":3},{"year":2018,"cited_by_count":3},{"year":2017,"cited_by_count":2},{"year":2016,"cited_by_count":1},{"year":2015,"cited_by_count":1},{"year":2014,"cited_by_count":2},{"year":2013,"cited_by_count":1},{"year":2012,"cited_by_count":2}],"updated_date":"2026-04-05T17:49:38.594831","created_date":"2025-10-10T00:00:00"}