{"id":"https://openalex.org/W1527677548","doi":"https://doi.org/10.1007/978-3-642-16265-7_10","title":"A Compositional Method for Deciding Equivalence and Termination of Nondeterministic Programs","display_name":"A Compositional Method for Deciding Equivalence and Termination of Nondeterministic Programs","publication_year":2010,"publication_date":"2010-01-01","ids":{"openalex":"https://openalex.org/W1527677548","doi":"https://doi.org/10.1007/978-3-642-16265-7_10","mag":"1527677548"},"language":"en","primary_location":{"id":"doi:10.1007/978-3-642-16265-7_10","is_oa":false,"landing_page_url":"https://doi.org/10.1007/978-3-642-16265-7_10","pdf_url":null,"source":{"id":"https://openalex.org/S106296714","display_name":"Lecture notes in computer science","issn_l":"0302-9743","issn":["0302-9743","1611-3349"],"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":"book series"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Lecture Notes in 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/A5063086549","display_name":"Aleksandar S. Dimovski","orcid":"https://orcid.org/0000-0002-3601-2631"},"institutions":[{"id":"https://openalex.org/I139806458","display_name":"American University of Europe","ror":"https://ror.org/00q7dn693","country_code":"MK","type":"education","lineage":["https://openalex.org/I139806458"]}],"countries":["MK"],"is_corresponding":true,"raw_author_name":"Aleksandar Dimovski","raw_affiliation_strings":["Faculty of Information-Communication Tech., FON University, Skopje","Faculty of Information-Communication Tech., FON University, Skopje#TAB#"],"affiliations":[{"raw_affiliation_string":"Faculty of Information-Communication Tech., FON University, Skopje","institution_ids":["https://openalex.org/I139806458"]},{"raw_affiliation_string":"Faculty of Information-Communication Tech., FON University, Skopje#TAB#","institution_ids":["https://openalex.org/I139806458"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5063086549"],"corresponding_institution_ids":["https://openalex.org/I139806458"],"apc_list":{"value":5000,"currency":"EUR","value_usd":5392},"apc_paid":null,"fwci":0.7325,"has_fulltext":false,"cited_by_count":6,"citation_normalized_percentile":{"value":0.69377049,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":96},"biblio":{"volume":null,"issue":null,"first_page":"121","last_page":"135"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10142","display_name":"Formal Methods in Verification","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"}},"topics":[{"id":"https://openalex.org/T10142","display_name":"Formal Methods in Verification","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/T10126","display_name":"Logic, programming, and type systems","score":0.9993000030517578,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"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/T11010","display_name":"Logic, Reasoning, and Knowledge","score":0.9955999851226807,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"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/nondeterministic-algorithm","display_name":"Nondeterministic algorithm","score":0.8757468461990356},{"id":"https://openalex.org/keywords/observational-equivalence","display_name":"Observational equivalence","score":0.8402707576751709},{"id":"https://openalex.org/keywords/process-calculus","display_name":"Process calculus","score":0.7601361274719238},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.7147336602210999},{"id":"https://openalex.org/keywords/recursion","display_name":"Recursion (computer science)","score":0.6023240685462952},{"id":"https://openalex.org/keywords/liveness","display_name":"Liveness","score":0.600387454032898},{"id":"https://openalex.org/keywords/equivalence","display_name":"Equivalence (formal languages)","score":0.578793466091156},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.5477721691131592},{"id":"https://openalex.org/keywords/programming-language","display_name":"Programming language","score":0.5097371935844421},{"id":"https://openalex.org/keywords/formalism","display_name":"Formalism (music)","score":0.47198277711868286},{"id":"https://openalex.org/keywords/operational-semantics","display_name":"Operational semantics","score":0.4240700304508209},{"id":"https://openalex.org/keywords/algebra-over-a-field","display_name":"Algebra over a field","score":0.3855513334274292},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.3739403486251831},{"id":"https://openalex.org/keywords/semantics","display_name":"Semantics (computer science)","score":0.33654314279556274},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.24136784672737122},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.21395736932754517}],"concepts":[{"id":"https://openalex.org/C176181172","wikidata":"https://www.wikidata.org/wiki/Q3490301","display_name":"Nondeterministic algorithm","level":2,"score":0.8757468461990356},{"id":"https://openalex.org/C2777721189","wikidata":"https://www.wikidata.org/wiki/Q17121921","display_name":"Observational equivalence","level":2,"score":0.8402707576751709},{"id":"https://openalex.org/C161771561","wikidata":"https://www.wikidata.org/wiki/Q1970286","display_name":"Process calculus","level":2,"score":0.7601361274719238},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7147336602210999},{"id":"https://openalex.org/C168773036","wikidata":"https://www.wikidata.org/wiki/Q264164","display_name":"Recursion (computer science)","level":2,"score":0.6023240685462952},{"id":"https://openalex.org/C15569618","wikidata":"https://www.wikidata.org/wiki/Q3561421","display_name":"Liveness","level":2,"score":0.600387454032898},{"id":"https://openalex.org/C2780069185","wikidata":"https://www.wikidata.org/wiki/Q7977945","display_name":"Equivalence (formal languages)","level":2,"score":0.578793466091156},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.5477721691131592},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.5097371935844421},{"id":"https://openalex.org/C73301696","wikidata":"https://www.wikidata.org/wiki/Q5469984","display_name":"Formalism (music)","level":3,"score":0.47198277711868286},{"id":"https://openalex.org/C156325763","wikidata":"https://www.wikidata.org/wiki/Q1930895","display_name":"Operational semantics","level":3,"score":0.4240700304508209},{"id":"https://openalex.org/C136119220","wikidata":"https://www.wikidata.org/wiki/Q1000660","display_name":"Algebra over a field","level":2,"score":0.3855513334274292},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.3739403486251831},{"id":"https://openalex.org/C184337299","wikidata":"https://www.wikidata.org/wiki/Q1437428","display_name":"Semantics (computer science)","level":2,"score":0.33654314279556274},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.24136784672737122},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.21395736932754517},{"id":"https://openalex.org/C153349607","wikidata":"https://www.wikidata.org/wiki/Q36649","display_name":"Visual arts","level":1,"score":0.0},{"id":"https://openalex.org/C202444582","wikidata":"https://www.wikidata.org/wiki/Q837863","display_name":"Pure mathematics","level":1,"score":0.0},{"id":"https://openalex.org/C558565934","wikidata":"https://www.wikidata.org/wiki/Q2743","display_name":"Musical","level":2,"score":0.0},{"id":"https://openalex.org/C142362112","wikidata":"https://www.wikidata.org/wiki/Q735","display_name":"Art","level":0,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1007/978-3-642-16265-7_10","is_oa":false,"landing_page_url":"https://doi.org/10.1007/978-3-642-16265-7_10","pdf_url":null,"source":{"id":"https://openalex.org/S106296714","display_name":"Lecture notes in computer science","issn_l":"0302-9743","issn":["0302-9743","1611-3349"],"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":"book series"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Lecture Notes in Computer Science","raw_type":"book-chapter"}],"best_oa_location":null,"sustainable_development_goals":[{"score":0.7900000214576721,"display_name":"Peace, Justice and strong institutions","id":"https://metadata.un.org/sdg/16"}],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":19,"referenced_works":["https://openalex.org/W605212316","https://openalex.org/W1503537039","https://openalex.org/W1505135855","https://openalex.org/W1556566737","https://openalex.org/W1564663187","https://openalex.org/W1578990048","https://openalex.org/W1593349323","https://openalex.org/W1593745409","https://openalex.org/W1885072732","https://openalex.org/W1977216954","https://openalex.org/W2051883613","https://openalex.org/W2110575785","https://openalex.org/W2126194256","https://openalex.org/W2127586427","https://openalex.org/W2129384397","https://openalex.org/W2136877520","https://openalex.org/W2142174533","https://openalex.org/W2159181605","https://openalex.org/W2808195962"],"related_works":["https://openalex.org/W312012212","https://openalex.org/W1604195593","https://openalex.org/W1528153015","https://openalex.org/W1601878028","https://openalex.org/W1495007874","https://openalex.org/W2063465006","https://openalex.org/W1986227685","https://openalex.org/W2089501676","https://openalex.org/W2584954577","https://openalex.org/W2108746194"],"abstract_inverted_index":null,"counts_by_year":[{"year":2017,"cited_by_count":2},{"year":2016,"cited_by_count":1},{"year":2014,"cited_by_count":1},{"year":2013,"cited_by_count":1},{"year":2012,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}