{"id":"https://openalex.org/W2079649539","doi":"https://doi.org/10.1007/s00165-006-0010-7","title":"How to stop time stopping","display_name":"How to stop time stopping","publication_year":2006,"publication_date":"2006-09-27","ids":{"openalex":"https://openalex.org/W2079649539","doi":"https://doi.org/10.1007/s00165-006-0010-7","mag":"2079649539"},"language":"en","primary_location":{"id":"doi:10.1007/s00165-006-0010-7","is_oa":false,"landing_page_url":"https://doi.org/10.1007/s00165-006-0010-7","pdf_url":null,"source":{"id":"https://openalex.org/S128250343","display_name":"Formal Aspects of Computing","issn_l":"0934-5043","issn":["0934-5043","1433-299X"],"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":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Formal Aspects of Computing","raw_type":"journal-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://kar.kent.ac.uk/14388/1/main.pdf","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5011062278","display_name":"Howard Bowman","orcid":"https://orcid.org/0000-0003-4736-1869"},"institutions":[{"id":"https://openalex.org/I20581793","display_name":"University of Kent","ror":"https://ror.org/00xkeyj56","country_code":"GB","type":"education","lineage":["https://openalex.org/I20581793"]}],"countries":["GB"],"is_corresponding":true,"raw_author_name":"Howard Bowman","raw_affiliation_strings":["Computing Laboratory, University of Kent, CT2 7NF, Canterbury, Kent, UK","Computing Laboratory, University of Kent, CT2 7NF, Canterbury, Kent, UK#TAB#"],"affiliations":[{"raw_affiliation_string":"Computing Laboratory, University of Kent, CT2 7NF, Canterbury, Kent, UK","institution_ids":["https://openalex.org/I20581793"]},{"raw_affiliation_string":"Computing Laboratory, University of Kent, CT2 7NF, Canterbury, Kent, UK#TAB#","institution_ids":["https://openalex.org/I20581793"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5063919851","display_name":"Rodolfo G\u00f3mez","orcid":null},"institutions":[{"id":"https://openalex.org/I20581793","display_name":"University of Kent","ror":"https://ror.org/00xkeyj56","country_code":"GB","type":"education","lineage":["https://openalex.org/I20581793"]}],"countries":["GB"],"is_corresponding":false,"raw_author_name":"Rodolfo G\u00f3mez","raw_affiliation_strings":["Computing Laboratory, University of Kent, CT2 7NF, Canterbury, Kent, UK","Computing Laboratory, University of Kent, CT2 7NF, Canterbury, Kent, UK#TAB#"],"affiliations":[{"raw_affiliation_string":"Computing Laboratory, University of Kent, CT2 7NF, Canterbury, Kent, UK","institution_ids":["https://openalex.org/I20581793"]},{"raw_affiliation_string":"Computing Laboratory, University of Kent, CT2 7NF, Canterbury, Kent, UK#TAB#","institution_ids":["https://openalex.org/I20581793"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5011062278"],"corresponding_institution_ids":["https://openalex.org/I20581793"],"apc_list":null,"apc_paid":null,"fwci":2.6162,"has_fulltext":true,"cited_by_count":28,"citation_normalized_percentile":{"value":0.89650207,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":98},"biblio":{"volume":"18","issue":"4","first_page":"459","last_page":"493"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10142","display_name":"Formal Methods in Verification","score":1.0,"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":1.0,"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.9962000250816345,"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/T11450","display_name":"Model-Driven Software Engineering Techniques","score":0.9940000176429749,"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/zenos-paradoxes","display_name":"Zeno's paradoxes","score":0.9823349714279175},{"id":"https://openalex.org/keywords/reachability","display_name":"Reachability","score":0.7896667718887329},{"id":"https://openalex.org/keywords/automaton","display_name":"Automaton","score":0.7352640628814697},{"id":"https://openalex.org/keywords/theory-of-computation","display_name":"Theory of computation","score":0.7129156589508057},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.6981105804443359},{"id":"https://openalex.org/keywords/timed-automaton","display_name":"Timed automaton","score":0.6786059141159058},{"id":"https://openalex.org/keywords/decidability","display_name":"Decidability","score":0.5875608921051025},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.5696060061454773},{"id":"https://openalex.org/keywords/complement","display_name":"Complement (music)","score":0.5384364724159241},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.4477696716785431},{"id":"https://openalex.org/keywords/model-checking","display_name":"Model checking","score":0.42510244250297546},{"id":"https://openalex.org/keywords/reachability-problem","display_name":"Reachability problem","score":0.41117945313453674},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.3014134466648102}],"concepts":[{"id":"https://openalex.org/C7707877","wikidata":"https://www.wikidata.org/wiki/Q33378","display_name":"Zeno's paradoxes","level":2,"score":0.9823349714279175},{"id":"https://openalex.org/C136643341","wikidata":"https://www.wikidata.org/wiki/Q1361526","display_name":"Reachability","level":2,"score":0.7896667718887329},{"id":"https://openalex.org/C112505250","wikidata":"https://www.wikidata.org/wiki/Q787116","display_name":"Automaton","level":2,"score":0.7352640628814697},{"id":"https://openalex.org/C24858836","wikidata":"https://www.wikidata.org/wiki/Q844718","display_name":"Theory of computation","level":2,"score":0.7129156589508057},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6981105804443359},{"id":"https://openalex.org/C30788636","wikidata":"https://www.wikidata.org/wiki/Q7805517","display_name":"Timed automaton","level":3,"score":0.6786059141159058},{"id":"https://openalex.org/C153269930","wikidata":"https://www.wikidata.org/wiki/Q430001","display_name":"Decidability","level":2,"score":0.5875608921051025},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.5696060061454773},{"id":"https://openalex.org/C112313634","wikidata":"https://www.wikidata.org/wiki/Q7886648","display_name":"Complement (music)","level":5,"score":0.5384364724159241},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.4477696716785431},{"id":"https://openalex.org/C110251889","wikidata":"https://www.wikidata.org/wiki/Q1569697","display_name":"Model checking","level":2,"score":0.42510244250297546},{"id":"https://openalex.org/C2777669093","wikidata":"https://www.wikidata.org/wiki/Q17141570","display_name":"Reachability problem","level":3,"score":0.41117945313453674},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.3014134466648102},{"id":"https://openalex.org/C188082640","wikidata":"https://www.wikidata.org/wiki/Q1780899","display_name":"Complementation","level":4,"score":0.0},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.0},{"id":"https://openalex.org/C104317684","wikidata":"https://www.wikidata.org/wiki/Q7187","display_name":"Gene","level":2,"score":0.0},{"id":"https://openalex.org/C127716648","wikidata":"https://www.wikidata.org/wiki/Q104053","display_name":"Phenotype","level":3,"score":0.0},{"id":"https://openalex.org/C185592680","wikidata":"https://www.wikidata.org/wiki/Q2329","display_name":"Chemistry","level":0,"score":0.0},{"id":"https://openalex.org/C55493867","wikidata":"https://www.wikidata.org/wiki/Q7094","display_name":"Biochemistry","level":1,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1007/s00165-006-0010-7","is_oa":false,"landing_page_url":"https://doi.org/10.1007/s00165-006-0010-7","pdf_url":null,"source":{"id":"https://openalex.org/S128250343","display_name":"Formal Aspects of Computing","issn_l":"0934-5043","issn":["0934-5043","1433-299X"],"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":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Formal Aspects of Computing","raw_type":"journal-article"},{"id":"pmh:oai:kar.kent.ac.uk:14388","is_oa":true,"landing_page_url":"https://doi.org/10.1007/s00165-006-0010-7>)","pdf_url":"https://kar.kent.ac.uk/14388/1/main.pdf","source":{"id":"https://openalex.org/S4377196264","display_name":"Kent Academic Repository (University of Kent)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I20581793","host_organization_name":"University of Kent","host_organization_lineage":["https://openalex.org/I20581793"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"acceptedVersion","is_accepted":true,"is_published":false,"raw_source_name":null,"raw_type":"NonPeerReviewed"}],"best_oa_location":{"id":"pmh:oai:kar.kent.ac.uk:14388","is_oa":true,"landing_page_url":"https://doi.org/10.1007/s00165-006-0010-7>)","pdf_url":"https://kar.kent.ac.uk/14388/1/main.pdf","source":{"id":"https://openalex.org/S4377196264","display_name":"Kent Academic Repository (University of Kent)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I20581793","host_organization_name":"University of Kent","host_organization_lineage":["https://openalex.org/I20581793"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"acceptedVersion","is_accepted":true,"is_published":false,"raw_source_name":null,"raw_type":"NonPeerReviewed"},"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":true,"grobid_xml":true},"content_urls":{"pdf":"https://content.openalex.org/works/W2079649539.pdf","grobid_xml":"https://content.openalex.org/works/W2079649539.grobid-xml"},"referenced_works_count":35,"referenced_works":["https://openalex.org/W258022877","https://openalex.org/W1482486776","https://openalex.org/W1483379332","https://openalex.org/W1497436144","https://openalex.org/W1503973138","https://openalex.org/W1512562944","https://openalex.org/W1529559025","https://openalex.org/W1556929651","https://openalex.org/W1588747780","https://openalex.org/W1595528047","https://openalex.org/W1596185389","https://openalex.org/W1802815008","https://openalex.org/W1874725288","https://openalex.org/W1886297056","https://openalex.org/W1962072139","https://openalex.org/W1964934589","https://openalex.org/W1971949385","https://openalex.org/W1977622287","https://openalex.org/W1981808971","https://openalex.org/W2011767010","https://openalex.org/W2012339561","https://openalex.org/W2023499821","https://openalex.org/W2087107052","https://openalex.org/W2099184861","https://openalex.org/W2101508170","https://openalex.org/W2130664212","https://openalex.org/W2130773092","https://openalex.org/W2132976180","https://openalex.org/W2150220388","https://openalex.org/W2180677596","https://openalex.org/W2351722488","https://openalex.org/W2750964270","https://openalex.org/W4235507681","https://openalex.org/W4285719527","https://openalex.org/W6639360369"],"related_works":["https://openalex.org/W2047831585","https://openalex.org/W4299574883","https://openalex.org/W2950207863","https://openalex.org/W2065323166","https://openalex.org/W2079649539","https://openalex.org/W2021255060","https://openalex.org/W419990173","https://openalex.org/W3023596811","https://openalex.org/W1190524203","https://openalex.org/W2997159042"],"abstract_inverted_index":{"Abstract":[0],"Zeno-timelocks":[1],"constitute":[2],"a":[3,36,46,60,81,116,125,150,198,204,232,258,267,271,299],"challenge":[4],"for":[5,28,71,119],"the":[6,18,40,57,89,159,214,220,223,240,274,279,287],"formal":[7],"verification":[8,19],"of":[9,20,42,83,152,162,207,216,225,270,281,286],"timed":[10,43],"automata:":[11,44],"they":[12],"are":[13,65,85,105,133],"difficult":[14],"to":[15,68,135,172,251],"detect,":[16],"and":[17,75,129],"most":[21],"properties":[22],"(e.g.,":[23],"safety)":[24],"is":[25,53,73,91,98,112,182,248,296],"only":[26,143,202],"correct":[27],"timelock-free":[29],"models.":[30,245],"Some":[31],"time":[32],"ago,":[33],"Tripakis":[34],"proposed":[35],"syntactic":[37,241],"check":[38],"on":[39,219,231,243],"structure":[41],"if":[45,178],"certain":[47],"condition":[48,118,200],"(called":[49],"strong":[50],"non-zenoness\u2019":[51],"SNZ)":[52],"met":[54],"by":[55],"all":[56,78,131],"loops":[58,256],"in":[59,80,222,257],"given":[61,259,272],"automaton,":[62],"then":[63,88],"zeno-timelocks":[64,217],"guaranteed":[66,171],"not":[67,106,130,179],"occur.":[69],"Checking":[70],"SNZ":[72,163],"efficient,":[74],"compositional":[76,160],"(if":[77],"components":[79],"network":[82,90],"automata":[84],"strongly":[86,107,183],"non-zeno,":[87],"free":[92,174],"from":[93,175,253],"zeno-timelocks).":[94],"Strong":[95],"non-zenoness,":[96],"however,":[97],"sufficient-only:":[99],"There":[100],"exist":[101],"non-zeno":[102],"specifications":[103],"which":[104,238],"non-zeno.":[108,184],"A":[109,283],"TCTL":[110],"formula":[111,123],"known":[113],"that":[114,158,192,201,234,277],"represents":[115],"sufficient-and-necessary":[117,199],"non-zenoness;":[120],"unfortunately,":[121],"this":[122,140],"requires":[124,203],"demanding":[126],"model-checking":[127],"algorithm,":[128],"model-checkers":[132],"able":[134,250],"express":[136],"it.":[137],"In":[138],"addition,":[139],"algorithm":[141],"provides":[142],"limited":[144],"diagnostic":[145],"information.":[146],"Here":[147],"we":[148,156,186,196,235],"propose":[149],"number":[151],"alternative":[153],"solutions.":[154],"First,":[155],"show":[157],"application":[161],"can":[164,169],"be":[165,170,173],"weakened:":[166],"some":[167],"networks":[168],"Zeno-timelocks,":[176],"even":[177],"every":[180],"component":[181],"Secondly,":[185],"present":[187],"new":[188],"syntactic,":[189],"sufficient-only":[190],"conditions":[191,212],"complement":[193],"SNZ.":[194],"Finally,":[195],"describe":[197],"simple":[205],"form":[206,224],"reachability":[208,275],"analysis.":[209],"Furthermore,":[210],"our":[211],"identify":[213],"cause":[215],"directly":[218],"model,":[221],"unsafe":[226,255],"loops.":[227],"We":[228],"also":[229,249],"comment":[230],"tool":[233,247],"have":[236],"developed,":[237],"implements":[239],"checks":[242],"Uppaal":[244,264],"The":[246],"derive,":[252],"those":[254],"automaton":[260,269],"(in":[261],"general,":[262],"an":[263],"model":[265],"representing":[266],"product":[268],"network),":[273],"formulas":[276],"characterise":[278],"occurrence":[280],"zeno-timelocks.":[282],"modified":[284],"version":[285],"carrier":[288],"sense":[289],"multiple":[290],"access":[291],"with":[292],"collision":[293],"detection":[294],"protocol":[295],"used":[297],"as":[298],"case-study.":[300]},"counts_by_year":[{"year":2023,"cited_by_count":1},{"year":2022,"cited_by_count":1},{"year":2021,"cited_by_count":2},{"year":2017,"cited_by_count":3},{"year":2016,"cited_by_count":1},{"year":2015,"cited_by_count":1},{"year":2014,"cited_by_count":4},{"year":2013,"cited_by_count":3},{"year":2012,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}