{"id":"https://openalex.org/W4252504493","doi":"https://doi.org/10.1090/dimacs/035/17","title":"The polynomial time decidability of simulation relations for finite state processes: A HORNSAT based approach","display_name":"The polynomial time decidability of simulation relations for finite state processes: A HORNSAT based approach","publication_year":1997,"publication_date":"1997-12-09","ids":{"openalex":"https://openalex.org/W4252504493","doi":"https://doi.org/10.1090/dimacs/035/17"},"language":"en","primary_location":{"id":"doi:10.1090/dimacs/035/17","is_oa":false,"landing_page_url":"https://doi.org/10.1090/dimacs/035/17","pdf_url":null,"source":{"id":"https://openalex.org/S4210177973","display_name":"DIMACS series in discrete mathematics and theoretical computer science","issn_l":"1052-1798","issn":["1052-1798","2472-4793"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"book series"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"DIMACS Series in Discrete Mathematics and Theoretical Computer Science","raw_type":"book-chapter"},"type":"book-chapter","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/A5021517996","display_name":"Sandeep K. Shukla","orcid":"https://orcid.org/0000-0001-5525-7426"},"institutions":[],"countries":[],"is_corresponding":true,"raw_author_name":"Sandeep Shukla","raw_affiliation_strings":[],"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5009388396","display_name":"Daniel J. Rosenkrantz","orcid":"https://orcid.org/0000-0002-7044-0197"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Daniel Rosenkrantz","raw_affiliation_strings":[],"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5111503828","display_name":"Harry T. Hunt","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Harry Hunt","raw_affiliation_strings":[],"affiliations":[]},{"author_position":"last","author":{"id":"https://openalex.org/A5052202085","display_name":"Richard E. Stearns","orcid":"https://orcid.org/0000-0001-5058-1999"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Richard Stearns","raw_affiliation_strings":[],"affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":4,"corresponding_author_ids":["https://openalex.org/A5021517996"],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":8,"citation_normalized_percentile":{"value":0.52438549,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":94},"biblio":{"volume":null,"issue":null,"first_page":"603","last_page":"641"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10142","display_name":"Formal Methods in Verification","score":0.9941999912261963,"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.9941999912261963,"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/T11450","display_name":"Model-Driven Software Engineering Techniques","score":0.9908999800682068,"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/T11195","display_name":"Simulation Techniques and Applications","score":0.9796000123023987,"subfield":{"id":"https://openalex.org/subfields/1803","display_name":"Management Science and Operations Research"},"field":{"id":"https://openalex.org/fields/18","display_name":"Decision Sciences"},"domain":{"id":"https://openalex.org/domains/2","display_name":"Social Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/decidability","display_name":"Decidability","score":0.8194158673286438},{"id":"https://openalex.org/keywords/finite-state","display_name":"Finite state","score":0.5187616348266602},{"id":"https://openalex.org/keywords/state","display_name":"State (computer science)","score":0.4956310987472534},{"id":"https://openalex.org/keywords/polynomial","display_name":"Polynomial","score":0.4755396842956543},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.4617277681827545},{"id":"https://openalex.org/keywords/applied-mathematics","display_name":"Applied mathematics","score":0.4581834375858307},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.4369962513446808},{"id":"https://openalex.org/keywords/algebra-over-a-field","display_name":"Algebra over a field","score":0.32247722148895264},{"id":"https://openalex.org/keywords/pure-mathematics","display_name":"Pure mathematics","score":0.28746455907821655},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.2646370530128479},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.19876188039779663},{"id":"https://openalex.org/keywords/mathematical-analysis","display_name":"Mathematical analysis","score":0.15226474404335022},{"id":"https://openalex.org/keywords/statistics","display_name":"Statistics","score":0.06915280222892761}],"concepts":[{"id":"https://openalex.org/C153269930","wikidata":"https://www.wikidata.org/wiki/Q430001","display_name":"Decidability","level":2,"score":0.8194158673286438},{"id":"https://openalex.org/C2983497884","wikidata":"https://www.wikidata.org/wiki/Q176452","display_name":"Finite state","level":3,"score":0.5187616348266602},{"id":"https://openalex.org/C48103436","wikidata":"https://www.wikidata.org/wiki/Q599031","display_name":"State (computer science)","level":2,"score":0.4956310987472534},{"id":"https://openalex.org/C90119067","wikidata":"https://www.wikidata.org/wiki/Q43260","display_name":"Polynomial","level":2,"score":0.4755396842956543},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.4617277681827545},{"id":"https://openalex.org/C28826006","wikidata":"https://www.wikidata.org/wiki/Q33521","display_name":"Applied mathematics","level":1,"score":0.4581834375858307},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.4369962513446808},{"id":"https://openalex.org/C136119220","wikidata":"https://www.wikidata.org/wiki/Q1000660","display_name":"Algebra over a field","level":2,"score":0.32247722148895264},{"id":"https://openalex.org/C202444582","wikidata":"https://www.wikidata.org/wiki/Q837863","display_name":"Pure mathematics","level":1,"score":0.28746455907821655},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.2646370530128479},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.19876188039779663},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.15226474404335022},{"id":"https://openalex.org/C105795698","wikidata":"https://www.wikidata.org/wiki/Q12483","display_name":"Statistics","level":1,"score":0.06915280222892761},{"id":"https://openalex.org/C98763669","wikidata":"https://www.wikidata.org/wiki/Q176645","display_name":"Markov chain","level":2,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1090/dimacs/035/17","is_oa":false,"landing_page_url":"https://doi.org/10.1090/dimacs/035/17","pdf_url":null,"source":{"id":"https://openalex.org/S4210177973","display_name":"DIMACS series in discrete mathematics and theoretical computer science","issn_l":"1052-1798","issn":["1052-1798","2472-4793"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"book series"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"DIMACS Series in Discrete Mathematics and Theoretical Computer Science","raw_type":"book-chapter"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.56.7607","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.56.7607","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.cs.albany.edu/~sandeep/concurrency/satwr.ps","raw_type":"text"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":0,"referenced_works":[],"related_works":["https://openalex.org/W2104190504","https://openalex.org/W4200384650","https://openalex.org/W2001919142","https://openalex.org/W1523056165","https://openalex.org/W2076063560","https://openalex.org/W1984301931","https://openalex.org/W2024384024","https://openalex.org/W2107979732","https://openalex.org/W1964907177","https://openalex.org/W1560714495"],"abstract_inverted_index":{"We":[0,83],"present":[1,72,85],"a":[2,61,86,101],"uniform":[3],"approach":[4,22],"for":[5,17,30,60,76,95,120,123,137],"proving":[6],"the":[7,27,41,49,77,81,91],"polynomial":[8,73],"time":[9,74,79],"decidability":[10],"of":[11,40,63,68,90,104,113],"various":[12],"simulation":[13,42],"and":[14,36,44],"equivalence":[15,45,97,122],"relations":[16],"finite":[18,141],"state":[19],"processes.":[20],"Our":[21],"involves":[23],"efficient":[24,58],"reductions":[25],"to":[26,38,99],"satisfiability":[28],"problem":[29,131],"Horn":[31],"formulas.":[32],"It":[33],"applies":[34],"directly":[35],"naturally":[37],"most":[39],"preorders":[43],"relations,":[46,70],"studied":[47],"in":[48,80,132],"literature.":[50,82],"Here":[51],"we":[52,71],"illustrate":[53],"our":[54,114],"methodology":[55],"by":[56],"deriving":[57],"algorithms":[59,75],"number":[62],"such":[64,105],"relations.":[65],"For":[66],"some":[67],"these":[69],"first":[78],"also":[84],"HORNSAT":[87],"based":[88,108],"interpretation":[89],"existing":[92],"bottom-up":[93,106],"algorithm":[94,119,136],"bisimulation":[96,121],"[KS90]":[98],"provide":[100],"better":[102],"understanding":[103],"partition":[107],"methods":[109],"[KS90,":[110],"PT87].":[111],"Corollaries":[112],"results":[115],"include":[116],"an":[117,129,134],"NC":[118],"deterministic":[124],"transition":[125],"system":[126],"(posed":[127],"as":[128],"open":[130],"[GHR95]),":[133],"easy":[135],"computing":[138],"simulations":[139],"on":[140],"graphs":[142],"[...":[143]},"counts_by_year":[{"year":2020,"cited_by_count":1},{"year":2013,"cited_by_count":1},{"year":2012,"cited_by_count":1}],"updated_date":"2026-04-07T06:01:17.266235","created_date":"2025-10-10T00:00:00"}