A Symbolic Model for Timed Concurrent Constraint Programming
Concurrent Constraint Programming (ccp) is a model for concurrency where agents interact with each other by telling and asking constraints (i.e., formulas in logic) into a shared store of partial information. The ntcc calculus extends ccp with the notion of discrete time-units for the specification...
Gespeichert in:
| Veröffentlicht in: | Electronic notes in theoretical computer science Jg. 312; S. 161 - 177 |
|---|---|
| Hauptverfasser: | , , |
| Format: | Journal Article |
| Sprache: | Englisch |
| Veröffentlicht: |
Elsevier B.V
24.04.2015
|
| Schlagworte: | |
| ISSN: | 1571-0661, 1571-0661 |
| Online-Zugang: | Volltext |
| Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
| Abstract | Concurrent Constraint Programming (ccp) is a model for concurrency where agents interact with each other by telling and asking constraints (i.e., formulas in logic) into a shared store of partial information. The ntcc calculus extends ccp with the notion of discrete time-units for the specification of reactive systems. Moreover, ntcc features constructors for non-deterministic choices and asynchronous behavior, thus allowing for (1) synchronization of processes via constraint entailment during a time-unit and (2) synchronization of processes along time-intervals. In this paper we develop the techniques needed for the automatic verification of ntcc programs based on symbolic model checking. We show that the internal transition relation, modeling the behavior of processes during a time-unit (1 above), can be symbolically represented by formulas in a suitable fragment of linear time temporal logic. Moreover, by using standard techniques as difference decision diagrams, we provide a compact representation of these constraints. Then, relying on a fixpoint characterization of the timed constructs, we obtain a symbolic model of the observable transition (2 above). We prove that our construction is correct with respect to the operational semantics. Finally, we introduce a prototypical tool implementing our method. |
|---|---|
| AbstractList | Concurrent Constraint Programming (ccp) is a model for concurrency where agents interact with each other by telling and asking constraints (i.e., formulas in logic) into a shared store of partial information. The ntcc calculus extends ccp with the notion of discrete time-units for the specification of reactive systems. Moreover, ntcc features constructors for non-deterministic choices and asynchronous behavior, thus allowing for (1) synchronization of processes via constraint entailment during a time-unit and (2) synchronization of processes along time-intervals. In this paper we develop the techniques needed for the automatic verification of ntcc programs based on symbolic model checking. We show that the internal transition relation, modeling the behavior of processes during a time-unit (1 above), can be symbolically represented by formulas in a suitable fragment of linear time temporal logic. Moreover, by using standard techniques as difference decision diagrams, we provide a compact representation of these constraints. Then, relying on a fixpoint characterization of the timed constructs, we obtain a symbolic model of the observable transition (2 above). We prove that our construction is correct with respect to the operational semantics. Finally, we introduce a prototypical tool implementing our method. |
| Author | Arias, Jaime Olarte, Carlos Guzmán, Michell |
| Author_xml | – sequence: 1 givenname: Jaime surname: Arias fullname: Arias, Jaime email: ariasalmeida@gmail.com organization: Univ. Bordeaux, LaBRI, UMR 5800, F-33400 Talence, France – sequence: 2 givenname: Michell surname: Guzmán fullname: Guzmán, Michell email: michellrad@gmail.com organization: Comète, LIX, Laboratoire de l'Ecole Polytechnique associé à l'INRIA/CORDI-S, France – sequence: 3 givenname: Carlos surname: Olarte fullname: Olarte, Carlos email: carlos.olarte@gmail.com organization: ECT, Universidade Federal do Rio Grande do Norte, Natal, Brazil |
| BookMark | eNp9kM1KAzEURoNUsK0-gZt5gRlzJ5PMFHRRilahomBdh_zclJTORJJR6Ns7Y124cnXP5nxczoxMutAhIddAC6AgbvYFdr1JRUmBF7QqKNAzMgVeQ06FgMkfviCzlPaUsgZqMSW3y-zt2Opw8CZ7DhYPmQsx2_oWbbYKnfmMcZgeMfVR-QFfY9hF1ba-212Sc6cOCa9-75y8P9xvV4_55mX9tFpucsNY2ee8YkwpIUpwC2TCLZS1XPPGVUJj2Whem9ohONtwpnXT1HTBGGqo7IDUIJsTdto1MaQU0cmP6FsVjxKoHAPIvfwJIMcAklZyCDBYdycLh9e-PEaZjMfOoPURTS9t8P_63zfOZvs |
| Cites_doi | 10.1006/inco.2000.3002 10.1145/186025.186051 10.1023/A:1008615614281 10.1016/j.cosrev.2010.06.002 10.1016/j.tcs.2004.10.009 10.1007/s10601-013-9145-3 10.1109/TC.1986.1676819 10.1016/0890-5401(92)90017-A 10.1006/inco.1999.2879 10.1016/0022-0000(85)90001-7 10.1016/j.entcs.2008.03.072 |
| ContentType | Journal Article |
| Copyright | 2015 The Authors |
| Copyright_xml | – notice: 2015 The Authors |
| DBID | 6I. AAFTH AAYXX CITATION |
| DOI | 10.1016/j.entcs.2015.04.010 |
| DatabaseName | ScienceDirect Open Access Titles Elsevier:ScienceDirect:Open Access CrossRef |
| DatabaseTitle | CrossRef |
| DatabaseTitleList | |
| DeliveryMethod | fulltext_linktorsrc |
| Discipline | Computer Science |
| EISSN | 1571-0661 |
| EndPage | 177 |
| ExternalDocumentID | 10_1016_j_entcs_2015_04_010 S1571066115000146 |
| GroupedDBID | --M 0R~ 0SF 1B1 1~5 4.4 457 4G. 5GY 6I. 7-5 71M AABNK AACTN AAEDT AAEDW AAFTH AAIKJ AAKOC AALRI AAXUO ABMAC ACDAQ ACGFO ACGFS ACRLP ACXMD ADBBV ADEZE AEKER AEXQZ AFTJW AGHFR AIEXJ AIKHN AITUG ALMA_UNASSIGNED_HOLDINGS AMRAJ AXJTR CS3 DU5 EBS EJD EO8 EO9 EP2 EP3 FDB FEDTE FNPLU G-Q GBLVA HVGLF IHE IXB J1W KOM KQ8 M41 M~E N9A NCXOZ O-L O9- OK1 OZT P2P RIG ROL RPZ SDF SDG SES SPC SSV SSW SSZ --K 29G 5VS 9DU AAQFI AAQXK AAYWO AAYXX ABFNM ABWVN ACLOT ACNNM ACRPL ACVFH ADCNI ADFGL ADMUD ADNMO ADVLN AEIPS AEUPX AFPUW AGQPQ AIGII AJMQA AKBMS AKRWK AKYEP ANKPU AOUOD ASPBG AVWKF AZFZN CITATION FGOYB HZ~ R2- SEW ~HD |
| ID | FETCH-LOGICAL-c332t-5433aa6621f9e36f9add5b58f46be28b57c7fe1fd853bb8870933eb14d8700ce3 |
| ISICitedReferencesCount | 1 |
| ISICitedReferencesURI | http://www.webofscience.com/api/gateway?GWVersion=2&SrcApp=Summon&SrcAuth=ProQuest&DestLinkType=CitingArticles&DestApp=WOS_CPL&KeyUT=000357615500010&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:22:15 EST 2025 Fri Feb 23 02:31:18 EST 2024 |
| IsDoiOpenAccess | true |
| IsOpenAccess | true |
| IsPeerReviewed | false |
| IsScholarly | false |
| Keywords | Concurrent constraint programming temporal logic model checking |
| Language | English |
| License | http://creativecommons.org/licenses/by-nc-nd/4.0 https://www.elsevier.com/tdm/userlicense/1.0 |
| LinkModel | OpenURL |
| MergedId | FETCHMERGED-LOGICAL-c332t-5433aa6621f9e36f9add5b58f46be28b57c7fe1fd853bb8870933eb14d8700ce3 |
| OpenAccessLink | https://dx.doi.org/10.1016/j.entcs.2015.04.010 |
| PageCount | 17 |
| ParticipantIDs | crossref_primary_10_1016_j_entcs_2015_04_010 elsevier_sciencedirect_doi_10_1016_j_entcs_2015_04_010 |
| PublicationCentury | 2000 |
| PublicationDate | 2015-04-24 |
| PublicationDateYYYYMMDD | 2015-04-24 |
| PublicationDate_xml | – month: 04 year: 2015 text: 2015-04-24 day: 24 |
| PublicationDecade | 2010 |
| PublicationTitle | Electronic notes in theoretical computer science |
| PublicationYear | 2015 |
| Publisher | Elsevier B.V |
| Publisher_xml | – name: Elsevier B.V |
| References | Clarke, Grumberg, Long (br0060) 1994; 16 Fages, Ruet, Soliman (br0100) 2001; 165 Møller, Lichtenberg, Reif Andersen, Hulgaard (br0150) 1999; vol. 1683 Emerson, Halpern (br0090) 1985; 30 Gentzen (br0130) 1969 Manna, Pnueli (br0140) 1991 Saraswat, Rinard, Panangaden (br0210) 1991 Saraswat, Rinard (br0200) 1990 Burch, Clarke, McMillan, Dill, Hwang (br0040) 1992; 98 Falaschi, Villanueva (br0120) 2006; 6 Zaffanella, Giacobazzi, Levi (br0230) 1997; 1997 Valencia (br0220) 2005; 330 Alpuente, del Mar Gallardo, Pimentel, Villanueva (br0010) 2008; 206 Comini, Titolo, Villanueva (br0070) 2011; 11 Clarke, Grumberg, Hamaguchi (br0050) 1997; 10 Olarte, Rueda, Valencia (br0170) 2013; 18 Falaschi, Olarte, Palamidessi (br0110) 10 February 2014 Rozier (br0190) 2011; 5 de Boer, Gabbrielli, Chiara Meo (br0080) 2000; 161 Alpuente, Falaschi, Villanueva (br0020) 2004; vol. 3475 Olarte, Valencia (br0180) 2008 Bryant (br0030) 1986; 100 Nielsen, Palamidessi, Valencia (br0160) 2002; 9 Comini (10.1016/j.entcs.2015.04.010_br0070) 2011; 11 Olarte (10.1016/j.entcs.2015.04.010_br0180) 2008 Manna (10.1016/j.entcs.2015.04.010_br0140) 1991 Burch (10.1016/j.entcs.2015.04.010_br0040) 1992; 98 Rozier (10.1016/j.entcs.2015.04.010_br0190) 2011; 5 Alpuente (10.1016/j.entcs.2015.04.010_br0020) 2004; vol. 3475 Fages (10.1016/j.entcs.2015.04.010_br0100) 2001; 165 Falaschi (10.1016/j.entcs.2015.04.010_br0120) 2006; 6 Alpuente (10.1016/j.entcs.2015.04.010_br0010) 2008; 206 Valencia (10.1016/j.entcs.2015.04.010_br0220) 2005; 330 Møller (10.1016/j.entcs.2015.04.010_br0150) 1999; vol. 1683 Emerson (10.1016/j.entcs.2015.04.010_br0090) 1985; 30 Nielsen (10.1016/j.entcs.2015.04.010_br0160) 2002; 9 Saraswat (10.1016/j.entcs.2015.04.010_br0210) 1991 Clarke (10.1016/j.entcs.2015.04.010_br0060) 1994; 16 Saraswat (10.1016/j.entcs.2015.04.010_br0200) 1990 Falaschi (10.1016/j.entcs.2015.04.010_br0110) 2014 Olarte (10.1016/j.entcs.2015.04.010_br0170) 2013; 18 Bryant (10.1016/j.entcs.2015.04.010_br0030) 1986; 100 de Boer (10.1016/j.entcs.2015.04.010_br0080) 2000; 161 Gentzen (10.1016/j.entcs.2015.04.010_br0130) 1969 Clarke (10.1016/j.entcs.2015.04.010_br0050) 1997; 10 Zaffanella (10.1016/j.entcs.2015.04.010_br0230) 1997; 1997 |
| References_xml | – volume: 1997 year: 1997 ident: br0230 article-title: Abstracting synchronization in concurrent constraint programming publication-title: J. of Functional and Logic Programming – volume: 6 start-page: 265 year: 2006 end-page: 300 ident: br0120 article-title: Automatic verification of timed concurrent constraint programs publication-title: TPLP – volume: 16 start-page: 1512 year: 1994 end-page: 1542 ident: br0060 article-title: Model checking and abstraction publication-title: ACM Trans. Program. Lang. Syst. – volume: 165 start-page: 14 year: 2001 end-page: 41 ident: br0100 article-title: Linear concurrent constraint programming: Operational and phase semantics publication-title: Inf. Comput. – volume: vol. 1683 start-page: 111 year: 1999 end-page: 125 ident: br0150 article-title: Difference decision diagrams publication-title: CSL – volume: 5 start-page: 163 year: 2011 end-page: 203 ident: br0190 article-title: Linear temporal logic symbolic model checking publication-title: Computer Science Review – year: 1991 ident: br0140 article-title: The Temporal Logic of Reactive and Concurrent Systems: Specification – volume: 98 start-page: 142 year: 1992 end-page: 170 ident: br0040 article-title: Symbolic model checking: 1020 states and beyond publication-title: Inf. Comput. – volume: 30 start-page: 1 year: 1985 end-page: 24 ident: br0090 article-title: Decision procedures and expressiveness in the temporal logic of branching time publication-title: Journal of computer and system sciences – volume: 18 start-page: 535 year: 2013 end-page: 578 ident: br0170 article-title: Models and emerging trends of concurrent constraint programming publication-title: Constraints – start-page: 232 year: 1990 end-page: 245 ident: br0200 article-title: Concurrent constraint programming publication-title: POPL – volume: vol. 3475 start-page: 45 year: 2004 end-page: 56 ident: br0020 article-title: A symbolic model checker for tccp programs publication-title: RISE – volume: 9 start-page: 145 year: 2002 end-page: 188 ident: br0160 article-title: Temporal concurrent constraint programming: Denotation, logic and applications publication-title: Nord. J. Comput. – year: 10 February 2014 ident: br0110 article-title: Abstract interpretation of temporal concurrent constraint programs publication-title: TPLP – volume: 330 start-page: 577 year: 2005 end-page: 607 ident: br0220 article-title: Decidability of infinite-state timed ccp processes and first-order ltl publication-title: Theor. Comput. Sci. – volume: 206 start-page: 3 year: 2008 end-page: 21 ident: br0010 article-title: An abstract analysis framework for synchronous concurrent languages based on source-to-source transformation publication-title: Electr. Notes Theor. Comput. Sci. – volume: 100 start-page: 677 year: 1986 end-page: 691 ident: br0030 article-title: Graph-based algorithms for boolean function manipulation publication-title: IEEE Transactions on Computers – start-page: 68 year: 1969 end-page: 131 ident: br0130 article-title: Investigations into logical deductions publication-title: The Collected Papers of Gerhard Gentzen – volume: 11 start-page: 487 year: 2011 end-page: 502 ident: br0070 article-title: Abstract diagnosis for timed concurrent constraint programs publication-title: TPLP – volume: 161 start-page: 45 year: 2000 end-page: 83 ident: br0080 article-title: A timed concurrent constraint language publication-title: Inf. Comput. – start-page: 333 year: 1991 end-page: 352 ident: br0210 article-title: Semantic foundations of concurrent constraint programming publication-title: POPL – start-page: 145 year: 2008 end-page: 150 ident: br0180 article-title: Universal concurrent constraint programing: symbolic semantics and applications to security publication-title: SAC – volume: 10 start-page: 47 year: 1997 end-page: 71 ident: br0050 article-title: Another look at ltl model checking publication-title: Formal Methods in System Design – volume: 165 start-page: 14 issue: 1 year: 2001 ident: 10.1016/j.entcs.2015.04.010_br0100 article-title: Linear concurrent constraint programming: Operational and phase semantics publication-title: Inf. Comput. doi: 10.1006/inco.2000.3002 – volume: 6 start-page: 265 issue: 3 year: 2006 ident: 10.1016/j.entcs.2015.04.010_br0120 article-title: Automatic verification of timed concurrent constraint programs publication-title: TPLP – volume: 16 start-page: 1512 issue: 5 year: 1994 ident: 10.1016/j.entcs.2015.04.010_br0060 article-title: Model checking and abstraction publication-title: ACM Trans. Program. Lang. Syst. doi: 10.1145/186025.186051 – volume: 10 start-page: 47 issue: 1 year: 1997 ident: 10.1016/j.entcs.2015.04.010_br0050 article-title: Another look at ltl model checking publication-title: Formal Methods in System Design doi: 10.1023/A:1008615614281 – volume: 5 start-page: 163 issue: 2 year: 2011 ident: 10.1016/j.entcs.2015.04.010_br0190 article-title: Linear temporal logic symbolic model checking publication-title: Computer Science Review doi: 10.1016/j.cosrev.2010.06.002 – volume: 330 start-page: 577 issue: 3 year: 2005 ident: 10.1016/j.entcs.2015.04.010_br0220 article-title: Decidability of infinite-state timed ccp processes and first-order ltl publication-title: Theor. Comput. Sci. doi: 10.1016/j.tcs.2004.10.009 – year: 1991 ident: 10.1016/j.entcs.2015.04.010_br0140 – start-page: 145 year: 2008 ident: 10.1016/j.entcs.2015.04.010_br0180 article-title: Universal concurrent constraint programing: symbolic semantics and applications to security – volume: vol. 1683 start-page: 111 year: 1999 ident: 10.1016/j.entcs.2015.04.010_br0150 article-title: Difference decision diagrams – volume: 18 start-page: 535 issue: 4 year: 2013 ident: 10.1016/j.entcs.2015.04.010_br0170 article-title: Models and emerging trends of concurrent constraint programming publication-title: Constraints doi: 10.1007/s10601-013-9145-3 – volume: 1997 issue: 6 year: 1997 ident: 10.1016/j.entcs.2015.04.010_br0230 article-title: Abstracting synchronization in concurrent constraint programming publication-title: J. of Functional and Logic Programming – volume: 9 start-page: 145 issue: 1 year: 2002 ident: 10.1016/j.entcs.2015.04.010_br0160 article-title: Temporal concurrent constraint programming: Denotation, logic and applications publication-title: Nord. J. Comput. – volume: 100 start-page: 677 issue: 8 year: 1986 ident: 10.1016/j.entcs.2015.04.010_br0030 article-title: Graph-based algorithms for boolean function manipulation publication-title: IEEE Transactions on Computers doi: 10.1109/TC.1986.1676819 – start-page: 232 year: 1990 ident: 10.1016/j.entcs.2015.04.010_br0200 article-title: Concurrent constraint programming – start-page: 333 year: 1991 ident: 10.1016/j.entcs.2015.04.010_br0210 article-title: Semantic foundations of concurrent constraint programming – volume: vol. 3475 start-page: 45 year: 2004 ident: 10.1016/j.entcs.2015.04.010_br0020 article-title: A symbolic model checker for tccp programs – year: 2014 ident: 10.1016/j.entcs.2015.04.010_br0110 article-title: Abstract interpretation of temporal concurrent constraint programs publication-title: TPLP – volume: 98 start-page: 142 issue: 2 year: 1992 ident: 10.1016/j.entcs.2015.04.010_br0040 article-title: Symbolic model checking: 1020 states and beyond publication-title: Inf. Comput. doi: 10.1016/0890-5401(92)90017-A – start-page: 68 year: 1969 ident: 10.1016/j.entcs.2015.04.010_br0130 article-title: Investigations into logical deductions – volume: 161 start-page: 45 issue: 1 year: 2000 ident: 10.1016/j.entcs.2015.04.010_br0080 article-title: A timed concurrent constraint language publication-title: Inf. Comput. doi: 10.1006/inco.1999.2879 – volume: 30 start-page: 1 issue: 1 year: 1985 ident: 10.1016/j.entcs.2015.04.010_br0090 article-title: Decision procedures and expressiveness in the temporal logic of branching time publication-title: Journal of computer and system sciences doi: 10.1016/0022-0000(85)90001-7 – volume: 206 start-page: 3 year: 2008 ident: 10.1016/j.entcs.2015.04.010_br0010 article-title: An abstract analysis framework for synchronous concurrent languages based on source-to-source transformation publication-title: Electr. Notes Theor. Comput. Sci. doi: 10.1016/j.entcs.2008.03.072 – volume: 11 start-page: 487 issue: 4–5 year: 2011 ident: 10.1016/j.entcs.2015.04.010_br0070 article-title: Abstract diagnosis for timed concurrent constraint programs publication-title: TPLP |
| SSID | ssj0038176 |
| Score | 1.6537402 |
| Snippet | Concurrent Constraint Programming (ccp) is a model for concurrency where agents interact with each other by telling and asking constraints (i.e., formulas in... |
| SourceID | crossref elsevier |
| SourceType | Index Database Publisher |
| StartPage | 161 |
| SubjectTerms | Concurrent constraint programming model checking temporal logic |
| Title | A Symbolic Model for Timed Concurrent Constraint Programming |
| URI | https://dx.doi.org/10.1016/j.entcs.2015.04.010 |
| Volume | 312 |
| WOSCitedRecordID | wos000357615500010&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/eLvHCXMwtV3PT9swFLaqbgcu-wWIsg35sBsEkdiOE4lLNXXswNikAeIWxY4jtWrTqqRVtwPS_vM9_0paQGgcdolSS3Ebvy_vvTrf9x5Cn6JSFpBWsKCkLAloSHmQK8KDVOYRZ_A8EdOm8_qcX1wkNzfpj07nj9fCLMe8qpLVKp39V1PDGBhbS2efYe5mUhiAczA6HMHscPwnw_cPf_6aCF3u1zQ6M_pEo_QotLxPunpMulGnaQ9Ra62ApmhNfBDz-_Rtg5xqWhve1obsUbp-EIcuiLbQGTqRWD6cNKNni98T81I-bNj6atywO76PNbXUEVDG0429iJDp1ypWAu3dJ9c8Klte_Vg9MuZ8LnHcaes1Q3-B_WT7ujzw7XabYXQMiyR1ofWQmSK1jhW7UUn7XoRreIee0jbKzCSZniQ7oZkR6b0AcKbaMX67G_hgrusXGoGavwlfuMpQBB_8kseTm7WE5fINeuX-aeC-Rchb1FHVO_Tad_HAzqlvo9M-9oDBBjAYAIMNYHALGNwCBq8BZgddfRlcfv4auJ4agSQkqgNGCcnzOI7CMlUkLlOIb0ywpKSxUFEiGJe8VGFZQBonBEQgveMF8ZwWcHoiFdlF3WpaqT2EWUlyWQjFVK5oHieJELGMISXkaSKojHroyC9GNrOlU7InDNBDsV-wzAHXZnUZAOCpC_ef9z3v0VYL3Q-oW88X6iN6KZf18HZ-YKz_F98RfBQ |
| 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=A+Symbolic+Model+for+Timed+Concurrent+Constraint+Programming&rft.jtitle=Electronic+notes+in+theoretical+computer+science&rft.au=Arias%2C+Jaime&rft.au=Guzm%C3%A1n%2C+Michell&rft.au=Olarte%2C+Carlos&rft.date=2015-04-24&rft.issn=1571-0661&rft.eissn=1571-0661&rft.volume=312&rft.spage=161&rft.epage=177&rft_id=info:doi/10.1016%2Fj.entcs.2015.04.010&rft.externalDBID=n%2Fa&rft.externalDocID=10_1016_j_entcs_2015_04_010 |
| 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 |