{"id":"https://openalex.org/W2153273838","doi":"https://doi.org/10.1007/3-540-56496-9_24","title":"Decidability of bisimulation equivalences for parallel timer processes","display_name":"Decidability of bisimulation equivalences for parallel timer processes","publication_year":1993,"publication_date":"1993-01-01","ids":{"openalex":"https://openalex.org/W2153273838","doi":"https://doi.org/10.1007/3-540-56496-9_24","mag":"2153273838"},"language":"en","primary_location":{"id":"doi:10.1007/3-540-56496-9_24","is_oa":true,"landing_page_url":"https://doi.org/10.1007/3-540-56496-9_24","pdf_url":"https://link.springer.com/content/pdf/10.1007/3-540-56496-9_24.pdf","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":true,"oa_status":"bronze","oa_url":"https://link.springer.com/content/pdf/10.1007/3-540-56496-9_24.pdf","any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5051714710","display_name":"K\u0101rlis \u010cer\u0101ns","orcid":"https://orcid.org/0000-0002-0154-5294"},"institutions":[{"id":"https://openalex.org/I91123046","display_name":"University of Latvia","ror":"https://ror.org/05g3mes96","country_code":"LV","type":"education","lineage":["https://openalex.org/I91123046"]}],"countries":["LV"],"is_corresponding":true,"raw_author_name":"K\u0101rlis \u010cer\u0101ns","raw_affiliation_strings":["Institute of Mathematics and Computer Science, University of Latvia, Rainis blvd. 29, LV-1050, Riga, Latvia"],"affiliations":[{"raw_affiliation_string":"Institute of Mathematics and Computer Science, University of Latvia, Rainis blvd. 29, LV-1050, Riga, Latvia","institution_ids":["https://openalex.org/I91123046"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5051714710"],"corresponding_institution_ids":["https://openalex.org/I91123046"],"apc_list":{"value":5000,"currency":"EUR","value_usd":5392},"apc_paid":null,"fwci":19.1369,"has_fulltext":true,"cited_by_count":188,"citation_normalized_percentile":{"value":0.99763817,"is_in_top_1_percent":true,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":89,"max":100},"biblio":{"volume":null,"issue":null,"first_page":"302","last_page":"315"},"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/T10933","display_name":"Real-Time Systems Scheduling","score":0.9968000054359436,"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/T11125","display_name":"Petri Nets in System Modeling","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"}}],"keywords":[{"id":"https://openalex.org/keywords/bisimulation","display_name":"Bisimulation","score":0.9008251428604126},{"id":"https://openalex.org/keywords/decidability","display_name":"Decidability","score":0.8781655430793762},{"id":"https://openalex.org/keywords/timer","display_name":"Timer","score":0.835090696811676},{"id":"https://openalex.org/keywords/undecidable-problem","display_name":"Undecidable problem","score":0.7951539754867554},{"id":"https://openalex.org/keywords/reachability","display_name":"Reachability","score":0.794667661190033},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.7259236574172974},{"id":"https://openalex.org/keywords/equivalence","display_name":"Equivalence (formal languages)","score":0.6578404903411865},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.5370238423347473},{"id":"https://openalex.org/keywords/reachability-problem","display_name":"Reachability problem","score":0.46935778856277466},{"id":"https://openalex.org/keywords/vertex","display_name":"Vertex (graph theory)","score":0.45286956429481506},{"id":"https://openalex.org/keywords/automaton","display_name":"Automaton","score":0.4484744071960449},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.4363100826740265},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.30605512857437134},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.24110651016235352},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.0683709979057312}],"concepts":[{"id":"https://openalex.org/C135315306","wikidata":"https://www.wikidata.org/wiki/Q866364","display_name":"Bisimulation","level":2,"score":0.9008251428604126},{"id":"https://openalex.org/C153269930","wikidata":"https://www.wikidata.org/wiki/Q430001","display_name":"Decidability","level":2,"score":0.8781655430793762},{"id":"https://openalex.org/C2776633867","wikidata":"https://www.wikidata.org/wiki/Q186612","display_name":"Timer","level":3,"score":0.835090696811676},{"id":"https://openalex.org/C192034797","wikidata":"https://www.wikidata.org/wiki/Q3502995","display_name":"Undecidable problem","level":3,"score":0.7951539754867554},{"id":"https://openalex.org/C136643341","wikidata":"https://www.wikidata.org/wiki/Q1361526","display_name":"Reachability","level":2,"score":0.794667661190033},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7259236574172974},{"id":"https://openalex.org/C2780069185","wikidata":"https://www.wikidata.org/wiki/Q7977945","display_name":"Equivalence (formal languages)","level":2,"score":0.6578404903411865},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.5370238423347473},{"id":"https://openalex.org/C2777669093","wikidata":"https://www.wikidata.org/wiki/Q17141570","display_name":"Reachability problem","level":3,"score":0.46935778856277466},{"id":"https://openalex.org/C80899671","wikidata":"https://www.wikidata.org/wiki/Q1304193","display_name":"Vertex (graph theory)","level":3,"score":0.45286956429481506},{"id":"https://openalex.org/C112505250","wikidata":"https://www.wikidata.org/wiki/Q787116","display_name":"Automaton","level":2,"score":0.4484744071960449},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.4363100826740265},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.30605512857437134},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.24110651016235352},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.0683709979057312},{"id":"https://openalex.org/C173018170","wikidata":"https://www.wikidata.org/wiki/Q165678","display_name":"Microcontroller","level":2,"score":0.0},{"id":"https://openalex.org/C9390403","wikidata":"https://www.wikidata.org/wiki/Q3966","display_name":"Computer hardware","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1007/3-540-56496-9_24","is_oa":true,"landing_page_url":"https://doi.org/10.1007/3-540-56496-9_24","pdf_url":"https://link.springer.com/content/pdf/10.1007/3-540-56496-9_24.pdf","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":{"id":"doi:10.1007/3-540-56496-9_24","is_oa":true,"landing_page_url":"https://doi.org/10.1007/3-540-56496-9_24","pdf_url":"https://link.springer.com/content/pdf/10.1007/3-540-56496-9_24.pdf","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"},"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":true,"grobid_xml":true},"content_urls":{"pdf":"https://content.openalex.org/works/W2153273838.pdf","grobid_xml":"https://content.openalex.org/works/W2153273838.grobid-xml"},"referenced_works_count":16,"referenced_works":["https://openalex.org/W3820865","https://openalex.org/W59365162","https://openalex.org/W1491196069","https://openalex.org/W1496019238","https://openalex.org/W1529059198","https://openalex.org/W1573724186","https://openalex.org/W1596400039","https://openalex.org/W1602114053","https://openalex.org/W1846906072","https://openalex.org/W1889612581","https://openalex.org/W2024253297","https://openalex.org/W2042801853","https://openalex.org/W2153439859","https://openalex.org/W2156879919","https://openalex.org/W3142910663","https://openalex.org/W6636134071"],"related_works":["https://openalex.org/W2020140696","https://openalex.org/W2584984136","https://openalex.org/W2591956186","https://openalex.org/W1553002193","https://openalex.org/W1805200712","https://openalex.org/W1563786920","https://openalex.org/W1993478572","https://openalex.org/W2161984463","https://openalex.org/W2489809986","https://openalex.org/W2119045600"],"abstract_inverted_index":null,"counts_by_year":[{"year":2026,"cited_by_count":1},{"year":2024,"cited_by_count":15},{"year":2023,"cited_by_count":2},{"year":2022,"cited_by_count":1},{"year":2020,"cited_by_count":1},{"year":2019,"cited_by_count":3},{"year":2018,"cited_by_count":6},{"year":2017,"cited_by_count":6},{"year":2015,"cited_by_count":5},{"year":2014,"cited_by_count":4},{"year":2013,"cited_by_count":7},{"year":2012,"cited_by_count":3}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}