{"id":"https://openalex.org/W3146839929","doi":"https://doi.org/10.1109/iccad.2007.4397263","title":"An efficient algorithm for time separation of events in concurrent systems","display_name":"An efficient algorithm for time separation of events in concurrent systems","publication_year":2007,"publication_date":"2007-11-01","ids":{"openalex":"https://openalex.org/W3146839929","doi":"https://doi.org/10.1109/iccad.2007.4397263","mag":"3146839929"},"language":"en","primary_location":{"id":"doi:10.1109/iccad.2007.4397263","is_oa":false,"landing_page_url":"https://doi.org/10.1109/iccad.2007.4397263","pdf_url":null,"source":{"id":"https://openalex.org/S4210177401","display_name":"Digest of technical papers/Digest of technical papers - IEEE/ACM International Conference on Computer-Aided Design","issn_l":"1092-3152","issn":["1092-3152","1558-2434"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319798","host_organization_name":"Association for Computing Machinery","host_organization_lineage":["https://openalex.org/P4310319798"],"host_organization_lineage_names":["Association for Computing Machinery"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2007 IEEE/ACM International Conference on Computer-Aided Design","raw_type":"proceedings-article"},"type":"conference-paper","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/A5075733090","display_name":"Peggy B. McGee","orcid":null},"institutions":[{"id":"https://openalex.org/I78577930","display_name":"Columbia University","ror":"https://ror.org/00hj8s172","country_code":"US","type":"education","lineage":["https://openalex.org/I78577930"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Peggy B. McGee","raw_affiliation_strings":["Department of Computer Science, Columbia University, New York, NY, USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Computer Science, Columbia University, New York, NY, USA","institution_ids":["https://openalex.org/I78577930"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5023548648","display_name":"Steven M. Nowick","orcid":"https://orcid.org/0000-0002-8837-8109"},"institutions":[{"id":"https://openalex.org/I78577930","display_name":"Columbia University","ror":"https://ror.org/00hj8s172","country_code":"US","type":"education","lineage":["https://openalex.org/I78577930"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Steven M. Nowick","raw_affiliation_strings":["Department of Computer Science, Columbia University, New York, NY, USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Computer Science, Columbia University, New York, NY, USA","institution_ids":["https://openalex.org/I78577930"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":[],"corresponding_institution_ids":["https://openalex.org/I78577930"],"apc_list":null,"apc_paid":null,"fwci":null,"has_fulltext":false,"cited_by_count":21,"citation_normalized_percentile":null,"cited_by_percentile_year":null,"biblio":{"volume":"1","issue":null,"first_page":"180","last_page":"187"},"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.9994999766349792,"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.9994000196456909,"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/computer-science","display_name":"Computer science","score":0.6388731002807617},{"id":"https://openalex.org/keywords/bounded-function","display_name":"Bounded function","score":0.6177254915237427},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.5729610323905945},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.5511764883995056},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.5053802132606506},{"id":"https://openalex.org/keywords/semantics","display_name":"Semantics (computer science)","score":0.5028223395347595},{"id":"https://openalex.org/keywords/directed-acyclic-graph","display_name":"Directed acyclic graph","score":0.4760049283504486},{"id":"https://openalex.org/keywords/set","display_name":"Set (abstract data type)","score":0.4736315608024597},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.4099689722061157},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.24930018186569214},{"id":"https://openalex.org/keywords/programming-language","display_name":"Programming language","score":0.10153767466545105}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6388731002807617},{"id":"https://openalex.org/C34388435","wikidata":"https://www.wikidata.org/wiki/Q2267362","display_name":"Bounded function","level":2,"score":0.6177254915237427},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.5729610323905945},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.5511764883995056},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.5053802132606506},{"id":"https://openalex.org/C184337299","wikidata":"https://www.wikidata.org/wiki/Q1437428","display_name":"Semantics (computer science)","level":2,"score":0.5028223395347595},{"id":"https://openalex.org/C74197172","wikidata":"https://www.wikidata.org/wiki/Q1195339","display_name":"Directed acyclic graph","level":2,"score":0.4760049283504486},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.4736315608024597},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.4099689722061157},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.24930018186569214},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.10153767466545105},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/iccad.2007.4397263","is_oa":false,"landing_page_url":"https://doi.org/10.1109/iccad.2007.4397263","pdf_url":null,"source":{"id":"https://openalex.org/S4210177401","display_name":"Digest of technical papers/Digest of technical papers - IEEE/ACM International Conference on Computer-Aided Design","issn_l":"1092-3152","issn":["1092-3152","1558-2434"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319798","host_organization_name":"Association for Computing Machinery","host_organization_lineage":["https://openalex.org/P4310319798"],"host_organization_lineage_names":["Association for Computing Machinery"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2007 IEEE/ACM International Conference on Computer-Aided Design","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":16,"referenced_works":["https://openalex.org/W1566513760","https://openalex.org/W1585873380","https://openalex.org/W1937545609","https://openalex.org/W1993742654","https://openalex.org/W1996109622","https://openalex.org/W2083580665","https://openalex.org/W2102326977","https://openalex.org/W2112080584","https://openalex.org/W2119366148","https://openalex.org/W2125690626","https://openalex.org/W2132385281","https://openalex.org/W2140315731","https://openalex.org/W2159261801","https://openalex.org/W2170149813","https://openalex.org/W3140262324","https://openalex.org/W6640537675"],"related_works":["https://openalex.org/W4302345037","https://openalex.org/W2731094954","https://openalex.org/W2789273959","https://openalex.org/W1998712144","https://openalex.org/W2952978498","https://openalex.org/W4292730466","https://openalex.org/W2951616510","https://openalex.org/W3122467582","https://openalex.org/W2728444714","https://openalex.org/W2354764436"],"abstract_inverted_index":{"The":[0],"time":[1],"separation":[2,15],"of":[3,9,19,21,38,118,152,157],"events":[4,23],"(TSE)":[5],"problem":[6],"is":[7,70,105],"that":[8],"finding":[10],"the":[11,17,32,63,107,114,129,148,163],"maximum":[12],"and":[13,36,112,150,176],"minimum":[14],"between":[16],"times":[18],"occurrence":[20],"two":[22,168],"in":[24,31],"a":[25,73,102,119,123,127],"concurrent":[26,39,57,68],"system.":[27],"It":[28],"has":[29,131,143],"applications":[30],"performance":[33],"analysis,":[34],"optimization":[35],"verification":[37],"digital":[40],"systems.":[41],"This":[42],"paper":[43],"introduces":[44],"an":[45],"efficient":[46],"polynomial-time":[47],"algorithm":[48],"to":[49,146],"give":[50],"exact":[51],"bounds":[52],"on":[53,79,162,174],"TSE's":[54],"for":[55,178],"choice-free":[56,67],"systems,":[58],"whose":[59],"operational":[60],"semantics":[61],"obey":[62],"max-causality":[64],"rule.":[65],"A":[66,139,155],"system":[69,121],"modeled":[71,82],"as":[72,83,165,167],"strongly-connected":[74],"marked":[75],"graph,":[76],"where":[77],"delays":[78],"operations":[80],"are":[81],"bounded":[84],"intervals":[85],"with":[86,171],"unspecified":[87],"distributions.":[88],"While":[89],"previous":[90],"approaches":[91],"handle":[92],"acyclic":[93],"systems":[94],"only,":[95],"or":[96],"else":[97],"require":[98],"graph":[99],"unfolding":[100],"until":[101],"steady-state":[103,116],"behavior":[104,117],"reached,":[106],"proposed":[108],"approach":[109],"directly":[110],"identifies":[111],"evaluates":[113],"asymptotic":[115],"cyclic":[120],"via":[122],"graph-theoretical":[124],"approach.":[125],"As":[126],"result,":[128],"method":[130],"significantly":[132],"lower":[133],"computational":[134],"complexity":[135],"than":[136],"previously-proposed":[137],"solutions.":[138],"prototype":[140],"CAD":[141],"tool":[142,164],"been":[144,160],"developed":[145],"demonstrate":[147],"feasibility":[149],"efficacy":[151],"our":[153],"method.":[154],"set":[156],"experiments":[158],"have":[159],"performed":[161],"well":[166],"existing":[169],"tools,":[170],"noticeable":[172],"improvement":[173],"runtime":[175],"accuracy":[177],"several":[179],"examples.":[180]},"counts_by_year":[{"year":2020,"cited_by_count":2},{"year":2019,"cited_by_count":1},{"year":2017,"cited_by_count":2},{"year":2016,"cited_by_count":1},{"year":2015,"cited_by_count":4},{"year":2014,"cited_by_count":1},{"year":2013,"cited_by_count":2},{"year":2012,"cited_by_count":2}],"updated_date":"2026-07-14T23:27:15.235271","created_date":"2025-10-10T00:00:00"}