{"id":"https://openalex.org/W2048215977","doi":"https://doi.org/10.1016/s1571-0661(05)80260-9","title":"Place Bisimulation Equivalences for Design of Concurrent and Sequential Systems","display_name":"Place Bisimulation Equivalences for Design of Concurrent and Sequential Systems","publication_year":1998,"publication_date":"1998-01-01","ids":{"openalex":"https://openalex.org/W2048215977","doi":"https://doi.org/10.1016/s1571-0661(05)80260-9","mag":"2048215977"},"language":"en","primary_location":{"id":"doi:10.1016/s1571-0661(05)80260-9","is_oa":true,"landing_page_url":"https://doi.org/10.1016/s1571-0661(05)80260-9","pdf_url":null,"source":{"id":"https://openalex.org/S50368787","display_name":"Electronic Notes in Theoretical Computer Science","issn_l":"1571-0661","issn":["1571-0661"],"is_oa":true,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320990","host_organization_name":"Elsevier BV","host_organization_lineage":["https://openalex.org/P4310320990"],"host_organization_lineage_names":["Elsevier BV"],"type":"journal"},"license":"cc-by-nc-nd","license_id":"https://openalex.org/licenses/cc-by-nc-nd","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Electronic Notes in Theoretical Computer Science","raw_type":"journal-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"diamond","oa_url":"https://doi.org/10.1016/s1571-0661(05)80260-9","any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5064850266","display_name":"Igor V. Tarasyuk","orcid":"https://orcid.org/0000-0002-2047-1921"},"institutions":[{"id":"https://openalex.org/I4387152644","display_name":"A.P. Ershov Institute of Informatics Systems, Siberian Branch of the Russian Academy of Sciences","ror":"https://ror.org/01dc8vg74","country_code":null,"type":"government","lineage":["https://openalex.org/I1313323035","https://openalex.org/I4210127387","https://openalex.org/I4387152644"]}],"countries":["RU"],"is_corresponding":true,"raw_author_name":"Igor V. Tarasyuk","raw_affiliation_strings":["Theoretical Programming Laboratory, A.P. Ershov Institute of Informatics Systems, 6, Acad. Lavrentiev ave., Novosibirsk, 630090, Russia"],"affiliations":[{"raw_affiliation_string":"Theoretical Programming Laboratory, A.P. Ershov Institute of Informatics Systems, 6, Acad. Lavrentiev ave., Novosibirsk, 630090, Russia","institution_ids":["https://openalex.org/I4387152644"]}]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5064850266"],"corresponding_institution_ids":["https://openalex.org/I4387152644"],"apc_list":null,"apc_paid":null,"fwci":0.4908,"has_fulltext":false,"cited_by_count":4,"citation_normalized_percentile":{"value":0.64894399,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":94},"biblio":{"volume":"18","issue":null,"first_page":"191","last_page":"206"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11125","display_name":"Petri Nets in System Modeling","score":0.9998000264167786,"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/T11125","display_name":"Petri Nets in System Modeling","score":0.9998000264167786,"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/T10142","display_name":"Formal Methods in Verification","score":0.9995999932289124,"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/T10703","display_name":"Business Process Modeling and Analysis","score":0.9980000257492065,"subfield":{"id":"https://openalex.org/subfields/1404","display_name":"Management Information Systems"},"field":{"id":"https://openalex.org/fields/14","display_name":"Business, Management and Accounting"},"domain":{"id":"https://openalex.org/domains/2","display_name":"Social Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/bisimulation","display_name":"Bisimulation","score":0.8861610889434814},{"id":"https://openalex.org/keywords/petri-net","display_name":"Petri net","score":0.8018786907196045},{"id":"https://openalex.org/keywords/interleaving","display_name":"Interleaving","score":0.6287899017333984},{"id":"https://openalex.org/keywords/equivalence","display_name":"Equivalence (formal languages)","score":0.5880318284034729},{"id":"https://openalex.org/keywords/merge","display_name":"Merge (version control)","score":0.5631273984909058},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.5585541725158691},{"id":"https://openalex.org/keywords/rotation-formalisms-in-three-dimensions","display_name":"Rotation formalisms in three dimensions","score":0.5108968615531921},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.4976556599140167},{"id":"https://openalex.org/keywords/concurrency","display_name":"Concurrency","score":0.42666590213775635},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.3971145749092102},{"id":"https://openalex.org/keywords/programming-language","display_name":"Programming language","score":0.3449794054031372},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.2542484998703003}],"concepts":[{"id":"https://openalex.org/C135315306","wikidata":"https://www.wikidata.org/wiki/Q866364","display_name":"Bisimulation","level":2,"score":0.8861610889434814},{"id":"https://openalex.org/C38677869","wikidata":"https://www.wikidata.org/wiki/Q724168","display_name":"Petri net","level":2,"score":0.8018786907196045},{"id":"https://openalex.org/C28034677","wikidata":"https://www.wikidata.org/wiki/Q17092530","display_name":"Interleaving","level":2,"score":0.6287899017333984},{"id":"https://openalex.org/C2780069185","wikidata":"https://www.wikidata.org/wiki/Q7977945","display_name":"Equivalence (formal languages)","level":2,"score":0.5880318284034729},{"id":"https://openalex.org/C197129107","wikidata":"https://www.wikidata.org/wiki/Q1921621","display_name":"Merge (version control)","level":2,"score":0.5631273984909058},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5585541725158691},{"id":"https://openalex.org/C171018156","wikidata":"https://www.wikidata.org/wiki/Q7370306","display_name":"Rotation formalisms in three dimensions","level":2,"score":0.5108968615531921},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.4976556599140167},{"id":"https://openalex.org/C193702766","wikidata":"https://www.wikidata.org/wiki/Q1414548","display_name":"Concurrency","level":2,"score":0.42666590213775635},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.3971145749092102},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.3449794054031372},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.2542484998703003},{"id":"https://openalex.org/C23123220","wikidata":"https://www.wikidata.org/wiki/Q816826","display_name":"Information retrieval","level":1,"score":0.0},{"id":"https://openalex.org/C111919701","wikidata":"https://www.wikidata.org/wiki/Q9135","display_name":"Operating system","level":1,"score":0.0},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1016/s1571-0661(05)80260-9","is_oa":true,"landing_page_url":"https://doi.org/10.1016/s1571-0661(05)80260-9","pdf_url":null,"source":{"id":"https://openalex.org/S50368787","display_name":"Electronic Notes in Theoretical Computer Science","issn_l":"1571-0661","issn":["1571-0661"],"is_oa":true,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320990","host_organization_name":"Elsevier BV","host_organization_lineage":["https://openalex.org/P4310320990"],"host_organization_lineage_names":["Elsevier BV"],"type":"journal"},"license":"cc-by-nc-nd","license_id":"https://openalex.org/licenses/cc-by-nc-nd","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Electronic Notes in Theoretical Computer Science","raw_type":"journal-article"}],"best_oa_location":{"id":"doi:10.1016/s1571-0661(05)80260-9","is_oa":true,"landing_page_url":"https://doi.org/10.1016/s1571-0661(05)80260-9","pdf_url":null,"source":{"id":"https://openalex.org/S50368787","display_name":"Electronic Notes in Theoretical Computer Science","issn_l":"1571-0661","issn":["1571-0661"],"is_oa":true,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320990","host_organization_name":"Elsevier BV","host_organization_lineage":["https://openalex.org/P4310320990"],"host_organization_lineage_names":["Elsevier BV"],"type":"journal"},"license":"cc-by-nc-nd","license_id":"https://openalex.org/licenses/cc-by-nc-nd","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Electronic Notes in Theoretical Computer Science","raw_type":"journal-article"},"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":11,"referenced_works":["https://openalex.org/W96010603","https://openalex.org/W140651383","https://openalex.org/W1526408496","https://openalex.org/W1553245026","https://openalex.org/W1555729963","https://openalex.org/W1568134470","https://openalex.org/W1602232868","https://openalex.org/W2003499082","https://openalex.org/W6605624525","https://openalex.org/W6633192335","https://openalex.org/W6634217274"],"related_works":["https://openalex.org/W2909142942","https://openalex.org/W4253571630","https://openalex.org/W2273393794","https://openalex.org/W1981703794","https://openalex.org/W2037080690","https://openalex.org/W2133697637","https://openalex.org/W59382029","https://openalex.org/W2376140444","https://openalex.org/W2094903923","https://openalex.org/W1555673433"],"abstract_inverted_index":{"In":[0,73],"this":[1,104],"paper,":[2],"we":[3,75],"supplement":[4],"the":[5,27,56,64,78,112],"set":[6],"of":[7,25,43,70,89],"basic":[8],"and":[9,32,66,116],"back-forth":[10],"behavioural":[11],"equivalences":[12,59,80,109],"for":[13,63],"Petri":[14,71,91],"nets":[15,83,92],"considered":[16],"in":[17,49],"[11]":[18],"by":[19,35],"place":[20,57],"bisimulation":[21,58],"ones.":[22],"The":[23],"relationships":[24],"all":[26,77,107],"equivalence":[28],"notions":[29],"are":[30,85],"examined,":[31],"their":[33,122],"preservation":[34],"refinements":[36],"is":[37,53],"investigated":[38],"to":[39,120],"find":[40],"out":[41],"which":[42,84],"these":[44],"relations":[45],"may":[46,60],"be":[47,61],"used":[48,62],"top-down":[50],"design.":[51],"It":[52],"demonstrated":[54],"that":[55],"compositional":[65],"history":[67],"preserving":[68],"reduction":[69],"nets.":[72],"addition,":[74],"consider":[76],"mentioned":[79],"on":[81],"sequential":[82,94],"a":[86],"special":[87],"subclass":[88,106],"general":[90],"modelling":[93],"systems,":[95],"where":[96],"no":[97],"two":[98],"actions":[99],"can":[100],"happen":[101],"simultaneously.":[102],"On":[103],"net":[105],"pomset":[108],"merge":[110],"with":[111],"corresponding":[113],"interleaving":[114],"ones,":[115],"it":[117],"allows":[118],"us":[119],"simplify":[121],"check.":[123]},"counts_by_year":[{"year":2019,"cited_by_count":1},{"year":2017,"cited_by_count":1},{"year":2015,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}