{"id":"https://openalex.org/W2159800742","doi":"https://doi.org/10.1017/s0960129503003943","title":"A simple process algebra based on atomic actions with resources","display_name":"A simple process algebra based on atomic actions with resources","publication_year":2004,"publication_date":"2004-02-01","ids":{"openalex":"https://openalex.org/W2159800742","doi":"https://doi.org/10.1017/s0960129503003943","mag":"2159800742"},"language":"en","primary_location":{"id":"doi:10.1017/s0960129503003943","is_oa":false,"landing_page_url":"https://doi.org/10.1017/s0960129503003943","pdf_url":null,"source":{"id":"https://openalex.org/S101766102","display_name":"Mathematical Structures in Computer Science","issn_l":"0960-1295","issn":["0960-1295","1469-8072"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310311721","host_organization_name":"Cambridge University Press","host_organization_lineage":["https://openalex.org/P4310311721","https://openalex.org/P4310311702"],"host_organization_lineage_names":["Cambridge University Press","University of Cambridge"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Mathematical Structures in Computer Science","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/A5064833291","display_name":"Paul Gastin","orcid":"https://orcid.org/0000-0002-1313-7722"},"institutions":[{"id":"https://openalex.org/I204730241","display_name":"Universit\u00e9 Paris Cit\u00e9","ror":"https://ror.org/05f82e368","country_code":"FR","type":"education","lineage":["https://openalex.org/I204730241"]},{"id":"https://openalex.org/I4210094115","display_name":"Laboratoire d'Informatique Algorithmique: Fondements et Applications","ror":"https://ror.org/00pbqgm18","country_code":"FR","type":"facility","lineage":["https://openalex.org/I1294671590","https://openalex.org/I204730241","https://openalex.org/I4210094115","https://openalex.org/I4210159245"]}],"countries":["FR"],"is_corresponding":false,"raw_author_name":"PAUL GASTIN","raw_affiliation_strings":["LIAFA, Universit\u00e9 Paris 7, 2 Place Jussieu, F-75251 Paris Cedex 05"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"LIAFA, Universit\u00e9 Paris 7, 2 Place Jussieu, F-75251 Paris Cedex 05","institution_ids":["https://openalex.org/I4210094115","https://openalex.org/I204730241"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5087271577","display_name":"Michael Mislove","orcid":"https://orcid.org/0000-0002-6650-1399"},"institutions":[{"id":"https://openalex.org/I114832834","display_name":"Tulane University","ror":"https://ror.org/04vmvtb21","country_code":"US","type":"education","lineage":["https://openalex.org/I114832834"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"MICHAEL MISLOVE","raw_affiliation_strings":["Department of Mathematics, Tulane University, New Orleans, LA 70118"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Mathematics, Tulane University, New Orleans, LA 70118","institution_ids":["https://openalex.org/I114832834"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":2,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":4.8456,"has_fulltext":false,"cited_by_count":22,"citation_normalized_percentile":{"value":0.95333046,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":90,"max":94},"biblio":{"volume":"14","issue":"1","first_page":"1","last_page":"55"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10142","display_name":"Formal Methods in Verification","score":0.9991000294685364,"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.9991000294685364,"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/T11125","display_name":"Petri Nets in System Modeling","score":0.9944999814033508,"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.9933000206947327,"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/denotational-semantics","display_name":"Denotational semantics","score":0.8651307821273804},{"id":"https://openalex.org/keywords/concurrency","display_name":"Concurrency","score":0.7322865724563599},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.670830249786377},{"id":"https://openalex.org/keywords/recursion","display_name":"Recursion (computer science)","score":0.6361134052276611},{"id":"https://openalex.org/keywords/programming-language","display_name":"Programming language","score":0.5474510788917542},{"id":"https://openalex.org/keywords/denotational-semantics-of-the-actor-model","display_name":"Denotational semantics of the Actor model","score":0.5405004024505615},{"id":"https://openalex.org/keywords/action-semantics","display_name":"Action semantics","score":0.5357823371887207},{"id":"https://openalex.org/keywords/operational-semantics","display_name":"Operational semantics","score":0.5333084464073181},{"id":"https://openalex.org/keywords/domain-theory","display_name":"Domain theory","score":0.5051310658454895},{"id":"https://openalex.org/keywords/process-calculus","display_name":"Process calculus","score":0.4964068531990051},{"id":"https://openalex.org/keywords/semantics","display_name":"Semantics (computer science)","score":0.40824612975120544},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.39581409096717834},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.23976963758468628},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.20634785294532776}],"concepts":[{"id":"https://openalex.org/C207648694","wikidata":"https://www.wikidata.org/wiki/Q1189746","display_name":"Denotational semantics","level":4,"score":0.8651307821273804},{"id":"https://openalex.org/C193702766","wikidata":"https://www.wikidata.org/wiki/Q1414548","display_name":"Concurrency","level":2,"score":0.7322865724563599},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.670830249786377},{"id":"https://openalex.org/C168773036","wikidata":"https://www.wikidata.org/wiki/Q264164","display_name":"Recursion (computer science)","level":2,"score":0.6361134052276611},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.5474510788917542},{"id":"https://openalex.org/C89448276","wikidata":"https://www.wikidata.org/wiki/Q5259284","display_name":"Denotational semantics of the Actor model","level":5,"score":0.5405004024505615},{"id":"https://openalex.org/C150607116","wikidata":"https://www.wikidata.org/wiki/Q4677421","display_name":"Action semantics","level":5,"score":0.5357823371887207},{"id":"https://openalex.org/C156325763","wikidata":"https://www.wikidata.org/wiki/Q1930895","display_name":"Operational semantics","level":3,"score":0.5333084464073181},{"id":"https://openalex.org/C29585364","wikidata":"https://www.wikidata.org/wiki/Q1079166","display_name":"Domain theory","level":2,"score":0.5051310658454895},{"id":"https://openalex.org/C161771561","wikidata":"https://www.wikidata.org/wiki/Q1970286","display_name":"Process calculus","level":2,"score":0.4964068531990051},{"id":"https://openalex.org/C184337299","wikidata":"https://www.wikidata.org/wiki/Q1437428","display_name":"Semantics (computer science)","level":2,"score":0.40824612975120544},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.39581409096717834},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.23976963758468628},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.20634785294532776}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1017/s0960129503003943","is_oa":false,"landing_page_url":"https://doi.org/10.1017/s0960129503003943","pdf_url":null,"source":{"id":"https://openalex.org/S101766102","display_name":"Mathematical Structures in Computer Science","issn_l":"0960-1295","issn":["0960-1295","1469-8072"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310311721","host_organization_name":"Cambridge University Press","host_organization_lineage":["https://openalex.org/P4310311721","https://openalex.org/P4310311702"],"host_organization_lineage_names":["Cambridge University Press","University of Cambridge"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Mathematical Structures in Computer Science","raw_type":"journal-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":22,"referenced_works":["https://openalex.org/W29785878","https://openalex.org/W133701161","https://openalex.org/W159994793","https://openalex.org/W654554709","https://openalex.org/W1539804543","https://openalex.org/W1578801263","https://openalex.org/W1583971359","https://openalex.org/W1585042602","https://openalex.org/W1989279866","https://openalex.org/W1998563363","https://openalex.org/W2001567495","https://openalex.org/W2031124364","https://openalex.org/W2072672662","https://openalex.org/W2113355185","https://openalex.org/W2118229393","https://openalex.org/W2126016661","https://openalex.org/W2128414689","https://openalex.org/W2130056801","https://openalex.org/W2150320481","https://openalex.org/W2513431463","https://openalex.org/W2912084748","https://openalex.org/W2914421362"],"related_works":["https://openalex.org/W3036972880","https://openalex.org/W1968765218","https://openalex.org/W1929699059","https://openalex.org/W2110748634","https://openalex.org/W2952451744","https://openalex.org/W4298869501","https://openalex.org/W2803229276","https://openalex.org/W1628367963","https://openalex.org/W2604377475","https://openalex.org/W2092481413"],"abstract_inverted_index":{"This":[0,168],"paper":[1],"initiates":[2],"the":[3,28,79,84,90,129,198,201,212,216,222,241,247,273,278,289,297,303,309,318],"study":[4],"of":[5,31,40,52,61,68,83,92,176,180,200,236],"a":[6,50,72,109,132,141,145,181,187,192,233,263,269],"process":[7,47,183,208],"algebra":[8,48],"based":[9,231],"on":[10,37,191,232],"atomic":[11,62,95],"actions":[12,42,63,96],"that":[13,18,27,55,77,97,113,159,194,204],"are":[14],"assigned":[15],"resources,":[16],"and":[17,135,144,203,300],"supports":[19,131,155],"true":[20,23,156],"concurrency.":[21],"By":[22],"concurrency":[24],"we":[25,301],"mean":[26],"parallel":[29,110,160],"composition":[30,75,111,161],"concurrent":[32,41,81,103],"processes":[33],"does":[34],"not":[35],"rely":[36],"an":[38],"interleaving":[39],"for":[43,149,173],"its":[44,174],"definition.":[45],"Our":[46,105],"includes":[49,108,136],"number":[51],"interesting":[53],"operators":[54,214,249],"can":[56,253],"be":[57,254],"defined":[58,163,185],"using":[59,186],"resources":[60],"to":[64,117,124,209,296,317],"control":[65],"their":[66],"behaviour:":[67],"particular":[69],"note":[70],"is":[71,98,162,171,184,195,230,260,282,292,312],"(weak)":[73],"sequential":[74],"operator":[76,87,112,134],"exploits":[78],"truly":[80,102],"nature":[82],"semantics;":[85],"this":[86],"extends":[88],"significantly":[89],"operation":[91],"prefixing":[93],"by":[94,197],"supported":[99],"in":[100,215,221,239,262],"most":[101],"semantics.":[104,320],"language":[106,130,217],"also":[107,170,287],"allows":[114],"local":[115],"events":[116,123],"execute":[118,125],"asynchronously,":[119],"while":[120],"requiring":[121],"synchronising":[122],"simultaneously.":[126],"In":[127,225],"addition,":[128],"restriction":[133],"(unguarded)":[137],"recursion.We":[138],"present":[139],"both":[140],"denotational":[142,153,223,228,290,310],"semantics":[143,148,154,169,311],"companion":[146],"operational":[147,258,279,298,319],"our":[150,227,251],"language.":[151],"The":[152,178,284],"concurrency,":[157],"so":[158],"without":[164],"non-determinism":[165],"or":[166],"interleaving.":[167],"novel":[172],"treatment":[175],"recursion.":[177],"meaning":[179],"recursive":[182],"least":[188],"fixed":[189],"point":[190],"subdomain":[193],"determined":[196],"body":[199],"recursion,":[202],"varies":[205],"from":[206,250],"one":[207],"another.":[210],"Nonetheless,":[211],"recursion":[213],"have":[218],"continuous":[219,256],"interpretations":[220],"model.":[224],"fact,":[226],"model":[229,259,280,291],"domain-theoretic":[234],"generalisation":[235],"Mazurkiewicz":[237],"traces":[238],"which":[240,276,308],"concatenation":[242],"operator,":[243],"as":[244,246],"well":[245],"other":[248],"language,":[252],"given":[255],"interpretations.The":[257],"presented":[261],"natural":[264],"SOS":[265],"style.":[266],"We":[267],"prove":[268],"congruence":[270,285],"theorem":[271,286],"relating":[272],"two":[274],"semantics,":[275,299],"implies":[277,288],"itself":[281],"compositional.":[283],"adequate":[293],"with":[294,315],"respect":[295,316],"characterise":[302],"relatively":[304],"mild":[305],"conditions":[306],"under":[307],"fully":[313],"abstract":[314]},"counts_by_year":[{"year":2015,"cited_by_count":1},{"year":2014,"cited_by_count":1}],"updated_date":"2026-06-11T09:08:48.828518","created_date":"2025-10-10T00:00:00"}