A compositional view of derivations as interactive processes with applications to regulated and distributed rewriting
The derivation process in rewriting systems, especially in Chomskyan grammars, can be seen as consisting of four stages: (1) selection of the production to apply from a supply of productions available at that step, (2) check of applicability of the production, possibly on different matches, (3) sele...
Saved in:
| Published in | Theoretical computer science Vol. 862; pp. 59 - 80 |
|---|---|
| Main Authors | , |
| Format | Journal Article |
| Language | English |
| Published |
Elsevier B.V
16.03.2021
|
| Subjects | |
| Online Access | Get full text |
| ISSN | 0304-3975 1879-2294 |
| DOI | 10.1016/j.tcs.2020.10.035 |
Cover
| Abstract | The derivation process in rewriting systems, especially in Chomskyan grammars, can be seen as consisting of four stages: (1) selection of the production to apply from a supply of productions available at that step, (2) check of applicability of the production, possibly on different matches, (3) selection of the match at which to apply the production, (4) actual application. In this paper, we explore the different ways in which models of regulated and distributed rewriting have extended these four basic mechanisms and we propose a unifying perspective on them in terms of interaction between two agents, expressed through a particular form of conditional rewriting systems. This introduces a compositional view of derivation processes, where different components, playing specific roles and exhibiting specific behaviours, can be made to communicate and combined into different models of derivation. Existing models of regulated and distributed rewriting can thus be reformulated in this new framework, and new ones can be obtained. |
|---|---|
| AbstractList | The derivation process in rewriting systems, especially in Chomskyan grammars, can be seen as consisting of four stages: (1) selection of the production to apply from a supply of productions available at that step, (2) check of applicability of the production, possibly on different matches, (3) selection of the match at which to apply the production, (4) actual application. In this paper, we explore the different ways in which models of regulated and distributed rewriting have extended these four basic mechanisms and we propose a unifying perspective on them in terms of interaction between two agents, expressed through a particular form of conditional rewriting systems. This introduces a compositional view of derivation processes, where different components, playing specific roles and exhibiting specific behaviours, can be made to communicate and combined into different models of derivation. Existing models of regulated and distributed rewriting can thus be reformulated in this new framework, and new ones can be obtained. |
| Author | Labella, Anna Bottoni, Paolo |
| Author_xml | – sequence: 1 givenname: Paolo surname: Bottoni fullname: Bottoni, Paolo email: bottoni@di.uniroma1.it – sequence: 2 givenname: Anna surname: Labella fullname: Labella, Anna |
| BookMark | eNp9kMtqwzAQRUVJoUnaD-hOP2BXTz_oKoS-INBNuxZ6jFOFxDKSktC_r02y7myGe5k7M5wFmvWhB4QeKSkpodXTrsw2lYywSZeEyxs0p03dFoy1YobmhBNR8LaWd2iR0o6MJetqjo4rbMNhCMlnH3q9xycPZxw67CD6k57MhHXCvs8Qtc3-BHiIwUJKkPDZ5x-sh2Hv7XU0Bxxhe9zrDA7r3mHnU47eHCcd4RzHO_32Ht12ep_g4dqX6Pv15Wv9Xmw-3z7Wq01hmWhzwYUQklUGLOi6k7JpmDHWmUZyQxsOQkJVac7bytrOUKM7VjvZyqoVhLdA-RLRy14bQ0oROjVEf9DxV1GiJm5qp0ZuauI2WSO3MfN8ycD42EgjqmQ99Bacj2CzcsH_k_4D-SF7Tw |
| Cites_doi | 10.1016/S0304-3975(96)00330-1 10.1145/2455.2460 10.1017/S0960129517000019 10.1109/TIT.1956.1056813 10.1016/j.tcs.2014.02.048 10.1016/0304-3975(92)90182-F |
| ContentType | Journal Article |
| Copyright | 2020 Elsevier B.V. |
| Copyright_xml | – notice: 2020 Elsevier B.V. |
| DBID | AAYXX CITATION |
| DOI | 10.1016/j.tcs.2020.10.035 |
| DatabaseName | CrossRef |
| DatabaseTitle | CrossRef |
| DatabaseTitleList | |
| DeliveryMethod | fulltext_linktorsrc |
| Discipline | Mathematics Computer Science |
| EISSN | 1879-2294 |
| EndPage | 80 |
| ExternalDocumentID | 10_1016_j_tcs_2020_10_035 S0304397520306241 |
| GroupedDBID | --K --M -~X .DC .~1 0R~ 123 1B1 1RT 1~. 1~5 4.4 457 4G. 5VS 7-5 71M 8P~ 9JN AABNK AACTN AAEDW AAFTH AAIAV AAIKJ AAKOC AALRI AAOAW AAQFI AAXUO AAYFN ABAOU ABBOA ABJNI ABMAC ABYKQ ACAZW ACDAQ ACGFS ACRLP ACZNC ADBBV ADEZE AEBSH AEKER AENEX AFKWA AFTJW AGUBO AGYEJ AHHHB AHZHX AIALX AIEXJ AIKHN AITUG AJOXV ALMA_UNASSIGNED_HOLDINGS AMFUW AMRAJ AOUOD ARUGR AXJTR BKOJK BLXMC CS3 DU5 EBS EFJIC EFLBG EO8 EO9 EP2 EP3 F5P FDB FEDTE FIRID FNPLU FYGXN G-Q GBLVA GBOLZ HVGLF IHE IXB J1W KOM LG9 M26 M41 MHUIS MO0 N9A O-L O9- OAUVE OK1 OZT P-8 P-9 P2P PC. Q38 ROL RPZ SCC SDF SDG SES SPC SPCBC SSV SSW T5K TN5 WH7 YNT ZMT ~G- 29Q AAEDT AAQXK AATTM AAXKI AAYWO AAYXX ABDPE ABEFU ABFNM ABWVN ABXDB ACNNM ACRPL ACVFH ADCNI ADMUD ADNMO ADVLN AEIPS AEUPX AEXQZ AFJKZ AFPUW AFXIZ AGCQF AGHFR AGQPQ AGRNS AIGII AIIUN AKBMS AKRWK AKYEP ANKPU APXCP ASPBG AVWKF AZFZN BNPGV CITATION EJD FGOYB G-2 HZ~ R2- RIG SEW SSH SSZ TAE WUQ XJT ZY4 |
| ID | FETCH-LOGICAL-c249t-3444526becea7f55882bbcdb853b183e45e66a3396ccfb1baf27d595694039e13 |
| IEDL.DBID | AIKHN |
| ISSN | 0304-3975 |
| IngestDate | Tue Jul 01 05:15:43 EDT 2025 Fri Feb 23 02:46:23 EST 2024 |
| IsPeerReviewed | true |
| IsScholarly | true |
| Keywords | Grammar systems Interaction processes Non-determinism Regulated rewriting |
| Language | English |
| LinkModel | DirectLink |
| MergedId | FETCHMERGED-LOGICAL-c249t-3444526becea7f55882bbcdb853b183e45e66a3396ccfb1baf27d595694039e13 |
| PageCount | 22 |
| ParticipantIDs | crossref_primary_10_1016_j_tcs_2020_10_035 elsevier_sciencedirect_doi_10_1016_j_tcs_2020_10_035 |
| ProviderPackageCode | CITATION AAYXX |
| PublicationCentury | 2000 |
| PublicationDate | 2021-03-16 |
| PublicationDateYYYYMMDD | 2021-03-16 |
| PublicationDate_xml | – month: 03 year: 2021 text: 2021-03-16 day: 16 |
| PublicationDecade | 2020 |
| PublicationTitle | Theoretical computer science |
| PublicationYear | 2021 |
| Publisher | Elsevier B.V |
| Publisher_xml | – name: Elsevier B.V |
| References | Chomsky (br0030) 1956; 2 Meseguer (br0170) 1992; 96 Cojocaru, Mäkinen (br0050) 2014; 537 Hennessy, Milner (br0120) 1985; 32 Bauer, Boneva, Kurbán, Rensink (br0010) 2008; vol. 5214 Hopcroft, Ullman (br0140) 1979 Dassow, Păun (br0070) 1989 Kari, Lutfiyya, Martín-Vide, Păun (br0150) 1999; vol. 8 Hoare (br0130) 1985 Cojocaru, Mäkinen (br0040) 2011; vol. 6916 Dassow, Mitrana (br0060) 1997; 180 Freund (br0110) 2019; vol. 11612 Dassow, Păun, Salomaa (br0090) 1997 Kreowski, Kuske, Rozenberg (br0160) 2008; vol. 5065 Dassow, Păun, Rozenberg (br0080) 1997 Salomaa (br0190) 1987 Bottoni, Gorla, Kasangian, Labella (br0020) 2018; 28 Milner (br0180) 1989 Ehrig, Ehrig, Prange, Taentzer (br0100) 2006 Milner (10.1016/j.tcs.2020.10.035_br0180) 1989 Dassow (10.1016/j.tcs.2020.10.035_br0080) 1997 Dassow (10.1016/j.tcs.2020.10.035_br0090) 1997 Hoare (10.1016/j.tcs.2020.10.035_br0130) 1985 Cojocaru (10.1016/j.tcs.2020.10.035_br0050) 2014; 537 Hennessy (10.1016/j.tcs.2020.10.035_br0120) 1985; 32 Ehrig (10.1016/j.tcs.2020.10.035_br0100) 2006 Meseguer (10.1016/j.tcs.2020.10.035_br0170) 1992; 96 Cojocaru (10.1016/j.tcs.2020.10.035_br0040) 2011; vol. 6916 Dassow (10.1016/j.tcs.2020.10.035_br0070) 1989 Hopcroft (10.1016/j.tcs.2020.10.035_br0140) 1979 Kari (10.1016/j.tcs.2020.10.035_br0150) 1999; vol. 8 Bottoni (10.1016/j.tcs.2020.10.035_br0020) 2018; 28 Salomaa (10.1016/j.tcs.2020.10.035_br0190) 1987 Bauer (10.1016/j.tcs.2020.10.035_br0010) 2008; vol. 5214 Chomsky (10.1016/j.tcs.2020.10.035_br0030) 1956; 2 Freund (10.1016/j.tcs.2020.10.035_br0110) 2019; vol. 11612 Dassow (10.1016/j.tcs.2020.10.035_br0060) 1997; 180 Kreowski (10.1016/j.tcs.2020.10.035_br0160) 2008; vol. 5065 |
| References_xml | – volume: 2 start-page: 113 year: 1956 end-page: 124 ident: br0030 article-title: Three models for the description of language publication-title: IRE Trans. Inf. Theory – year: 2006 ident: br0100 article-title: Fundamentals of Algebraic Graph Transformation publication-title: Monographs in Theoretical Computer Science. An EATCS Series – volume: 180 start-page: 353 year: 1997 end-page: 361 ident: br0060 article-title: Cooperation in context-free grammars publication-title: Theor. Comput. Sci. – volume: vol. 5214 start-page: 321 year: 2008 end-page: 335 ident: br0010 article-title: A modal-logic based graph abstraction publication-title: Graph Transformations, Proceedings of the 4th International Conference – year: 1985 ident: br0130 article-title: Communicating Sequential Processes – start-page: 155 year: 1997 end-page: 213 ident: br0080 article-title: Grammar systems publication-title: Handbook of Formal Languages, vol. 2. Linear Modelling: Background and Application – year: 1989 ident: br0070 article-title: Regulated Rewriting in Formal Language Theory – volume: 32 start-page: 137 year: 1985 end-page: 161 ident: br0120 article-title: Algebraic laws for nondeterminism and concurrency publication-title: J. ACM – year: 1987 ident: br0190 article-title: Formal Languages publication-title: Computer Science Classics – start-page: 101 year: 1997 end-page: 154 ident: br0090 article-title: Grammars with controlled derivations publication-title: Handbook of Formal Languages, Volume 2. Linear Modelling: Background and Application – volume: vol. 8 start-page: 64 year: 1999 end-page: 85 ident: br0150 article-title: Bringing PC grammar systems closer to Hoare's CSPs publication-title: Grammatical Models of Multi-Agent Systems – year: 1989 ident: br0180 article-title: Communication and Concurrency publication-title: PHI Series in Computer Science – volume: 28 start-page: 508 year: 2018 end-page: 532 ident: br0020 article-title: A doctrinal approach to modal/temporal Heyting logic and non-determinism in processes publication-title: Math. Struct. Comput. Sci. – volume: 96 start-page: 73 year: 1992 end-page: 155 ident: br0170 article-title: Conditional rewriting logic as a unified model of concurrency publication-title: Theor. Comput. Sci. – year: 1979 ident: br0140 article-title: Introduction to Automata Theory, Languages and Computation – volume: vol. 5065 start-page: 57 year: 2008 end-page: 75 ident: br0160 article-title: Graph transformation units – an overview publication-title: Concurrency, Graphs and Models, Essays Dedicated to Ugo Montanari on the Occasion of His 65th Birthday – volume: vol. 6916 start-page: 77 year: 2011 end-page: 94 ident: br0040 article-title: On the complexity of Szilard languages of regulated grammars publication-title: Proc. ICTAC 2011 – volume: 537 start-page: 87 year: 2014 end-page: 96 ident: br0050 article-title: On some derivation mechanisms and the complexity of their Szilard languages publication-title: Theor. Comput. Sci. – volume: vol. 11612 start-page: 1 year: 2019 end-page: 34 ident: br0110 article-title: A general framework for sequential grammars with control mechanisms publication-title: Proc. DCFS 2019 – year: 1989 ident: 10.1016/j.tcs.2020.10.035_br0070 – year: 1987 ident: 10.1016/j.tcs.2020.10.035_br0190 article-title: Formal Languages – year: 2006 ident: 10.1016/j.tcs.2020.10.035_br0100 article-title: Fundamentals of Algebraic Graph Transformation – volume: vol. 11612 start-page: 1 year: 2019 ident: 10.1016/j.tcs.2020.10.035_br0110 article-title: A general framework for sequential grammars with control mechanisms – year: 1979 ident: 10.1016/j.tcs.2020.10.035_br0140 – volume: vol. 8 start-page: 64 year: 1999 ident: 10.1016/j.tcs.2020.10.035_br0150 article-title: Bringing PC grammar systems closer to Hoare's CSPs – start-page: 101 year: 1997 ident: 10.1016/j.tcs.2020.10.035_br0090 article-title: Grammars with controlled derivations – volume: 180 start-page: 353 issue: 1–2 year: 1997 ident: 10.1016/j.tcs.2020.10.035_br0060 article-title: Cooperation in context-free grammars publication-title: Theor. Comput. Sci. doi: 10.1016/S0304-3975(96)00330-1 – volume: 32 start-page: 137 issue: 1 year: 1985 ident: 10.1016/j.tcs.2020.10.035_br0120 article-title: Algebraic laws for nondeterminism and concurrency publication-title: J. ACM doi: 10.1145/2455.2460 – volume: 28 start-page: 508 issue: 4 year: 2018 ident: 10.1016/j.tcs.2020.10.035_br0020 article-title: A doctrinal approach to modal/temporal Heyting logic and non-determinism in processes publication-title: Math. Struct. Comput. Sci. doi: 10.1017/S0960129517000019 – volume: 2 start-page: 113 issue: 3 year: 1956 ident: 10.1016/j.tcs.2020.10.035_br0030 article-title: Three models for the description of language publication-title: IRE Trans. Inf. Theory doi: 10.1109/TIT.1956.1056813 – year: 1985 ident: 10.1016/j.tcs.2020.10.035_br0130 – start-page: 155 year: 1997 ident: 10.1016/j.tcs.2020.10.035_br0080 article-title: Grammar systems – year: 1989 ident: 10.1016/j.tcs.2020.10.035_br0180 article-title: Communication and Concurrency – volume: 537 start-page: 87 year: 2014 ident: 10.1016/j.tcs.2020.10.035_br0050 article-title: On some derivation mechanisms and the complexity of their Szilard languages publication-title: Theor. Comput. Sci. doi: 10.1016/j.tcs.2014.02.048 – volume: vol. 5214 start-page: 321 year: 2008 ident: 10.1016/j.tcs.2020.10.035_br0010 article-title: A modal-logic based graph abstraction – volume: vol. 5065 start-page: 57 year: 2008 ident: 10.1016/j.tcs.2020.10.035_br0160 article-title: Graph transformation units – an overview – volume: 96 start-page: 73 issue: 1 year: 1992 ident: 10.1016/j.tcs.2020.10.035_br0170 article-title: Conditional rewriting logic as a unified model of concurrency publication-title: Theor. Comput. Sci. doi: 10.1016/0304-3975(92)90182-F – volume: vol. 6916 start-page: 77 year: 2011 ident: 10.1016/j.tcs.2020.10.035_br0040 article-title: On the complexity of Szilard languages of regulated grammars |
| SSID | ssj0000576 |
| Score | 2.308021 |
| Snippet | The derivation process in rewriting systems, especially in Chomskyan grammars, can be seen as consisting of four stages: (1) selection of the production to... |
| SourceID | crossref elsevier |
| SourceType | Index Database Publisher |
| StartPage | 59 |
| SubjectTerms | Grammar systems Interaction processes Non-determinism Regulated rewriting |
| Title | A compositional view of derivations as interactive processes with applications to regulated and distributed rewriting |
| URI | https://dx.doi.org/10.1016/j.tcs.2020.10.035 |
| Volume | 862 |
| hasFullText | 1 |
| inHoldings | 1 |
| isFullTextHit | |
| isPrint | |
| link | http://utb.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwnV07T8MwED6VdoGBRwFRHpUHJqS0TWwnzVgqqhbULlCpW2QnDoIhrZoUNn47d3lAkWBhtKWTrDvfw77v7gCunVihG3QdUqTQEqYv0A5yZXEjbW0EFyqk4uTpzB3Pxf1CLmowrGphCFZZ2v7CpufWutzpltzsrl5euo-U1ENvKh0Kex0qXm843HdlHRqDycN49m2QpVekLCkJgARVcjOHeWUhNe12aN3p5UPffnFPWy5ndAj7ZazIBsVxjqBmkiYcVHMYWKmWTdibfvVeTY9hM2CEEy_BWEhPn_9sGbMIL1vxAZsylTJqFJGXSL0ZtirKBUzK6F-WbWe1WbZk62JgvYmYSiIWUa9dGpOF67V5p65IyfMJzEd3T8OxVQ5XsEJ8cWUWF4Kmi6MIjfJiKTHS1jqMNLpvjWpuhDSuqzgyNAxjbWsVO14k8TXlix73jc1PoZ4sE3MGTGNQwWODsqV4wO37oce5VtLmfWmUsltwU_E0WBU9NIIKXPYaoAACEgBtoQBaICquBz8uQoA2_m-y8_-RXcCuQyAVAui5l1DP1htzhVFGptuw0_mw2-VdwtVkcfsJeBPUcQ |
| linkProvider | Elsevier |
| linkToHtml | http://utb.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwnV07T8MwELYqGICBRwFRnh6YkEKb-JFmLBVVC20XWqlbZDsOKkNaNSn8fe7ygCLBwmgrliLf-e6z77s7Qm69WIEblB4eJONw2-ZgB5lymBWutpxxZTA5eTSW_Sl_molZjXSrXBikVZa2v7DpubUuZ5rlbjaX83nzBYN64E2Fh7DXw-T1bUADEgvoD2YP3-ZY-EXAEkMA8HkV2sxJXpnBkt0eju9becu3X5zThsPpHZL9EinSTvEzR6Rmkzo5qLow0PJQ1sne6KvyanpM1h2KLPGSigXr8emfLmIagaoVz68pVSnFMhF5gtS7pcsiWcCmFF9l6WZMm2YLuira1duIqiSiEVbaxSZZMF7ZD6yJlLyekGnvcdLtO2VrBcfAfStzGOfYWxwEaJUfCwE4W2sTaXDeGg655cJKqRgLpDGxdrWKPT8ScJcKeIsF1mWnZCtZJPaMUA2QgsUWJItoQLYD4zOmlXBZW1il3Aa5q_Y0XBYVNMKKWvYWggBCFABOgQAahFe7Hv5QgxAs_N_Lzv-37Ibs9CejYTgcjJ8vyK6HdBWk6slLspWt1vYK8Eamr3N9-gRagNRF |
| 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=A+compositional+view+of+derivations+as+interactive+processes+with+applications+to+regulated+and+distributed+rewriting&rft.jtitle=Theoretical+computer+science&rft.au=Bottoni%2C+Paolo&rft.au=Labella%2C+Anna&rft.date=2021-03-16&rft.pub=Elsevier+B.V&rft.issn=0304-3975&rft.eissn=1879-2294&rft.volume=862&rft.spage=59&rft.epage=80&rft_id=info:doi/10.1016%2Fj.tcs.2020.10.035&rft.externalDocID=S0304397520306241 |
| thumbnail_l | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/lc.gif&issn=0304-3975&client=summon |
| thumbnail_m | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/mc.gif&issn=0304-3975&client=summon |
| thumbnail_s | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/sc.gif&issn=0304-3975&client=summon |