Relating State-Based and Process-Based Concurrency through Linear Logic
This paper has the purpose of reviewing some of the established relationships between logic and concurrency, and of exploring new ones. Concurrent and distributed systems are notoriously hard to get right. Therefore, following an approach that has proved highly beneficial for sequential programs, mu...
Gespeichert in:
| Veröffentlicht in: | Electronic notes in theoretical computer science Jg. 165; S. 145 - 176 |
|---|---|
| Hauptverfasser: | , |
| Format: | Journal Article |
| Sprache: | Englisch |
| Veröffentlicht: |
Elsevier B.V
22.11.2006
|
| Schlagworte: | |
| ISSN: | 1571-0661, 1571-0661 |
| Online-Zugang: | Volltext |
| Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
| Abstract | This paper has the purpose of reviewing some of the established relationships between logic and concurrency, and of exploring new ones.
Concurrent and distributed systems are notoriously hard to get right. Therefore, following an approach that has proved highly beneficial for sequential programs, much effort has been invested in tracing the foundations of concurrency in logic. The starting points of such investigations have been various idealized languages of concurrent and distributed programming, in particular the well-established state-transformation model inspired to Petri nets and multiset rewriting, and the prolific process-based models such as the π-calculus and other process algebras. In nearly all cases, the target of these investigations has been linear logic, a formal language that supports a view of formulas as consumable resources. In the first part of this paper, we review some of these interpretations of concurrent languages into linear logic.
In the second part of the paper, we propose a completely new approach to understanding concurrent and distributed programming as a manifestation of logic, which yields a language that merges those two main paradigms of concurrency. Specifically, we present a new semantics for multiset rewriting founded on an alternative view of linear logic. The resulting interpretation is extended with a majority of linear connectives into the language of ω-multisets. This interpretation drops the distinction between multiset elements and rewrite rules, and considerably enriches the expressive power of standard multiset rewriting with embedded rules, choice, replication, and more. Derivations are now primarily viewed as open objects, and are closed only to examine intermediate rewriting states. The resulting language can also be interpreted as a process algebra. For example, a simple translation maps process constructors of the asynchronous π-calculus to rewrite operators, while the structural equivalence corresponds directly to logically-motivated structural properties of ω-multisets (with one exception). |
|---|---|
| AbstractList | This paper has the purpose of reviewing some of the established relationships between logic and concurrency, and of exploring new ones.
Concurrent and distributed systems are notoriously hard to get right. Therefore, following an approach that has proved highly beneficial for sequential programs, much effort has been invested in tracing the foundations of concurrency in logic. The starting points of such investigations have been various idealized languages of concurrent and distributed programming, in particular the well-established state-transformation model inspired to Petri nets and multiset rewriting, and the prolific process-based models such as the π-calculus and other process algebras. In nearly all cases, the target of these investigations has been linear logic, a formal language that supports a view of formulas as consumable resources. In the first part of this paper, we review some of these interpretations of concurrent languages into linear logic.
In the second part of the paper, we propose a completely new approach to understanding concurrent and distributed programming as a manifestation of logic, which yields a language that merges those two main paradigms of concurrency. Specifically, we present a new semantics for multiset rewriting founded on an alternative view of linear logic. The resulting interpretation is extended with a majority of linear connectives into the language of ω-multisets. This interpretation drops the distinction between multiset elements and rewrite rules, and considerably enriches the expressive power of standard multiset rewriting with embedded rules, choice, replication, and more. Derivations are now primarily viewed as open objects, and are closed only to examine intermediate rewriting states. The resulting language can also be interpreted as a process algebra. For example, a simple translation maps process constructors of the asynchronous π-calculus to rewrite operators, while the structural equivalence corresponds directly to logically-motivated structural properties of ω-multisets (with one exception). |
| Author | Cervesato, Iliano Scedrov, Andre |
| Author_xml | – sequence: 1 givenname: Iliano surname: Cervesato fullname: Cervesato, Iliano email: iliano@deductivesolutions.com organization: Deductive Solutions, Annandale, VA — USA – sequence: 2 givenname: Andre surname: Scedrov fullname: Scedrov, Andre email: scedrov@math.upenn.edu organization: Mathematics Department, University of Pennsylvania, Philadelphia, PA — USA |
| BookMark | eNqFkM1KAzEURoMo2FafwM28wIzJpMkkCxdatAoDij_rkEnutCk1kSQV-vZObRfiQlf3cj_Ohe-M0bEPHhC6ILgimPDLVQU-m1TVGPMKswpP6REaEdaQEnNOjn_sp2ic0gpjKkjDR2j-DGudnV8UL1lnKG90Altob4unGAykdLjMgjebGMGbbZGXMWwWy6J1HnQs2rBw5gyd9Hqd4PwwJ-jt7vZ1dl-2j_OH2XVbGjoVubSMcyl70TGq64YSy6SVUhDDOujACtpMjeRYs0bwmg2hpkxIWwPpWYeFoBNE939NDClF6NVHdO86bhXBaudCrdS3C7VzoTBTg4uBkr8o44a6LvgctVv_w17tWRhqfTqIKhk3eADrIpisbHB_8l8Cgn1l |
| CitedBy_id | crossref_primary_10_1007_s10817_010_9190_1 crossref_primary_10_1145_3729317 |
| Cites_doi | 10.1016/0168-0072(94)90011-6 10.1145/237721.237805 10.21236/ADA463016 10.21236/ADA418517 10.1007/3-540-45620-1_39 10.1007/3-540-56992-8_6 10.1145/151233.151242 10.1016/0304-3975(94)00103-0 10.1145/1094622.1094628 10.1006/inco.1994.1036 10.1016/0304-3975(92)90182-F 10.1016/S0304-3975(01)00168-2 10.1109/CSFW.1997.596788 10.1145/359576.359585 10.21236/ADA418538 10.3233/JCS-2005-13102 10.1090/dimacs/018/13 10.1016/0168-0072(91)90068-W 10.3233/JCS-2004-12203 10.1007/BF03037173 10.1016/0304-3975(94)00104-9 10.1016/0304-3975(96)00045-X 10.1016/0304-3975(87)90045-4 10.1109/LICS.1995.523253 10.1109/CSFW.1999.779762 10.21236/ADA465155 10.3233/FI-1999-37303 10.1109/LICS.1990.113747 10.7146/brics.v3i10.19973 10.1017/S0960129500000062 |
| ContentType | Journal Article |
| Copyright | 2006 Elsevier B.V. |
| Copyright_xml | – notice: 2006 Elsevier B.V. |
| DBID | 6I. AAFTH AAYXX CITATION |
| DOI | 10.1016/j.entcs.2006.05.043 |
| DatabaseName | ScienceDirect Open Access Titles Elsevier:ScienceDirect:Open Access CrossRef |
| DatabaseTitle | CrossRef |
| DatabaseTitleList | |
| DeliveryMethod | fulltext_linktorsrc |
| Discipline | Computer Science |
| EISSN | 1571-0661 |
| EndPage | 176 |
| ExternalDocumentID | 10_1016_j_entcs_2006_05_043 S1571066106005202 |
| GroupedDBID | --K --M 0R~ 1B1 1~5 4.4 457 4G. 5GY 5VS 6I. 7-5 71M AABNK AACTN AAEDT AAEDW AAFTH AAIKJ AAKOC AALRI AAQFI AAXUO ABMAC ABWVN ACDAQ ACGFO ACGFS ACNNM ACRLP ACRPL ACXMD ADBBV ADEZE ADMUD ADNMO ADVLN AEIPS AEKER AEXQZ AFTJW AFXIZ AGHFR AIEXJ AIKHN AITUG AKRWK ALMA_UNASSIGNED_HOLDINGS AMRAJ ANKPU AXJTR CS3 DU5 EBS EJD EO8 EO9 EP2 EP3 FDB FEDTE FNPLU G-Q HVGLF HZ~ IHE IXB J1W KOM KQ8 M41 M~E N9A O-L O9- OK1 OZT P2P RIG ROL RPZ SDG SES SPC SSH SSV SSW SSZ 29G 9DU AAQXK AAYWO AAYXX ABFNM ACLOT ACVFH ADCNI ADFGL AEUPX AFPUW AGQPQ AIGII AJMQA AKBMS AKYEP AOUOD ASPBG AVWKF AZFZN CITATION FGOYB GBLVA R2- SEW ~HD |
| ID | FETCH-LOGICAL-c348t-d56699f8b53a2731d59d9981c5bebed8374c960a57862559da3589d2e1f5b0883 |
| ISICitedReferencesCount | 4 |
| ISICitedReferencesURI | http://www.webofscience.com/api/gateway?GWVersion=2&SrcApp=Summon&SrcAuth=ProQuest&DestLinkType=CitingArticles&DestApp=WOS_CPL&KeyUT=000214216400011&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D |
| ISSN | 1571-0661 |
| IngestDate | Sat Nov 29 02:21:58 EST 2025 Tue Nov 18 22:53:35 EST 2025 Thu Apr 10 08:06:46 EDT 2025 |
| IsDoiOpenAccess | true |
| IsOpenAccess | true |
| IsPeerReviewed | false |
| IsScholarly | false |
| Keywords | process algebra multiset rewriting Linear logic |
| Language | English |
| License | http://creativecommons.org/licenses/by-nc-nd/3.0 https://www.elsevier.com/tdm/userlicense/1.0 |
| LinkModel | OpenURL |
| MergedId | FETCHMERGED-LOGICAL-c348t-d56699f8b53a2731d59d9981c5bebed8374c960a57862559da3589d2e1f5b0883 |
| OpenAccessLink | https://dx.doi.org/10.1016/j.entcs.2006.05.043 |
| PageCount | 32 |
| ParticipantIDs | crossref_primary_10_1016_j_entcs_2006_05_043 crossref_citationtrail_10_1016_j_entcs_2006_05_043 elsevier_sciencedirect_doi_10_1016_j_entcs_2006_05_043 |
| PublicationCentury | 2000 |
| PublicationDate | 2006-11-22 |
| PublicationDateYYYYMMDD | 2006-11-22 |
| PublicationDate_xml | – month: 11 year: 2006 text: 2006-11-22 day: 22 |
| PublicationDecade | 2000 |
| PublicationTitle | Electronic notes in theoretical computer science |
| PublicationYear | 2006 |
| Publisher | Elsevier B.V |
| Publisher_xml | – name: Elsevier B.V |
| References | Jensen (bib031) 1986 (1996), pp. 372–385 Miller, Tiu (bib048) 2005; 6 (1999), pp. 55–69 in: A. Voronkov, editor Bellin, Scott (bib009) 1994; 135 Braüner, T. and V. de Paiva Bertinoro, Italy, 2005 Petri, C. A. (1998), pp. 1–25 in: Proc. LICS'90 (1990), pp. 208–218 Martí-Oliet, Meseguer (bib038) 1991; 1 (1992) 242–265. Watkins, K., I. Cervesato, F. Pfenning and D. Walker in preliminary report under the title “Undecidability of bounded security protocols” in “Workshop on Formal Methods and Security Protocols (FMSP'99”, The 1999 Federated Logic Conference (FLoC'99), Trento, Italy, July, 1999 1975, pp. 135–145 , in: D. Miller, editor (1993) 279–294 in: A. Arnold, editor Novosibirsk, Russia, 2003, pp. 177–190 Technical report, Computer Science Department, University of Pisa (1987) Cervesato, I., N. Durgin, P. Lincoln, J. Mitchell and A. Scedrov Andreoli, J.-M. Chicago, IL, 2000 Miller (bib043) 1996; 165 Marina di Vietri, Italy, 1995, pp. 313–318 Seely (bib056) 1989 Valk, R. (2001), pp. 159–177 in: D. Kozen, editor Hodas, Miller (bib030) 1994; 110 Paulson, L.C. in: I. Cervesato, editor Kanovich (bib032) 1994; 67 Fournet, C. and G. Gonthier 1997 1994 Andreoli, Pareschi (bib005) 1991; 9 Clavel, Durán, Eker, Lincoln, Martí-Oliet, Meseguer, Quesada (bib019) 2001 Gunter, C. and V. Gehlot Technical Report CMU-CS-02-101, Computer Science Department., Carnegie Mellon University (2002) Technical Report CMU-CS-02-102, Computer Science Department, Carnegie Mellon University (2002) in: M. Alpuente and M. I. Sessa, editors (2002), pp. 501–516 Milner (bib049) 1999 McDowell, Miller, Palamidessi (bib039) 2003; 294 Cervesato, I., F. Pfenning, D. Walker and K. Watkins Bonn, Germany, 1989, pp. 174–191 Petri (bib051) 1962; Nr. 2 Miller, Tiu (bib047) 2003 Meadows, C. (1995), pp. 156–166 Technical Report ECS-LFCS-96-347, Laboratory for Foundations of Computer Sciences, University of Edinburgh (1996) Sangiorgi, Walker (bib055) 2001 in: E. Lamma and P. Mello, editors Hoare (bib029) 1978; 21 Fages, F., P. Ruet and S. Soliman Abramsky, S. Cervesato, I., N. Durgin, M. Kanovich and A. Scedrov Zucker, J., Formalisation of classical mathematics in AUTOMATH Bistarelli, Cervesato, Lenzini, Martinelli (bib011) 2005; 13 in: E. B editor Technical Report RS-96-10, BRICS, Denmark (1996) (1990), pp. 147–161 Pfenning, F. 1993, pp. 61–84 Kanovich (bib033) 1994; 67 Brown, C. and D. Gurr Farwer (bib023) 1999; 37 Benton, N., G. Bierman, V. de Paiva and M. Hyland (2000), pp. 167–180 Cervesato, I. Miller, D. Tiu, Miller (bib057) 2004; 138 Preliminary report, University of Pennsylvania (1989) Ottawa, Canada, 2003, pp. 3–14 Miller, Nadathur, Pfenning, Scedrov (bib046) 1991; 51 in: F. Bauer and R. Steinbruggen, editors Barber, A. Le Métayer, D. (1963), pp. 386–390 2006 (1993), manuscript Pierce, Turner (bib054) 2000 Lincoln, P. and V. Saraswat Martí-Oliet, Meseguer (bib037) 1989 Engberg, U. and G. Winskel Meseguer (bib041) 1992; 96 Asperti, A. in: H. Veith, N. Heintze and E. Clark, editors Girard (bib026) 1987; 50 Abramsky (bib002) 1994; 135 in: J. Desel and M. Silva, editors Farwer, B. and K. Misra Banâtre, Le Métayer (bib007) 1993; 36 Kobayashi, N. and A. Yonezawa 10.1016/j.entcs.2006.05.043_bib036 10.1016/j.entcs.2006.05.043_bib034 10.1016/j.entcs.2006.05.043_bib035 Miller (10.1016/j.entcs.2006.05.043_bib043) 1996; 165 Meseguer (10.1016/j.entcs.2006.05.043_bib041) 1992; 96 Kanovich (10.1016/j.entcs.2006.05.043_bib032) 1994; 67 Farwer (10.1016/j.entcs.2006.05.043_bib023) 1999; 37 Miller (10.1016/j.entcs.2006.05.043_bib047) 2003 Sangiorgi (10.1016/j.entcs.2006.05.043_bib055) 2001 Hoare (10.1016/j.entcs.2006.05.043_bib029) 1978; 21 Durgin (10.1016/j.entcs.2006.05.043_bib020_1) 2004; 12 10.1016/j.entcs.2006.05.043_bib025 Girard (10.1016/j.entcs.2006.05.043_bib026) 1987; 50 10.1016/j.entcs.2006.05.043_bib024 10.1016/j.entcs.2006.05.043_bib020_2 10.1016/j.entcs.2006.05.043_bib027 Andreoli (10.1016/j.entcs.2006.05.043_bib005) 1991; 9 10.1016/j.entcs.2006.05.043_bib028 10.1016/j.entcs.2006.05.043_bib060 10.1016/j.entcs.2006.05.043_bib021 10.1016/j.entcs.2006.05.043_bib022 Abramsky (10.1016/j.entcs.2006.05.043_bib002) 1994; 135 Miller (10.1016/j.entcs.2006.05.043_bib048) 2005; 6 Jensen (10.1016/j.entcs.2006.05.043_bib031) 1986 10.1016/j.entcs.2006.05.043_bib014 10.1016/j.entcs.2006.05.043_bib058 10.1016/j.entcs.2006.05.043_bib015 10.1016/j.entcs.2006.05.043_bib059 10.1016/j.entcs.2006.05.043_bib012 10.1016/j.entcs.2006.05.043_bib013 10.1016/j.entcs.2006.05.043_bib018 Petri (10.1016/j.entcs.2006.05.043_bib051) 1962; Nr. 2 Clavel (10.1016/j.entcs.2006.05.043_bib019) 2001 10.1016/j.entcs.2006.05.043_bib016 10.1016/j.entcs.2006.05.043_bib017 10.1016/j.entcs.2006.05.043_bib050 Martí-Oliet (10.1016/j.entcs.2006.05.043_bib038) 1991; 1 Tiu (10.1016/j.entcs.2006.05.043_bib057) 2004; 138 10.1016/j.entcs.2006.05.043_bib010 10.1016/j.entcs.2006.05.043_bib052 10.1016/j.entcs.2006.05.043_bib053 Hodas (10.1016/j.entcs.2006.05.043_bib030) 1994; 110 Martí-Oliet (10.1016/j.entcs.2006.05.043_bib037) 1989 Pierce (10.1016/j.entcs.2006.05.043_bib054) 2000 Bistarelli (10.1016/j.entcs.2006.05.043_bib011) 2005; 13 Seely (10.1016/j.entcs.2006.05.043_bib056) 1989 Banâtre (10.1016/j.entcs.2006.05.043_bib007) 1993; 36 10.1016/j.entcs.2006.05.043_bib003 10.1016/j.entcs.2006.05.043_bib004 10.1016/j.entcs.2006.05.043_bib001 10.1016/j.entcs.2006.05.043_bib045 Milner (10.1016/j.entcs.2006.05.043_bib049) 1999 10.1016/j.entcs.2006.05.043_bib008 10.1016/j.entcs.2006.05.043_bib006 McDowell (10.1016/j.entcs.2006.05.043_bib039) 2003; 294 10.1016/j.entcs.2006.05.043_bib040 10.1016/j.entcs.2006.05.043_bib044 10.1016/j.entcs.2006.05.043_bib042 Bellin (10.1016/j.entcs.2006.05.043_bib009) 1994; 135 Miller (10.1016/j.entcs.2006.05.043_bib046) 1991; 51 Kanovich (10.1016/j.entcs.2006.05.043_bib033) 1994; 67 |
| References_xml | – reference: , Chicago, IL, 2000 – reference: Braüner, T. and V. de Paiva, – volume: 138 start-page: 79 year: 2004 end-page: 101 ident: bib057 article-title: A proof search specification of the publication-title: 3rd Workshop on the Foundations of Global Ubiquitous Computing – year: 2001 ident: bib019 article-title: Maude: Specification and programming in rewriting logic – year: 2001 ident: bib055 article-title: The – volume: 135 start-page: 5 year: 1994 end-page: 9 ident: bib002 article-title: Proofs as processes publication-title: Theoretical Computer Science – volume: 9 start-page: 445 year: 1991 end-page: 473 ident: bib005 article-title: Linear objects: Logical processes with built-in inheritance publication-title: Ne Generation Computing – reference: , in: D. Miller, editor, – volume: 165 start-page: 201 year: 1996 end-page: 232 ident: bib043 article-title: A multiple-conclusion specification logic publication-title: Theoretical Computer Science – reference: , in: E. Lamma and P. Mello, editors, – reference: , in: H. Veith, N. Heintze and E. Clark, editors, – reference: (1992) 242–265. – reference: Fages, F., P. Ruet and S. Soliman, – reference: , Technical Report CMU-CS-02-102, Computer Science Department, Carnegie Mellon University (2002) – reference: (1995), pp. 156–166 – volume: 110 start-page: 327 year: 1994 end-page: 365 ident: bib030 article-title: Logic programming in a fragment of intuitionistic linear logic publication-title: Information and Computation – volume: 13 start-page: 3 year: 2005 end-page: 47 ident: bib011 article-title: Relating Multiset Rewriting and Process Algebras for Security Protocol Analysis publication-title: Journal of Computer Security – start-page: 313 year: 1989 end-page: 340 ident: bib037 article-title: From Petri nets to linear logic publication-title: Category Theory and Computer Science – reference: , Technical Report RS-96-10, BRICS, Denmark (1996) – reference: , in: Proc. LICS'90 (1990), pp. 208–218 – reference: , 1975, pp. 135–145 – reference: , Preliminary report, University of Pennsylvania (1989) – reference: Fournet, C. and G. Gonthier, – reference: , in: M. Alpuente and M. I. Sessa, editors, – reference: (1996), pp. 372–385 – reference: , 1994 – reference: , Marina di Vietri, Italy, 1995, pp. 313–318 – reference: , – reference: Barber, A., – reference: (1994) – reference: , Technical Report ECS-LFCS-96-347, Laboratory for Foundations of Computer Sciences, University of Edinburgh (1996) – volume: 96 start-page: 73 year: 1992 end-page: 155 ident: bib041 article-title: Conditional rewriting logic as a unified model of concurrency publication-title: Theoretical Computer Science – reference: , in: J. Desel and M. Silva, editors, – reference: (1998), pp. 1–25 – reference: Meadows, C., – reference: Gunter, C. and V. Gehlot, – reference: , Bonn, Germany, 1989, pp. 174–191 – reference: , in: I. Cervesato, editor, – volume: 51 start-page: 125 year: 1991 end-page: 157 ident: bib046 article-title: Uniform proofs as a foundation for logic programming publication-title: Annals of Pure and Applied Logic – reference: Cervesato, I., N. Durgin, M. Kanovich and A. Scedrov, – reference: preliminary report under the title “Undecidability of bounded security protocols” in “Workshop on Formal Methods and Security Protocols (FMSP'99”, The 1999 Federated Logic Conference (FLoC'99), Trento, Italy, July, 1999 – reference: , in: A. Arnold, editor, – reference: , in: F. Bauer and R. Steinbruggen, editors, – reference: Paulson, L.C., – start-page: 371 year: 1989 end-page: 382 ident: bib056 article-title: Linear logic, ⋆-autonomous categories and cofree coalgebras publication-title: Categories in Computer Science and Logic, proceedings of the AMS-IMS-SIAM Joint Summer Research Conference – reference: Farwer, B. and K. Misra, – reference: Abramsky, S., – volume: 50 start-page: 1 year: 1987 end-page: 102 ident: bib026 article-title: Linear logic publication-title: Theoretical Computer Science – reference: Asperti, A., – reference: Pfenning, F., – volume: 67 start-page: 183 year: 1994 end-page: 212 ident: bib032 article-title: Linear logic as a logic of computation publication-title: Annals of Pure and Applied Logic – volume: 294 start-page: 411 year: 2003 end-page: 437 ident: bib039 article-title: Encoding transition systems in sequent calculus publication-title: Theoretical Computer Science – volume: 37 start-page: 225 year: 1999 end-page: 246 ident: bib023 article-title: A linear logic view of object Petri nets publication-title: Fundamenta Informaticae – reference: , Ottawa, Canada, 2003, pp. 3–14 – year: 1999 ident: bib049 article-title: Communicating and Mobile Systems: the – reference: , in: A. Voronkov, editor, – reference: (1999), pp. 55–69 – reference: Miller, D., – reference: Engberg, U. and G. Winskel, – reference: Benton, N., G. Bierman, V. de Paiva and M. Hyland, – reference: Valk, R., – reference: Cervesato, I., F. Pfenning, D. Walker and K. Watkins, – reference: (1993), manuscript – volume: 21 start-page: 666 year: 1978 end-page: 677 ident: bib029 article-title: Communicating sequential processes publication-title: Communications of the ACM – reference: , Technical Report CMU-CS-02-101, Computer Science Department., Carnegie Mellon University (2002) – reference: Zucker, J., Formalisation of classical mathematics in AUTOMATH, – reference: Cervesato, I., N. Durgin, P. Lincoln, J. Mitchell and A. Scedrov, – reference: (1993) 279–294 – reference: Petri, C. A., – reference: (1963), pp. 386–390 – reference: Watkins, K., I. Cervesato, F. Pfenning and D. Walker, – reference: , 1993, pp. 61–84 – start-page: 248 year: 1986 end-page: 299 ident: bib031 article-title: Coloured Petri nets publication-title: Advances in Petri Nets – volume: Nr. 2 year: 1962 ident: bib051 article-title: Kommunikation mit Automaten publication-title: Schriften des IIM – reference: , in: D. Kozen, editor, – volume: 1 start-page: 66 year: 1991 end-page: 101 ident: bib038 article-title: From Petri nets to linear logic publication-title: Mathematical Structures in Computer Science – reference: (1997) – reference: (1990), pp. 147–161 – reference: Kobayashi, N. and A. Yonezawa, – reference: , in: – volume: 135 start-page: 11 year: 1994 end-page: 65 ident: bib009 article-title: On the publication-title: Theoretical Computer Science – reference: Andreoli, J.-M., – volume: 6 start-page: 749 year: 2005 end-page: 783 ident: bib048 article-title: A proof theory for generic judgments publication-title: ACM Transactions on Computational Logic – reference: Cervesato, I., – reference: , Novosibirsk, Russia, 2003, pp. 177–190 – volume: 36 start-page: 98 year: 1993 end-page: 111 ident: bib007 article-title: Programming by multiset transformation publication-title: Communications of the ACM – reference: (2002), pp. 501–516 – start-page: 455 year: 2000 end-page: 494 ident: bib054 article-title: Pict: A programming language based on the pi-calculus publication-title: Proof, Language and Interaction: Essays in Honour of Robin Milner – reference: (2006) – reference: Lincoln, P. and V. Saraswat, – reference: (2001), pp. 159–177 – start-page: 118 year: 2003 end-page: 127 ident: bib047 article-title: A proof theory for generic judgments: An extended abstract publication-title: Proceedings of LICS 2003 – reference: Brown, C. and D. Gurr, – reference: , Technical report, Computer Science Department, University of Pisa (1987) – reference: , in: E. B editor, – reference: Le Métayer, D., – reference: (2000), pp. 167–180 – reference: , Bertinoro, Italy, 2005 – volume: 67 start-page: 183 year: 1994 end-page: 212 ident: bib033 article-title: Linear logic as a logic of computation publication-title: Annals of Pure and Applied Logic – ident: 10.1016/j.entcs.2006.05.043_bib044 – volume: 67 start-page: 183 year: 1994 ident: 10.1016/j.entcs.2006.05.043_bib032 article-title: Linear logic as a logic of computation publication-title: Annals of Pure and Applied Logic doi: 10.1016/0168-0072(94)90011-6 – ident: 10.1016/j.entcs.2006.05.043_bib025 doi: 10.1145/237721.237805 – ident: 10.1016/j.entcs.2006.05.043_bib040 doi: 10.21236/ADA463016 – ident: 10.1016/j.entcs.2006.05.043_bib059 doi: 10.21236/ADA418517 – ident: 10.1016/j.entcs.2006.05.043_bib006 – ident: 10.1016/j.entcs.2006.05.043_bib021 – start-page: 455 year: 2000 ident: 10.1016/j.entcs.2006.05.043_bib054 article-title: Pict: A programming language based on the pi-calculus – ident: 10.1016/j.entcs.2006.05.043_bib004 doi: 10.1007/3-540-45620-1_39 – ident: 10.1016/j.entcs.2006.05.043_bib010 doi: 10.1007/3-540-56992-8_6 – start-page: 248 year: 1986 ident: 10.1016/j.entcs.2006.05.043_bib031 article-title: Coloured Petri nets – ident: 10.1016/j.entcs.2006.05.043_bib034 – ident: 10.1016/j.entcs.2006.05.043_bib015 – volume: 36 start-page: 98 year: 1993 ident: 10.1016/j.entcs.2006.05.043_bib007 article-title: Programming by multiset transformation publication-title: Communications of the ACM doi: 10.1145/151233.151242 – volume: 67 start-page: 183 year: 1994 ident: 10.1016/j.entcs.2006.05.043_bib033 article-title: Linear logic as a logic of computation publication-title: Annals of Pure and Applied Logic doi: 10.1016/0168-0072(94)90011-6 – ident: 10.1016/j.entcs.2006.05.043_bib045 – volume: 135 start-page: 5 year: 1994 ident: 10.1016/j.entcs.2006.05.043_bib002 article-title: Proofs as processes publication-title: Theoretical Computer Science doi: 10.1016/0304-3975(94)00103-0 – volume: 6 start-page: 749 year: 2005 ident: 10.1016/j.entcs.2006.05.043_bib048 article-title: A proof theory for generic judgments publication-title: ACM Transactions on Computational Logic doi: 10.1145/1094622.1094628 – volume: 110 start-page: 327 year: 1994 ident: 10.1016/j.entcs.2006.05.043_bib030 article-title: Logic programming in a fragment of intuitionistic linear logic publication-title: Information and Computation doi: 10.1006/inco.1994.1036 – volume: 96 start-page: 73 year: 1992 ident: 10.1016/j.entcs.2006.05.043_bib041 article-title: Conditional rewriting logic as a unified model of concurrency publication-title: Theoretical Computer Science doi: 10.1016/0304-3975(92)90182-F – ident: 10.1016/j.entcs.2006.05.043_bib028 – ident: 10.1016/j.entcs.2006.05.043_bib024 – ident: 10.1016/j.entcs.2006.05.043_bib003 – volume: 294 start-page: 411 year: 2003 ident: 10.1016/j.entcs.2006.05.043_bib039 article-title: Encoding transition systems in sequent calculus publication-title: Theoretical Computer Science doi: 10.1016/S0304-3975(01)00168-2 – start-page: 118 year: 2003 ident: 10.1016/j.entcs.2006.05.043_bib047 article-title: A proof theory for generic judgments: An extended abstract – ident: 10.1016/j.entcs.2006.05.043_bib014 – ident: 10.1016/j.entcs.2006.05.043_bib052 – volume: Nr. 2 year: 1962 ident: 10.1016/j.entcs.2006.05.043_bib051 article-title: Kommunikation mit Automaten – ident: 10.1016/j.entcs.2006.05.043_bib050 doi: 10.1109/CSFW.1997.596788 – volume: 21 start-page: 666 year: 1978 ident: 10.1016/j.entcs.2006.05.043_bib029 article-title: Communicating sequential processes publication-title: Communications of the ACM doi: 10.1145/359576.359585 – ident: 10.1016/j.entcs.2006.05.043_bib018 doi: 10.21236/ADA418538 – year: 2001 ident: 10.1016/j.entcs.2006.05.043_bib055 – volume: 13 start-page: 3 year: 2005 ident: 10.1016/j.entcs.2006.05.043_bib011 article-title: Relating Multiset Rewriting and Process Algebras for Security Protocol Analysis publication-title: Journal of Computer Security doi: 10.3233/JCS-2005-13102 – volume: 138 start-page: 79 year: 2004 ident: 10.1016/j.entcs.2006.05.043_bib057 article-title: A proof search specification of the π-calculus publication-title: ENTCS – ident: 10.1016/j.entcs.2006.05.043_bib027 – ident: 10.1016/j.entcs.2006.05.043_bib035 doi: 10.1090/dimacs/018/13 – ident: 10.1016/j.entcs.2006.05.043_bib042 – ident: 10.1016/j.entcs.2006.05.043_bib008 – year: 2001 ident: 10.1016/j.entcs.2006.05.043_bib019 – volume: 51 start-page: 125 year: 1991 ident: 10.1016/j.entcs.2006.05.043_bib046 article-title: Uniform proofs as a foundation for logic programming publication-title: Annals of Pure and Applied Logic doi: 10.1016/0168-0072(91)90068-W – volume: 12 start-page: 247 year: 2004 ident: 10.1016/j.entcs.2006.05.043_bib020_1 article-title: Multiset rewriting and the complexity of bounded security protocols publication-title: Journal of Computer Security doi: 10.3233/JCS-2004-12203 – ident: 10.1016/j.entcs.2006.05.043_bib036 – start-page: 313 year: 1989 ident: 10.1016/j.entcs.2006.05.043_bib037 article-title: From Petri nets to linear logic – volume: 9 start-page: 445 year: 1991 ident: 10.1016/j.entcs.2006.05.043_bib005 article-title: Linear objects: Logical processes with built-in inheritance publication-title: Ne Generation Computing doi: 10.1007/BF03037173 – start-page: 371 year: 1989 ident: 10.1016/j.entcs.2006.05.043_bib056 article-title: Linear logic, ⋆-autonomous categories and cofree coalgebras – volume: 135 start-page: 11 year: 1994 ident: 10.1016/j.entcs.2006.05.043_bib009 article-title: On the π-calculus and linear logic publication-title: Theoretical Computer Science doi: 10.1016/0304-3975(94)00104-9 – volume: 165 start-page: 201 year: 1996 ident: 10.1016/j.entcs.2006.05.043_bib043 article-title: A multiple-conclusion specification logic publication-title: Theoretical Computer Science doi: 10.1016/0304-3975(96)00045-X – volume: 50 start-page: 1 year: 1987 ident: 10.1016/j.entcs.2006.05.043_bib026 article-title: Linear logic publication-title: Theoretical Computer Science doi: 10.1016/0304-3975(87)90045-4 – ident: 10.1016/j.entcs.2006.05.043_bib053 doi: 10.1109/LICS.1995.523253 – ident: 10.1016/j.entcs.2006.05.043_bib001 – ident: 10.1016/j.entcs.2006.05.043_bib017 doi: 10.1109/CSFW.1999.779762 – ident: 10.1016/j.entcs.2006.05.043_bib016 doi: 10.21236/ADA465155 – ident: 10.1016/j.entcs.2006.05.043_bib060 – ident: 10.1016/j.entcs.2006.05.043_bib022 – year: 1999 ident: 10.1016/j.entcs.2006.05.043_bib049 – volume: 37 start-page: 225 year: 1999 ident: 10.1016/j.entcs.2006.05.043_bib023 article-title: A linear logic view of object Petri nets publication-title: Fundamenta Informaticae doi: 10.3233/FI-1999-37303 – ident: 10.1016/j.entcs.2006.05.043_bib058 – ident: 10.1016/j.entcs.2006.05.043_bib013 doi: 10.1109/LICS.1990.113747 – ident: 10.1016/j.entcs.2006.05.043_bib012 doi: 10.7146/brics.v3i10.19973 – ident: 10.1016/j.entcs.2006.05.043_bib020_2 – volume: 1 start-page: 66 year: 1991 ident: 10.1016/j.entcs.2006.05.043_bib038 article-title: From Petri nets to linear logic publication-title: Mathematical Structures in Computer Science doi: 10.1017/S0960129500000062 |
| SSID | ssj0038176 |
| Score | 1.450691 |
| Snippet | This paper has the purpose of reviewing some of the established relationships between logic and concurrency, and of exploring new ones.
Concurrent and... |
| SourceID | crossref elsevier |
| SourceType | Enrichment Source Index Database Publisher |
| StartPage | 145 |
| SubjectTerms | Linear logic multiset rewriting process algebra |
| Title | Relating State-Based and Process-Based Concurrency through Linear Logic |
| URI | https://dx.doi.org/10.1016/j.entcs.2006.05.043 |
| Volume | 165 |
| WOSCitedRecordID | wos000214216400011&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D |
| hasFullText | 1 |
| inHoldings | 1 |
| isFullTextHit | |
| isPrint | |
| journalDatabaseRights | – providerCode: PRVESC databaseName: Elsevier SD Freedom Collection Journals 2021 customDbUrl: eissn: 1571-0661 dateEnd: 20201231 omitProxy: false ssIdentifier: ssj0038176 issn: 1571-0661 databaseCode: AIEXJ dateStart: 19950101 isFulltext: true titleUrlDefault: https://www.sciencedirect.com providerName: Elsevier – providerCode: PRVHPJ databaseName: ROAD: Directory of Open Access Scholarly Resources customDbUrl: eissn: 1571-0661 dateEnd: 20201231 omitProxy: false ssIdentifier: ssj0038176 issn: 1571-0661 databaseCode: M~E dateStart: 20040101 isFulltext: true titleUrlDefault: https://road.issn.org providerName: ISSN International Centre |
| link | http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwtV1Ja9wwFBYhzaGXLklL0w0dcks1jGxrO7YhXaAJgSYlNyNLMjQUO8xMQ3rpb-_T5vFkQmgLvZhBjEaD3ue36el7CO3xqVaNaTUR2klSsVIT3TSCiEo7YamjRWD7_PpZHB_L83N1klLZ89BOQHSdvL5Wl_9V1DAGwvZXZ_9C3MOPwgB8BqHDE8QOzz8SfCxvCzzb4EeSd2Cm7PhOQBo56DsTuJnMz6FZDwSmntfH9182Kyn7Za-crl-EEq6VG5AmtYbYT_Z0ONjw5ZRzHTo17X_yCZV-efDj7Ky_Gmoqb2QfKCXFMlZdvxYTtajw5VSRZX3ibhnLqpezkfKkkVgy2WEa-8KsqfiYbbiYgE0283SaxCbTSPZ0gzv7i1_VLzrloeAHbPW9QjDla_-Ofh1mk-1ZCsM1tPwfMz1VKARcW-h2F2bklpw-Qg9SPIHfRhw8Rhuu20YPc68OnFT3DvqQYYFHsMAAC7wCCzyCBU6wwBEWOMDiCTp7f3h68JGkJhrElJVcEAv-ulKtbOA1BFeVWqYshNjUsAbeXytLURmIYjVobu7DS6tLJpUtHG1ZAyaofIo2u75zzxA2SvLgomrZVA1vZesK6nyKo-Ql13IXFXlfapMY5n2jk-91LiW8qMNm-t6nvJ6yGjZzF70ZJl1GgpW7v87zhtcJ09H3qwEfd018_q8TX6D7S-C_RJuL2Q_3Cm2Zq8W3-ex1wNFvLNCL_w |
| linkProvider | ISSN International Centre |
| openUrl | ctx_ver=Z39.88-2004&ctx_enc=info%3Aofi%2Fenc%3AUTF-8&rfr_id=info%3Asid%2Fsummon.serialssolutions.com&rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Ajournal&rft.genre=article&rft.atitle=Relating+State-Based+and+Process-Based+Concurrency+through+Linear+Logic&rft.jtitle=Electronic+notes+in+theoretical+computer+science&rft.au=Cervesato%2C+Iliano&rft.au=Scedrov%2C+Andre&rft.date=2006-11-22&rft.pub=Elsevier+B.V&rft.issn=1571-0661&rft.eissn=1571-0661&rft.volume=165&rft.spage=145&rft.epage=176&rft_id=info:doi/10.1016%2Fj.entcs.2006.05.043&rft.externalDocID=S1571066106005202 |
| thumbnail_l | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/lc.gif&issn=1571-0661&client=summon |
| thumbnail_m | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/mc.gif&issn=1571-0661&client=summon |
| thumbnail_s | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/sc.gif&issn=1571-0661&client=summon |