{"id":"https://openalex.org/W4231228921","doi":"https://doi.org/10.1109/lics.2004.1319629","title":"Multi-clock timed networks","display_name":"Multi-clock timed networks","publication_year":2004,"publication_date":"2004-01-01","ids":{"openalex":"https://openalex.org/W4231228921","doi":"https://doi.org/10.1109/lics.2004.1319629"},"language":"en","primary_location":{"id":"doi:10.1109/lics.2004.1319629","is_oa":false,"landing_page_url":"https://doi.org/10.1109/lics.2004.1319629","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 19th Annual IEEE Symposium on Logic in Computer Science, 2004.","raw_type":"proceedings-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":"P. Aziz Abdulla","raw_affiliation_strings":["University of Uppsala, Sweden"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"University of Uppsala, Sweden","institution_ids":["https://openalex.org/I123387679"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5033803768","display_name":"Johann Deneux","orcid":null},"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":"J. Deneux","raw_affiliation_strings":["University of Uppsala, Sweden"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"University of Uppsala, Sweden","institution_ids":["https://openalex.org/I123387679"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5002581878","display_name":"Pritha Mahata","orcid":null},"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":"P. Mahata","raw_affiliation_strings":["University of Uppsala, Sweden"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"University of Uppsala, Sweden","institution_ids":["https://openalex.org/I123387679"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":3,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.6922,"has_fulltext":false,"cited_by_count":19,"citation_normalized_percentile":{"value":0.74482647,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":97},"biblio":{"volume":null,"issue":null,"first_page":"345","last_page":"354"},"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/T11125","display_name":"Petri Nets in System Modeling","score":0.9987000226974487,"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.9950000047683716,"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/decidability","display_name":"Decidability","score":0.9167363047599792},{"id":"https://openalex.org/keywords/undecidable-problem","display_name":"Undecidable problem","score":0.9116957187652588},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.7542923092842102},{"id":"https://openalex.org/keywords/parameterized-complexity","display_name":"Parameterized complexity","score":0.738837480545044},{"id":"https://openalex.org/keywords/timed-automaton","display_name":"Timed automaton","score":0.5702168345451355},{"id":"https://openalex.org/keywords/process","display_name":"Process (computing)","score":0.5541846752166748},{"id":"https://openalex.org/keywords/controller","display_name":"Controller (irrigation)","score":0.47414419054985046},{"id":"https://openalex.org/keywords/set","display_name":"Set (abstract data type)","score":0.4601723551750183},{"id":"https://openalex.org/keywords/temporal-logic","display_name":"Temporal logic","score":0.44225773215293884},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.4011264145374298},{"id":"https://openalex.org/keywords/distributed-computing","display_name":"Distributed computing","score":0.37176743149757385},{"id":"https://openalex.org/keywords/real-time-computing","display_name":"Real-time computing","score":0.37166520953178406},{"id":"https://openalex.org/keywords/automaton","display_name":"Automaton","score":0.3591024875640869},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.34893670678138733},{"id":"https://openalex.org/keywords/programming-language","display_name":"Programming language","score":0.15497079491615295}],"concepts":[{"id":"https://openalex.org/C153269930","wikidata":"https://www.wikidata.org/wiki/Q430001","display_name":"Decidability","level":2,"score":0.9167363047599792},{"id":"https://openalex.org/C192034797","wikidata":"https://www.wikidata.org/wiki/Q3502995","display_name":"Undecidable problem","level":3,"score":0.9116957187652588},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7542923092842102},{"id":"https://openalex.org/C165464430","wikidata":"https://www.wikidata.org/wiki/Q1570441","display_name":"Parameterized complexity","level":2,"score":0.738837480545044},{"id":"https://openalex.org/C30788636","wikidata":"https://www.wikidata.org/wiki/Q7805517","display_name":"Timed automaton","level":3,"score":0.5702168345451355},{"id":"https://openalex.org/C98045186","wikidata":"https://www.wikidata.org/wiki/Q205663","display_name":"Process (computing)","level":2,"score":0.5541846752166748},{"id":"https://openalex.org/C203479927","wikidata":"https://www.wikidata.org/wiki/Q5165939","display_name":"Controller (irrigation)","level":2,"score":0.47414419054985046},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.4601723551750183},{"id":"https://openalex.org/C25016198","wikidata":"https://www.wikidata.org/wiki/Q781833","display_name":"Temporal logic","level":2,"score":0.44225773215293884},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.4011264145374298},{"id":"https://openalex.org/C120314980","wikidata":"https://www.wikidata.org/wiki/Q180634","display_name":"Distributed computing","level":1,"score":0.37176743149757385},{"id":"https://openalex.org/C79403827","wikidata":"https://www.wikidata.org/wiki/Q3988","display_name":"Real-time computing","level":1,"score":0.37166520953178406},{"id":"https://openalex.org/C112505250","wikidata":"https://www.wikidata.org/wiki/Q787116","display_name":"Automaton","level":2,"score":0.3591024875640869},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.34893670678138733},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.15497079491615295},{"id":"https://openalex.org/C6557445","wikidata":"https://www.wikidata.org/wiki/Q173113","display_name":"Agronomy","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":1,"locations":[{"id":"doi:10.1109/lics.2004.1319629","is_oa":false,"landing_page_url":"https://doi.org/10.1109/lics.2004.1319629","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 19th Annual IEEE Symposium on Logic in Computer Science, 2004.","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[{"display_name":"Peace, Justice and strong institutions","score":0.4699999988079071,"id":"https://metadata.un.org/sdg/16"}],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":22,"referenced_works":["https://openalex.org/W1486308576","https://openalex.org/W1543690662","https://openalex.org/W1595006413","https://openalex.org/W1968448471","https://openalex.org/W1975120975","https://openalex.org/W1983693620","https://openalex.org/W2019881090","https://openalex.org/W2021255060","https://openalex.org/W2025782239","https://openalex.org/W2036526834","https://openalex.org/W2052306562","https://openalex.org/W2061970672","https://openalex.org/W2083567135","https://openalex.org/W2101508170","https://openalex.org/W2109943697","https://openalex.org/W2129073086","https://openalex.org/W2316437449","https://openalex.org/W3006201496","https://openalex.org/W6632621451","https://openalex.org/W6635698171","https://openalex.org/W6655221434","https://openalex.org/W6773378561"],"related_works":["https://openalex.org/W2972379433","https://openalex.org/W2989332944","https://openalex.org/W2021891065","https://openalex.org/W2583549044","https://openalex.org/W2119045600","https://openalex.org/W2584984136","https://openalex.org/W2170336571","https://openalex.org/W2962928105","https://openalex.org/W2020140696","https://openalex.org/W2765111002"],"abstract_inverted_index":{"We":[0,76],"consider":[1],"verification":[2],"of":[3,9,20,32,119],"safety":[4,44],"properties":[5,45],"for":[6],"parameterized":[7],"systems":[8],"timed":[10,14,17,34,53,74,85],"processes,":[11],"so":[12],"called":[13,25],"networks.":[15,75],"A":[16],"network":[18],"consists":[19],"a":[21,26,37,58,105],"finite":[22,117],"state":[23],"process,":[24],"controller,":[27],"and":[28],"an":[29],"arbitrary":[30],"set":[31],"identical":[33],"processes.":[35],"In":[36],"previous":[38],"work,":[39],"we":[40,94],"showed":[41],"that":[42,78,96],"checking":[43],"is":[46,55,99],"decidable":[47,100],"in":[48],"the":[49,67,79,91,97],"case":[50],"where":[51],"each":[52,84],"process":[54,86],"equipped":[56],"with":[57],"single":[59],"real-valued":[60],"clock.":[61],"It":[62],"was":[63],"left":[64],"open":[65],"whether":[66],"result":[68,111],"could":[69],"be":[70],"extended":[71],"to":[72],"multi-clock":[73],"show":[77,95],"problem":[80,98],"becomes":[81],"undecidable":[82],"when":[83,101,113],"has":[87],"two":[88],"clocks.":[89,120],"On":[90],"other":[92],"hand,":[93],"clocks":[102],"range":[103],"over":[104],"discrete":[106],"time":[107],"domain.":[108],"This":[109],"decidability":[110],"holds":[112],"processes":[114],"have":[115],"any":[116],"number":[118]},"counts_by_year":[{"year":2023,"cited_by_count":2},{"year":2022,"cited_by_count":1},{"year":2021,"cited_by_count":1},{"year":2019,"cited_by_count":3},{"year":2018,"cited_by_count":1},{"year":2017,"cited_by_count":1},{"year":2016,"cited_by_count":1},{"year":2015,"cited_by_count":2},{"year":2014,"cited_by_count":2},{"year":2012,"cited_by_count":2}],"updated_date":"2026-06-11T09:08:48.828518","created_date":"2025-10-10T00:00:00"}