{"id":"https://openalex.org/W2149121315","doi":"https://doi.org/10.1142/s0129054106004133","title":"A TIMED FAILURE EQUIVALENCE PRESERVING ABSTRACTION FOR PARAMETRIC TIME-INTERVAL AUTOMATA","display_name":"A TIMED FAILURE EQUIVALENCE PRESERVING ABSTRACTION FOR PARAMETRIC TIME-INTERVAL AUTOMATA","publication_year":2006,"publication_date":"2006-08-01","ids":{"openalex":"https://openalex.org/W2149121315","doi":"https://doi.org/10.1142/s0129054106004133","mag":"2149121315"},"language":"en","primary_location":{"id":"doi:10.1142/s0129054106004133","is_oa":false,"landing_page_url":"https://doi.org/10.1142/s0129054106004133","pdf_url":null,"source":{"id":"https://openalex.org/S68047077","display_name":"International Journal of Foundations of Computer Science","issn_l":"0129-0541","issn":["0129-0541","1793-6373"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319815","host_organization_name":"World Scientific","host_organization_lineage":["https://openalex.org/P4310319815"],"host_organization_lineage_names":["World Scientific"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"International Journal of Foundations of 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/A5016082529","display_name":"Akio Nakata","orcid":"https://orcid.org/0000-0002-2957-8469"},"institutions":[{"id":"https://openalex.org/I98285908","display_name":"The University of Osaka","ror":"https://ror.org/035t8zc32","country_code":"JP","type":"education","lineage":["https://openalex.org/I98285908"]}],"countries":["JP"],"is_corresponding":false,"raw_author_name":"AKIO NAKATA","raw_affiliation_strings":["Department of Information Networking, Graduate School of Information Science and Technology, Osaka University, Suita, Osaka 565-0871, Japan"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Information Networking, Graduate School of Information Science and Technology, Osaka University, Suita, Osaka 565-0871, Japan","institution_ids":["https://openalex.org/I98285908"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5042864619","display_name":"Tadaaki Tanimoto","orcid":null},"institutions":[{"id":"https://openalex.org/I98285908","display_name":"The University of Osaka","ror":"https://ror.org/035t8zc32","country_code":"JP","type":"education","lineage":["https://openalex.org/I98285908"]}],"countries":["JP"],"is_corresponding":false,"raw_author_name":"TADAAKI TANIMOTO","raw_affiliation_strings":["Department of Information Networking, Graduate School of Information Science and Technology, Osaka University, Suita, Osaka 565-0871, Japan"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Information Networking, Graduate School of Information Science and Technology, Osaka University, Suita, Osaka 565-0871, Japan","institution_ids":["https://openalex.org/I98285908"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5018675646","display_name":"Suguru Sasaki","orcid":null},"institutions":[{"id":"https://openalex.org/I98285908","display_name":"The University of Osaka","ror":"https://ror.org/035t8zc32","country_code":"JP","type":"education","lineage":["https://openalex.org/I98285908"]}],"countries":["JP"],"is_corresponding":false,"raw_author_name":"SUGURU SASAKI","raw_affiliation_strings":["Department of Information Networking, Graduate School of Information Science and Technology, Osaka University, Suita, Osaka 565-0871, Japan"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Information Networking, Graduate School of Information Science and Technology, Osaka University, Suita, Osaka 565-0871, Japan","institution_ids":["https://openalex.org/I98285908"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5082680857","display_name":"Teruo Higashino","orcid":"https://orcid.org/0000-0001-5685-0424"},"institutions":[{"id":"https://openalex.org/I98285908","display_name":"The University of Osaka","ror":"https://ror.org/035t8zc32","country_code":"JP","type":"education","lineage":["https://openalex.org/I98285908"]}],"countries":["JP"],"is_corresponding":false,"raw_author_name":"TERUO HIGASHINO","raw_affiliation_strings":["Department of Information Networking, Graduate School of Information Science and Technology, Osaka University, Suita, Osaka 565-0871, Japan"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Information Networking, Graduate School of Information Science and Technology, Osaka University, Suita, Osaka 565-0871, Japan","institution_ids":["https://openalex.org/I98285908"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":[],"corresponding_institution_ids":["https://openalex.org/I98285908"],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":{"value":0.18183865,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":"17","issue":"04","first_page":"833","last_page":"849"},"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/T10904","display_name":"Embedded Systems Design Techniques","score":0.9988999962806702,"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"}},{"id":"https://openalex.org/T10933","display_name":"Real-Time Systems Scheduling","score":0.9987999796867371,"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.7073193788528442},{"id":"https://openalex.org/keywords/timed-automaton","display_name":"Timed automaton","score":0.6943585276603699},{"id":"https://openalex.org/keywords/automaton","display_name":"Automaton","score":0.6594299674034119},{"id":"https://openalex.org/keywords/equivalence","display_name":"Equivalence (formal languages)","score":0.6468894481658936},{"id":"https://openalex.org/keywords/bisimulation","display_name":"Bisimulation","score":0.6444589495658875},{"id":"https://openalex.org/keywords/parametric-statistics","display_name":"Parametric statistics","score":0.6066015362739563},{"id":"https://openalex.org/keywords/scheduling","display_name":"Scheduling (production processes)","score":0.4984164237976074},{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.4598333537578583},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.4466361403465271},{"id":"https://openalex.org/keywords/interval","display_name":"Interval (graph theory)","score":0.4196707308292389},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.3852594494819641},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.2617858946323395},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.21967309713363647},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.17064091563224792}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7073193788528442},{"id":"https://openalex.org/C30788636","wikidata":"https://www.wikidata.org/wiki/Q7805517","display_name":"Timed automaton","level":3,"score":0.6943585276603699},{"id":"https://openalex.org/C112505250","wikidata":"https://www.wikidata.org/wiki/Q787116","display_name":"Automaton","level":2,"score":0.6594299674034119},{"id":"https://openalex.org/C2780069185","wikidata":"https://www.wikidata.org/wiki/Q7977945","display_name":"Equivalence (formal languages)","level":2,"score":0.6468894481658936},{"id":"https://openalex.org/C135315306","wikidata":"https://www.wikidata.org/wiki/Q866364","display_name":"Bisimulation","level":2,"score":0.6444589495658875},{"id":"https://openalex.org/C117251300","wikidata":"https://www.wikidata.org/wiki/Q1849855","display_name":"Parametric statistics","level":2,"score":0.6066015362739563},{"id":"https://openalex.org/C206729178","wikidata":"https://www.wikidata.org/wiki/Q2271896","display_name":"Scheduling (production processes)","level":2,"score":0.4984164237976074},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.4598333537578583},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.4466361403465271},{"id":"https://openalex.org/C2778067643","wikidata":"https://www.wikidata.org/wiki/Q166507","display_name":"Interval (graph theory)","level":2,"score":0.4196707308292389},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.3852594494819641},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.2617858946323395},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.21967309713363647},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.17064091563224792},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.0},{"id":"https://openalex.org/C105795698","wikidata":"https://www.wikidata.org/wiki/Q12483","display_name":"Statistics","level":1,"score":0.0},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1142/s0129054106004133","is_oa":false,"landing_page_url":"https://doi.org/10.1142/s0129054106004133","pdf_url":null,"source":{"id":"https://openalex.org/S68047077","display_name":"International Journal of Foundations of Computer Science","issn_l":"0129-0541","issn":["0129-0541","1793-6373"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319815","host_organization_name":"World Scientific","host_organization_lineage":["https://openalex.org/P4310319815"],"host_organization_lineage_names":["World Scientific"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"International Journal of Foundations of Computer Science","raw_type":"journal-article"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.62.2833","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.62.2833","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www-higashi.ist.osaka-u.ac.jp/~nakata/papers/IJFCS_atva2004_special_issue_techreport.pdf","raw_type":"text"}],"best_oa_location":null,"sustainable_development_goals":[{"score":0.800000011920929,"id":"https://metadata.un.org/sdg/16","display_name":"Peace, Justice and strong institutions"}],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":21,"referenced_works":["https://openalex.org/W52136403","https://openalex.org/W258022877","https://openalex.org/W1503973138","https://openalex.org/W1522645051","https://openalex.org/W1552249698","https://openalex.org/W1569530399","https://openalex.org/W1586966546","https://openalex.org/W1863244539","https://openalex.org/W1966263924","https://openalex.org/W1977116247","https://openalex.org/W2001026449","https://openalex.org/W2010698657","https://openalex.org/W2025782239","https://openalex.org/W2034124289","https://openalex.org/W2037230951","https://openalex.org/W2099639789","https://openalex.org/W2157144873","https://openalex.org/W2589217375","https://openalex.org/W2913663755","https://openalex.org/W3144368627","https://openalex.org/W4212934768"],"related_works":["https://openalex.org/W3138334597","https://openalex.org/W4205777715","https://openalex.org/W2162510824","https://openalex.org/W2111205369","https://openalex.org/W2283144080","https://openalex.org/W2040368499","https://openalex.org/W324582425","https://openalex.org/W2613499055","https://openalex.org/W4287742608","https://openalex.org/W3039941228"],"abstract_inverted_index":{"In":[0,29,102,162],"the":[1,11,18,24,36,70,80,92,106,119,136,190,197,200,203,214,217,236,245,265],"development":[2],"of":[3,35,45,60,66,82,94,108,110,118,135,172,199,206,216,219],"real-time":[4],"communicating":[5,220],"hardware/embedded-software":[6],"systems,":[7],"it":[8,87,193,211],"is":[9,76,88,115,126,132,182],"frequently":[10,49],"case":[12],"that":[13,57,192,231,253],"we":[14,167,228],"want":[15],"to":[16,55,91,104,264],"refine/optimize":[17],"system's":[19],"internal":[20,38,46,61,67,95,204,241],"behavior":[21],"while":[22],"preserving":[23],"external":[25,72,225],"timed":[26,73,141,176,186,258],"I/O":[27],"behavior.":[28],"such":[30,58,111,123],"a":[31,127,133,139,146,155,248],"design":[32],"refinement,":[33],"modification":[34,59],"systems'":[37,71],"branching":[39,62,96],"structures,":[40],"as":[41,43,154],"well":[42],"re-scheduling":[44,65],"actions,":[47,242],"may":[48],"occur.":[50],"Our":[51],"goal":[52],"is,":[53],"then,":[54],"ensure":[56],"structures":[63,97],"and":[64,151,243],"actions":[68,221],"preserve":[69],"behavior,":[74],"which":[75,131,174],"typically":[77],"formalized":[78],"by":[79,223],"notion":[81],"(timed)":[83,99],"failure":[84,177,180,259],"equivalence":[85,181,270],"since":[86],"less":[89],"sensitive":[90],"difference":[93,198,215],"than":[98,185],"weak":[100,187],"bisimulation.":[101],"order":[103,252],"know":[105],"degree":[107],"freedom":[109],"re-scheduling,":[112],"parametric":[113,128,140,267],"analysis":[114,125],"useful.":[116],"One":[117],"models":[120,256],"suitable":[121],"for":[122],"an":[124,169,224],"time-interval":[129],"automaton(PTIA),":[130],"subclass":[134],"existing":[137,266],"model,":[138],"automaton.":[142],"It":[143],"has":[144,208,239],"only":[145],"time":[147],"interval":[148],"with":[149],"upper-":[150],"lower-bound":[152],"parameters":[153],"relative":[156],"timing":[157,201],"constraint":[158],"between":[159],"consecutive":[160],"actions.":[161],"this":[163],"paper,":[164],"at":[165],"first,":[166],"propose":[168],"abstraction":[170],"algorithm":[171],"PTIA":[173,238],"preserves":[175],"equivalence.":[178],"Timed":[179],"strictly":[183],"weaker":[184],"bisimulation":[188,269],"in":[189,251],"sense":[191],"does":[194,212],"not":[195],"distinguish":[196,213],"when":[202],"resolution":[205],"nondeterminism":[207],"occurred,":[209],"but":[210],"refusals":[218],"observed":[222],"environment.":[226],"Then,":[227],"also":[229],"show":[230],"after":[232],"applying":[233],"our":[234],"algorithm,":[235],"reduced":[237,263],"no":[240],"thus":[244],"problem":[246],"deriving":[247],"parameter":[249],"condition":[250],"given":[254],"two":[255],"are":[257],"equivalent":[260],"can":[261],"be":[262],"strong":[268],"checking.":[271]},"counts_by_year":[],"updated_date":"2026-05-21T06:26:12.895304","created_date":"2025-10-10T00:00:00"}