{"id":"https://openalex.org/W1766510866","doi":"https://doi.org/10.1145/2629638","title":"A Logic for True Concurrency","display_name":"A Logic for True Concurrency","publication_year":2014,"publication_date":"2014-07-01","ids":{"openalex":"https://openalex.org/W1766510866","doi":"https://doi.org/10.1145/2629638","mag":"1766510866"},"language":"en","primary_location":{"id":"doi:10.1145/2629638","is_oa":false,"landing_page_url":"https://doi.org/10.1145/2629638","pdf_url":null,"source":{"id":"https://openalex.org/S118992489","display_name":"Journal of the ACM","issn_l":"0004-5411","issn":["0004-5411","1557-735X"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319798","host_organization_name":"Association for Computing Machinery","host_organization_lineage":["https://openalex.org/P4310319798"],"host_organization_lineage_names":["Association for Computing Machinery"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Journal of the ACM","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/A5031056947","display_name":"Paolo Baldan","orcid":"https://orcid.org/0000-0001-9357-5599"},"institutions":[{"id":"https://openalex.org/I138689650","display_name":"University of Padua","ror":"https://ror.org/00240q980","country_code":"IT","type":"education","lineage":["https://openalex.org/I138689650"]}],"countries":["IT"],"is_corresponding":false,"raw_author_name":"Paolo Baldan","raw_affiliation_strings":["University of Padova"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"University of Padova","institution_ids":["https://openalex.org/I138689650"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5047065626","display_name":"Silvia Craf\u00e0","orcid":"https://orcid.org/0000-0003-0993-4734"},"institutions":[{"id":"https://openalex.org/I138689650","display_name":"University of Padua","ror":"https://ror.org/00240q980","country_code":"IT","type":"education","lineage":["https://openalex.org/I138689650"]}],"countries":["IT"],"is_corresponding":false,"raw_author_name":"Silvia Crafa","raw_affiliation_strings":["University of Padova"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"University of Padova","institution_ids":["https://openalex.org/I138689650"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":[],"corresponding_institution_ids":["https://openalex.org/I138689650"],"apc_list":null,"apc_paid":null,"fwci":4.5377,"has_fulltext":false,"cited_by_count":35,"citation_normalized_percentile":{"value":0.94686815,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":89,"max":98},"biblio":{"volume":"61","issue":"4","first_page":"1","last_page":"36"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10142","display_name":"Formal Methods in Verification","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/T10142","display_name":"Formal Methods in Verification","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/T10126","display_name":"Logic, programming, and type systems","score":0.9997000098228455,"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/T11567","display_name":"semigroups and automata theory","score":0.9988999962806702,"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/concurrency","display_name":"Concurrency","score":0.8131231069564819},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.6067897081375122},{"id":"https://openalex.org/keywords/interleaving","display_name":"Interleaving","score":0.559197187423706},{"id":"https://openalex.org/keywords/bisimulation","display_name":"Bisimulation","score":0.5238309502601624},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.49615558981895447},{"id":"https://openalex.org/keywords/extension","display_name":"Extension (predicate logic)","score":0.47953104972839355},{"id":"https://openalex.org/keywords/predicate-logic","display_name":"Predicate logic","score":0.4674912989139557},{"id":"https://openalex.org/keywords/equivalence","display_name":"Equivalence (formal languages)","score":0.45902544260025024},{"id":"https://openalex.org/keywords/predicate","display_name":"Predicate (mathematical logic)","score":0.4417722523212433},{"id":"https://openalex.org/keywords/programming-language","display_name":"Programming language","score":0.3671218156814575},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.34460175037384033},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.3305026590824127},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.30087417364120483},{"id":"https://openalex.org/keywords/description-logic","display_name":"Description logic","score":0.20062804222106934}],"concepts":[{"id":"https://openalex.org/C193702766","wikidata":"https://www.wikidata.org/wiki/Q1414548","display_name":"Concurrency","level":2,"score":0.8131231069564819},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6067897081375122},{"id":"https://openalex.org/C28034677","wikidata":"https://www.wikidata.org/wiki/Q17092530","display_name":"Interleaving","level":2,"score":0.559197187423706},{"id":"https://openalex.org/C135315306","wikidata":"https://www.wikidata.org/wiki/Q866364","display_name":"Bisimulation","level":2,"score":0.5238309502601624},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.49615558981895447},{"id":"https://openalex.org/C2778029271","wikidata":"https://www.wikidata.org/wiki/Q5421931","display_name":"Extension (predicate logic)","level":2,"score":0.47953104972839355},{"id":"https://openalex.org/C19689857","wikidata":"https://www.wikidata.org/wiki/Q4055684","display_name":"Predicate logic","level":3,"score":0.4674912989139557},{"id":"https://openalex.org/C2780069185","wikidata":"https://www.wikidata.org/wiki/Q7977945","display_name":"Equivalence (formal languages)","level":2,"score":0.45902544260025024},{"id":"https://openalex.org/C140146324","wikidata":"https://www.wikidata.org/wiki/Q1144319","display_name":"Predicate (mathematical logic)","level":2,"score":0.4417722523212433},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.3671218156814575},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.34460175037384033},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.3305026590824127},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.30087417364120483},{"id":"https://openalex.org/C102993220","wikidata":"https://www.wikidata.org/wiki/Q387196","display_name":"Description logic","level":2,"score":0.20062804222106934},{"id":"https://openalex.org/C111919701","wikidata":"https://www.wikidata.org/wiki/Q9135","display_name":"Operating system","level":1,"score":0.0}],"mesh":[],"locations_count":7,"locations":[{"id":"doi:10.1145/2629638","is_oa":false,"landing_page_url":"https://doi.org/10.1145/2629638","pdf_url":null,"source":{"id":"https://openalex.org/S118992489","display_name":"Journal of the ACM","issn_l":"0004-5411","issn":["0004-5411","1557-735X"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319798","host_organization_name":"Association for Computing Machinery","host_organization_lineage":["https://openalex.org/P4310319798"],"host_organization_lineage_names":["Association for Computing Machinery"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Journal of the ACM","raw_type":"journal-article"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.167.3736","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.167.3736","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.math.unipd.it/%7Ecrafa/Pubblicazioni/ConcLogic.pdf","raw_type":"text"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.167.4609","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.167.4609","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.math.unipd.it/%7Ebaldan/Papers/Soft-copy-pdf/ConcLogic.pdf","raw_type":"text"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.696.8","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.696.8","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.math.unipd.it/%7Ebaldan/Papers/Soft-copy-pdf/ConcLogic-JACM.pdf","raw_type":"text"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.697.320","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.697.320","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.math.unipd.it/%7Ebaldan/Papers/Soft-copy-pdf/JACM-ConcLogic-2014.pdf","raw_type":"text"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.746.8290","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.746.8290","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://arxiv.org/pdf/1110.4094.pdf","raw_type":"text"},{"id":"pmh:oai:www.research.unipd.it:11577/2891698","is_oa":false,"landing_page_url":"http://hdl.handle.net/11577/2891698","pdf_url":null,"source":{"id":"https://openalex.org/S4306402547","display_name":"Padua Research Archive (University of Padova)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I138689650","host_organization_name":"University of Padua","host_organization_lineage":["https://openalex.org/I138689650"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"info:eu-repo/semantics/article"}],"best_oa_location":null,"sustainable_development_goals":[{"display_name":"Reduced inequalities","id":"https://metadata.un.org/sdg/10","score":0.4399999976158142}],"awards":[],"funders":[{"id":"https://openalex.org/F4320321873","display_name":"Ministero dell\u2019Istruzione, dell\u2019Universit\u00e0 e della Ricerca","ror":"https://ror.org/0166hxq48"}],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":34,"referenced_works":["https://openalex.org/W100298686","https://openalex.org/W1490651621","https://openalex.org/W1524031113","https://openalex.org/W1526408496","https://openalex.org/W1529088080","https://openalex.org/W1532426035","https://openalex.org/W1543119109","https://openalex.org/W1549968516","https://openalex.org/W1570780024","https://openalex.org/W1587299948","https://openalex.org/W1720837145","https://openalex.org/W1967386165","https://openalex.org/W1973627522","https://openalex.org/W1978469611","https://openalex.org/W1984801861","https://openalex.org/W1991052229","https://openalex.org/W2003499082","https://openalex.org/W2029027766","https://openalex.org/W2039290601","https://openalex.org/W2082586807","https://openalex.org/W2098851083","https://openalex.org/W2105223068","https://openalex.org/W2110052988","https://openalex.org/W2120878557","https://openalex.org/W2122860260","https://openalex.org/W2134326845","https://openalex.org/W2140317178","https://openalex.org/W2173961470","https://openalex.org/W2205337852","https://openalex.org/W2218929402","https://openalex.org/W2561675875","https://openalex.org/W2570165438","https://openalex.org/W2914421362","https://openalex.org/W4285719527"],"related_works":["https://openalex.org/W2273393794","https://openalex.org/W2133697637","https://openalex.org/W59382029","https://openalex.org/W4253571630","https://openalex.org/W2395025735","https://openalex.org/W2094903923","https://openalex.org/W1555673433","https://openalex.org/W4319456988","https://openalex.org/W1495872178","https://openalex.org/W2376140444"],"abstract_inverted_index":{"We":[0,63],"propose":[1,65],"a":[2,61,89,99],"logic":[3,30,70],"for":[4],"true":[5,38,94],"concurrency":[6,80],"whose":[7],"formulae":[8],"predicate":[9],"about":[10],"events":[11],"in":[12,42],"computations":[13],"and":[14,26,47,53,79,97],"their":[15],"causal":[16,78],"dependencies.":[17],"The":[18],"induced":[19],"logical":[20],"equivalence":[21],"is":[22,57],"hereditary":[23],"history-preserving":[24,48],"bisimilarity,":[25,56],"fragments":[27],"of":[28,68,82,92,102],"the":[29,43,69,93,103,106],"can":[31],"be":[32],"identified":[33],"which":[34],"correspond":[35],"to":[36,76,88,98],"other":[37],"concurrent":[39,95],"behavioural":[40,108],"equivalences":[41],"literature:":[44],"step,":[45],"pomset":[46],"bisimilarity.":[49],"Standard":[50],"Hennessy-Milner":[51],"logic,":[52],"thus":[54,74],"(interleaving)":[55],"also":[58,64],"recovered":[59],"as":[60],"fragment.":[62],"an":[66],"extension":[67],"with":[71],"fixpoint":[72],"operators,":[73],"allowing":[75],"describe":[77],"properties":[81],"infinite":[83],"computations.":[84],"This":[85],"work":[86],"contributes":[87],"rational":[90],"presentation":[91],"spectrum":[96],"deeper":[100],"understanding":[101],"relations":[104],"between":[105],"involved":[107],"equivalences.":[109]},"counts_by_year":[{"year":2026,"cited_by_count":1},{"year":2025,"cited_by_count":3},{"year":2024,"cited_by_count":2},{"year":2023,"cited_by_count":4},{"year":2022,"cited_by_count":2},{"year":2021,"cited_by_count":1},{"year":2020,"cited_by_count":4},{"year":2019,"cited_by_count":1},{"year":2018,"cited_by_count":4},{"year":2017,"cited_by_count":5},{"year":2016,"cited_by_count":4},{"year":2015,"cited_by_count":3},{"year":2014,"cited_by_count":1}],"updated_date":"2026-07-28T07:46:37.118299","created_date":"2025-10-10T00:00:00"}