{"id":"https://openalex.org/W2021255060","doi":"https://doi.org/10.1016/s0304-3975(01)00330-9","title":"Model checking of systems with many identical timed processes","display_name":"Model checking of systems with many identical timed processes","publication_year":2002,"publication_date":"2002-10-28","ids":{"openalex":"https://openalex.org/W2021255060","doi":"https://doi.org/10.1016/s0304-3975(01)00330-9","mag":"2021255060"},"language":"en","primary_location":{"id":"doi:10.1016/s0304-3975(01)00330-9","is_oa":false,"landing_page_url":"https://doi.org/10.1016/s0304-3975(01)00330-9","pdf_url":null,"source":{"id":"https://openalex.org/S90727058","display_name":"Theoretical Computer Science","issn_l":"0304-3975","issn":["0304-3975","1879-2294"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320990","host_organization_name":"Elsevier BV","host_organization_lineage":["https://openalex.org/P4310320990"],"host_organization_lineage_names":["Elsevier BV"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Theoretical Computer Science","raw_type":"journal-article"},"type":"article","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/A5002478680","display_name":"Parosh Aziz Abdulla","orcid":"https://orcid.org/0000-0001-6832-6611"},"institutions":[{"id":"https://openalex.org/I123387679","display_name":"Uppsala University","ror":"https://ror.org/048a87296","country_code":"SE","type":"education","lineage":["https://openalex.org/I123387679"]}],"countries":["SE"],"is_corresponding":false,"raw_author_name":"Parosh Aziz Abdulla","raw_affiliation_strings":["Department of Computer Systems, Uppsala University, PO Box 325 S-751 05 Uppsala, Sweden"],"affiliations":[{"raw_affiliation_string":"Department of Computer Systems, Uppsala University, PO Box 325 S-751 05 Uppsala, Sweden","institution_ids":["https://openalex.org/I123387679"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5009514870","display_name":"Bengt J\u00f6nsson","orcid":"https://orcid.org/0000-0001-7897-601X"},"institutions":[{"id":"https://openalex.org/I123387679","display_name":"Uppsala University","ror":"https://ror.org/048a87296","country_code":"SE","type":"education","lineage":["https://openalex.org/I123387679"]}],"countries":["SE"],"is_corresponding":true,"raw_author_name":"Bengt Jonsson","raw_affiliation_strings":["Department of Computer Systems, Uppsala University, PO Box 325 S-751 05 Uppsala, Sweden"],"affiliations":[{"raw_affiliation_string":"Department of Computer Systems, Uppsala University, PO Box 325 S-751 05 Uppsala, Sweden","institution_ids":["https://openalex.org/I123387679"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5009514870"],"corresponding_institution_ids":["https://openalex.org/I123387679"],"apc_list":{"value":2690,"currency":"USD","value_usd":2690},"apc_paid":null,"fwci":3.1495,"has_fulltext":false,"cited_by_count":78,"citation_normalized_percentile":{"value":0.92074032,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":90,"max":99},"biblio":{"volume":"290","issue":"1","first_page":"241","last_page":"264"},"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/T10126","display_name":"Logic, programming, and type systems","score":0.9939000010490417,"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"}},{"id":"https://openalex.org/T11450","display_name":"Model-Driven Software Engineering Techniques","score":0.9926000237464905,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/timed-automaton","display_name":"Timed automaton","score":0.8283590078353882},{"id":"https://openalex.org/keywords/reachability","display_name":"Reachability","score":0.7752357721328735},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.7459734678268433},{"id":"https://openalex.org/keywords/petri-net","display_name":"Petri net","score":0.6821671724319458},{"id":"https://openalex.org/keywords/automaton","display_name":"Automaton","score":0.6639177799224854},{"id":"https://openalex.org/keywords/decidability","display_name":"Decidability","score":0.6613032817840576},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.5865337252616882},{"id":"https://openalex.org/keywords/reachability-problem","display_name":"Reachability problem","score":0.5783037543296814},{"id":"https://openalex.org/keywords/model-checking","display_name":"Model checking","score":0.5714597702026367},{"id":"https://openalex.org/keywords/mutual-exclusion","display_name":"Mutual exclusion","score":0.5287023782730103},{"id":"https://openalex.org/keywords/state","display_name":"State (computer science)","score":0.5117614269256592},{"id":"https://openalex.org/keywords/context","display_name":"Context (archaeology)","score":0.45416340231895447},{"id":"https://openalex.org/keywords/set","display_name":"Set (abstract data type)","score":0.44538983702659607},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.385902464389801},{"id":"https://openalex.org/keywords/programming-language","display_name":"Programming language","score":0.15918079018592834}],"concepts":[{"id":"https://openalex.org/C30788636","wikidata":"https://www.wikidata.org/wiki/Q7805517","display_name":"Timed automaton","level":3,"score":0.8283590078353882},{"id":"https://openalex.org/C136643341","wikidata":"https://www.wikidata.org/wiki/Q1361526","display_name":"Reachability","level":2,"score":0.7752357721328735},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7459734678268433},{"id":"https://openalex.org/C38677869","wikidata":"https://www.wikidata.org/wiki/Q724168","display_name":"Petri net","level":2,"score":0.6821671724319458},{"id":"https://openalex.org/C112505250","wikidata":"https://www.wikidata.org/wiki/Q787116","display_name":"Automaton","level":2,"score":0.6639177799224854},{"id":"https://openalex.org/C153269930","wikidata":"https://www.wikidata.org/wiki/Q430001","display_name":"Decidability","level":2,"score":0.6613032817840576},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.5865337252616882},{"id":"https://openalex.org/C2777669093","wikidata":"https://www.wikidata.org/wiki/Q17141570","display_name":"Reachability problem","level":3,"score":0.5783037543296814},{"id":"https://openalex.org/C110251889","wikidata":"https://www.wikidata.org/wiki/Q1569697","display_name":"Model checking","level":2,"score":0.5714597702026367},{"id":"https://openalex.org/C56348326","wikidata":"https://www.wikidata.org/wiki/Q1047554","display_name":"Mutual exclusion","level":2,"score":0.5287023782730103},{"id":"https://openalex.org/C48103436","wikidata":"https://www.wikidata.org/wiki/Q599031","display_name":"State (computer science)","level":2,"score":0.5117614269256592},{"id":"https://openalex.org/C2779343474","wikidata":"https://www.wikidata.org/wiki/Q3109175","display_name":"Context (archaeology)","level":2,"score":0.45416340231895447},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.44538983702659607},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.385902464389801},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.15918079018592834},{"id":"https://openalex.org/C151730666","wikidata":"https://www.wikidata.org/wiki/Q7205","display_name":"Paleontology","level":1,"score":0.0},{"id":"https://openalex.org/C86803240","wikidata":"https://www.wikidata.org/wiki/Q420","display_name":"Biology","level":0,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1016/s0304-3975(01)00330-9","is_oa":false,"landing_page_url":"https://doi.org/10.1016/s0304-3975(01)00330-9","pdf_url":null,"source":{"id":"https://openalex.org/S90727058","display_name":"Theoretical Computer Science","issn_l":"0304-3975","issn":["0304-3975","1879-2294"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320990","host_organization_name":"Elsevier BV","host_organization_lineage":["https://openalex.org/P4310320990"],"host_organization_lineage_names":["Elsevier BV"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Theoretical Computer Science","raw_type":"journal-article"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.34.1355","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.34.1355","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.docs.uu.se/docs/avds/TN:detailed.ps","raw_type":"text"}],"best_oa_location":null,"sustainable_development_goals":[{"score":0.75,"id":"https://metadata.un.org/sdg/10","display_name":"Reduced inequalities"}],"awards":[],"funders":[{"id":"https://openalex.org/F4320322581","display_name":"Vetenskapsr\u00e5det","ror":"https://ror.org/03zttf063"}],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":54,"referenced_works":["https://openalex.org/W22002794","https://openalex.org/W42364276","https://openalex.org/W189377796","https://openalex.org/W607315387","https://openalex.org/W1481604828","https://openalex.org/W1486308576","https://openalex.org/W1491196069","https://openalex.org/W1492571724","https://openalex.org/W1493471623","https://openalex.org/W1514324498","https://openalex.org/W1515514400","https://openalex.org/W1529624861","https://openalex.org/W1541064517","https://openalex.org/W1554045856","https://openalex.org/W1588575694","https://openalex.org/W1593428110","https://openalex.org/W1596400039","https://openalex.org/W1964087553","https://openalex.org/W1965726041","https://openalex.org/W1968552123","https://openalex.org/W1986184086","https://openalex.org/W1995691455","https://openalex.org/W1997387389","https://openalex.org/W2000210358","https://openalex.org/W2012001501","https://openalex.org/W2017872109","https://openalex.org/W2036526834","https://openalex.org/W2042801853","https://openalex.org/W2052306562","https://openalex.org/W2060361043","https://openalex.org/W2076508310","https://openalex.org/W2102236203","https://openalex.org/W2117189826","https://openalex.org/W2118539487","https://openalex.org/W2120601740","https://openalex.org/W2123160677","https://openalex.org/W2123910665","https://openalex.org/W2146250272","https://openalex.org/W2151612633","https://openalex.org/W2153273838","https://openalex.org/W2153439859","https://openalex.org/W2156879919","https://openalex.org/W3023981071","https://openalex.org/W4244180300","https://openalex.org/W6600917210","https://openalex.org/W6628560403","https://openalex.org/W6629127773","https://openalex.org/W6629230961","https://openalex.org/W6629442567","https://openalex.org/W6634379790","https://openalex.org/W6635273122","https://openalex.org/W6635435973","https://openalex.org/W6661202327","https://openalex.org/W6675505878"],"related_works":["https://openalex.org/W4224983736","https://openalex.org/W4288581691","https://openalex.org/W2951140680","https://openalex.org/W2912654482","https://openalex.org/W2150468037","https://openalex.org/W2951439219","https://openalex.org/W2133856837","https://openalex.org/W1565729639","https://openalex.org/W1750615905","https://openalex.org/W2765111002"],"abstract_inverted_index":null,"counts_by_year":[{"year":2026,"cited_by_count":1},{"year":2025,"cited_by_count":1},{"year":2023,"cited_by_count":2},{"year":2022,"cited_by_count":1},{"year":2021,"cited_by_count":2},{"year":2020,"cited_by_count":2},{"year":2019,"cited_by_count":5},{"year":2018,"cited_by_count":2},{"year":2017,"cited_by_count":6},{"year":2016,"cited_by_count":4},{"year":2015,"cited_by_count":7},{"year":2014,"cited_by_count":4},{"year":2013,"cited_by_count":4},{"year":2012,"cited_by_count":7}],"updated_date":"2026-04-05T17:49:38.594831","created_date":"2025-10-10T00:00:00"}