Modeling Concurrent systems specified in a Temporal Concurrent Constraint language-I
In this paper we present an approach to model concurrent systems specified in a temporal concurrent constraint language. Our goal is to construct a framework in which it is possible to apply the Model Checking technique to programs specified in such language. This work is the first step to the frame...
Gespeichert in:
| Veröffentlicht in: | Electronic notes in theoretical computer science Jg. 48; S. 197 - 210 |
|---|---|
| Hauptverfasser: | , , |
| Format: | Journal Article |
| Sprache: | Englisch |
| Veröffentlicht: |
Elsevier B.V
01.06.2001
|
| Schlagworte: | |
| ISSN: | 1571-0661, 1571-0661 |
| Online-Zugang: | Volltext |
| Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
| Abstract | In this paper we present an approach to model concurrent systems specified in a temporal concurrent constraint language. Our goal is to construct a framework in which it is possible to apply the Model Checking technique to programs specified in such language.
This work is the first step to the framework construction. We present a formalism to transform a specification into a tcc Structure. This structure is a graph representation of the program behavior.
Our basic tool is the Timed Concurrent Constraint Programming (tcc) framework defined by Saraswat et al. to describe reactive systems. With this language we take advantage of both the natural properties of the declarative paradigm and of the fact that the notion of time is built into the semantics of the programming language. In fact, on this ground it becomes reasonable to introduce the idea of applying the technique of Model Checking to a finite time interval (introduced by the user). With this restriction we naturally force the space representing the behavior of the program to be finite and hence Model Checking algorithms to be applicable. The graph construction is a completely automatic process that takes as input the tcc specification. |
|---|---|
| AbstractList | In this paper we present an approach to model concurrent systems specified in a temporal concurrent constraint language. Our goal is to construct a framework in which it is possible to apply the Model Checking technique to programs specified in such language.
This work is the first step to the framework construction. We present a formalism to transform a specification into a tcc Structure. This structure is a graph representation of the program behavior.
Our basic tool is the Timed Concurrent Constraint Programming (tcc) framework defined by Saraswat et al. to describe reactive systems. With this language we take advantage of both the natural properties of the declarative paradigm and of the fact that the notion of time is built into the semantics of the programming language. In fact, on this ground it becomes reasonable to introduce the idea of applying the technique of Model Checking to a finite time interval (introduced by the user). With this restriction we naturally force the space representing the behavior of the program to be finite and hence Model Checking algorithms to be applicable. The graph construction is a completely automatic process that takes as input the tcc specification. |
| Author | Policriti, Alberto Villanueva, Alicia Falaschi, Moreno |
| Author_xml | – sequence: 1 givenname: Moreno surname: Falaschi fullname: Falaschi, Moreno email: falaschi@dimi.uniud.it – sequence: 2 givenname: Alberto surname: Policriti fullname: Policriti, Alberto email: policrit@dimi.uniud.it – sequence: 3 givenname: Alicia surname: Villanueva fullname: Villanueva, Alicia email: alicia@dimi.uniud.it |
| BookMark | eNqFUMtKAzEUDVLBtvoJwix1MXozybxwIVJ8FCounH1IMzclMk1KMhX692ZakeKmq3vu4xzuORMyss4iIdcU7ijQ4v6T5iVNoSjoDfBbgNim_IyM_8ajI3xBJiF8AbCKlsWYNO-uxc7YVTJzVm29R9snYRd6XIckbFAZbbBNjE1k0uB647zsjk8jDL2XJsJO2tVWrjCdX5JzLbuAV791SpqX52b2li4-Xuezp0WqspLylFXI81rHpyrI9FJnJWOoFGO8wFzyuq10wXSusyXUEM9kFndM02rJa9SKTUl-kFXeheBRi403a-l3goIYkhH7ZMRgWwAX-2QEj7yHfzxletkbZwcn3Un244GN0dm3QS-CMmgVtsaj6kXrzAmFH7i7f-M |
| CitedBy_id | crossref_primary_10_1016_j_tcs_2004_10_009 crossref_primary_10_1016_j_tcs_2005_08_009 crossref_primary_10_1017_S1471068414000349 |
| Cites_doi | 10.1109/LICS.1994.316085 10.1007/978-3-642-61455-2_16 10.1007/BFb0031995 10.1007/978-3-642-85983-0_15 10.1145/5397.5399 |
| ContentType | Journal Article |
| Copyright | 2001 |
| Copyright_xml | – notice: 2001 |
| DBID | 6I. AAFTH AAYXX CITATION |
| DOI | 10.1016/S1571-0661(04)00157-4 |
| DatabaseName | ScienceDirect Open Access Titles Elsevier:ScienceDirect:Open Access CrossRef |
| DatabaseTitle | CrossRef |
| DatabaseTitleList | |
| DeliveryMethod | fulltext_linktorsrc |
| Discipline | Computer Science |
| EISSN | 1571-0661 |
| EndPage | 210 |
| ExternalDocumentID | 10_1016_S1571_0661_04_00157_4 S1571066104001574 |
| GroupedDBID | --K --M 0R~ 0SF 1B1 1~5 29G 4.4 457 4G. 5GY 5VS 6I. 7-5 71M AABNK AACTN AAEDT AAEDW AAFTH AAIKJ AAKOC AALRI AAQFI AAQXK AAXUO ABFNM ABMAC ACDAQ ACGFO ACGFS ACNNM ACRLP ACXMD ADBBV ADEZE ADFGL ADMUD AEKER AEXQZ AFTJW AGHFR AIEXJ AIKHN AITUG AJMQA ALMA_UNASSIGNED_HOLDINGS AMRAJ AOUOD ASPBG AVWKF AXJTR AZFZN CS3 DU5 EBS EJD EO8 EO9 EP2 EP3 FDB FEDTE FGOYB FNPLU G-Q GBLVA HVGLF HZ~ IHE IXB J1W KOM KQ8 M41 M~E N9A NCXOZ O-L O9- OK1 OZT P2P R2- RIG ROL RPZ SDF SDG SES SEW SPC SSV SSW SSZ 9DU AAYWO AAYXX ABWVN ACLOT ACRPL ACVFH ADCNI ADNMO ADVLN AEIPS AEUPX AFPUW AGQPQ AIGII AKBMS AKRWK AKYEP ANKPU CITATION ~HD |
| ID | FETCH-LOGICAL-c2714-38e459f661802fbf2733ecc3346e5a49d8f63f5f2b090f66a2c333f18b49efc3 |
| ISSN | 1571-0661 |
| IngestDate | Sat Nov 29 02:21:33 EST 2025 Tue Nov 18 22:17:20 EST 2025 Fri Feb 23 02:23:30 EST 2024 |
| IsDoiOpenAccess | true |
| IsOpenAccess | true |
| IsPeerReviewed | false |
| IsScholarly | false |
| Keywords | Model checking Reactive systems Timed Concurrent Constraint programming |
| 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-c2714-38e459f661802fbf2733ecc3346e5a49d8f63f5f2b090f66a2c333f18b49efc3 |
| OpenAccessLink | https://dx.doi.org/10.1016/S1571-0661(04)00157-4 |
| PageCount | 14 |
| ParticipantIDs | crossref_primary_10_1016_S1571_0661_04_00157_4 crossref_citationtrail_10_1016_S1571_0661_04_00157_4 elsevier_sciencedirect_doi_10_1016_S1571_0661_04_00157_4 |
| PublicationCentury | 2000 |
| PublicationDate | June 2001 2001-06-00 |
| PublicationDateYYYYMMDD | 2001-06-01 |
| PublicationDate_xml | – month: 06 year: 2001 text: June 2001 |
| PublicationDecade | 2000 |
| PublicationTitle | Electronic notes in theoretical computer science |
| PublicationYear | 2001 |
| Publisher | Elsevier B.V |
| Publisher_xml | – name: Elsevier B.V |
| References | Clarke E., O. Grumberg and D. E. Long Clarke, Grumberg, Peled (NEWBIB2) 1999 San Francisco, January 1995. (1996). 1994, pp. 361–410. Henzinger, Manna, Pnueli (NEWBIB4) 1992 Manna, Pnueli (NEWBIB5) 1995 Saraswat, V. A., R. Jagadeesan and V. Gupta Sipma, Uribe, Manna (NEWBIB8) 1996 Springer-Verlag Nato ASI Series F in: B. Mayoh, E. Tyugu and J. Penjaam, editors Journal of Symbolic Computation (1996), pp. 475–520, extended abstract appeared in the V. A. Saraswat, R. Jagadeesan, and V. Gupta Clarke, Emerson, Sistla (NEWBIB3) 1986; 8 in: S. Abramsky, editor (1994), pp. 71–80. Clarke (10.1016/S1571-0661(04)00157-4_NEWBIB3) 1986; 8 10.1016/S1571-0661(04)00157-4_NEWBIB7 10.1016/S1571-0661(04)00157-4_NEWBIB6 10.1016/S1571-0661(04)00157-4_NEWBIB9 Clarke (10.1016/S1571-0661(04)00157-4_NEWBIB2) 1999 Manna (10.1016/S1571-0661(04)00157-4_NEWBIB5) 1995 Henzinger (10.1016/S1571-0661(04)00157-4_NEWBIB4) 1992 10.1016/S1571-0661(04)00157-4_NEWBIB1 Sipma (10.1016/S1571-0661(04)00157-4_NEWBIB8) 1996 |
| References_xml | – reference: (1996). – reference: (1994), pp. 71–80. – year: 1995 ident: NEWBIB5 publication-title: “Temporal Verification of Reactive Systems. Safety” – reference: V. A. Saraswat, R. Jagadeesan, and V. Gupta, – reference: , 1994, pp. 361–410. – reference: Clarke E., O. Grumberg and D. E. Long, – start-page: 209 year: 1996 end-page: 219 ident: NEWBIB8 article-title: Deductive model checking publication-title: Computer-Aided Verification, 8th International Conference (CAV'96), Lecture Notes in Computer Science – reference: , Journal of Symbolic Computation – reference: Saraswat, V. A., R. Jagadeesan and V. Gupta, – reference: , in: B. Mayoh, E. Tyugu and J. Penjaam, editors, – reference: , Springer-Verlag Nato ASI Series F – reference: , in: S. Abramsky, editor, – year: 1999 ident: NEWBIB2 publication-title: “Model Checking” – volume: 8 start-page: 244 year: 1986 end-page: 263 ident: NEWBIB3 article-title: Automatic verification of finite-state concurrent systems using temporal logic specifications publication-title: toplas – reference: (1996), pp. 475–520, extended abstract appeared in the – reference: , San Francisco, January 1995. – start-page: 226 year: 1992 end-page: 251 ident: NEWBIB4 article-title: Timed transition systems publication-title: Real Time: Theory in Practice, Lecture Notes in Computer Science – ident: 10.1016/S1571-0661(04)00157-4_NEWBIB6 doi: 10.1109/LICS.1994.316085 – start-page: 209 year: 1996 ident: 10.1016/S1571-0661(04)00157-4_NEWBIB8 article-title: Deductive model checking – ident: 10.1016/S1571-0661(04)00157-4_NEWBIB1 doi: 10.1007/978-3-642-61455-2_16 – start-page: 226 year: 1992 ident: 10.1016/S1571-0661(04)00157-4_NEWBIB4 article-title: Timed transition systems doi: 10.1007/BFb0031995 – ident: 10.1016/S1571-0661(04)00157-4_NEWBIB9 – year: 1999 ident: 10.1016/S1571-0661(04)00157-4_NEWBIB2 – ident: 10.1016/S1571-0661(04)00157-4_NEWBIB7 doi: 10.1007/978-3-642-85983-0_15 – volume: 8 start-page: 244 year: 1986 ident: 10.1016/S1571-0661(04)00157-4_NEWBIB3 article-title: Automatic verification of finite-state concurrent systems using temporal logic specifications publication-title: toplas doi: 10.1145/5397.5399 – year: 1995 ident: 10.1016/S1571-0661(04)00157-4_NEWBIB5 |
| SSID | ssj0038176 |
| Score | 1.354647 |
| Snippet | In this paper we present an approach to model concurrent systems specified in a temporal concurrent constraint language. Our goal is to construct a framework... |
| SourceID | crossref elsevier |
| SourceType | Enrichment Source Index Database Publisher |
| StartPage | 197 |
| SubjectTerms | Model checking Reactive systems Timed Concurrent Constraint programming |
| Title | Modeling Concurrent systems specified in a Temporal Concurrent Constraint language-I |
| URI | https://dx.doi.org/10.1016/S1571-0661(04)00157-4 |
| Volume | 48 |
| 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 |
| link | http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwtV1La9wwEBbbpIde-i5JX-jQQsvi1JZlWzqGktL0EAo1ZW_GkiVYMNqQbJb8lP7czliyvEtCX9CLMfJIWms-jWbH8yDkjeaZ0VwViZKlSLjmOgGZpxPAc9tVpWSq88UmqrMzsVjIr7PZjzEWZtNXzonra3n-X1kNbcBsDJ39C3bHQaEB7oHpcAW2w_WPGI_VzXr_Nd_pkH3J52u-nGNc5dKi1rl083Ze-7xU_TYpVvAc6kasoy0zOd2x30-Fc9xqPfhz7YRD6lAnYh4O14gQjNjUQw1hkCQw1yqKZcxNjMmVfMQNunrHZ9-xKpK7Mhtv_-3RCrNjqdjyqPLmsxshNF7iVkjoM7IfmVvagpj2CTmDnM28U284spn3jL1xGnjDxLc4HOjsKX_LJCqKVQgu2k22PdAiKco2uOd3yD6rCgnycv_49GTxZTzlMbHhELk2jj1Fh32YJnyX8vdhstv1ni1dpn5I7oc_IfTYg-cRmRn3mDwYC3zQIO-fkHrEEp0AQgOWaMQSXTra0hFL26QTluiEpaek_nRSf_ychDIciWZVxpNcGF5IC68jUmaVBYU3h42f57w0RctlJ2yZ28IylcoUyFoGz3KbCcWlsTp_RvbcypkDQhk3qk07qbK0QyO24oUSinFhecVEWR4SPq5Ro0OKevyVfRN9EXFpG1zaJuXNsLQNPyRHsdu5z9Hyuw5iZEAT9oJXIBtAzq-7Pv_3ri_IvWlXvCR764sr84rc1Zv18vLidcDXTz_8nt4 |
| linkProvider | Elsevier |
| 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=Modeling+Concurrent+systems+specified+in+a+Temporal+Concurrent+Constraint+language-I&rft.jtitle=Electronic+notes+in+theoretical+computer+science&rft.au=Falaschi%2C+Moreno&rft.au=Policriti%2C+Alberto&rft.au=Villanueva%2C+Alicia&rft.date=2001-06-01&rft.pub=Elsevier+B.V&rft.issn=1571-0661&rft.eissn=1571-0661&rft.volume=48&rft.spage=197&rft.epage=210&rft_id=info:doi/10.1016%2FS1571-0661%2804%2900157-4&rft.externalDocID=S1571066104001574 |
| 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 |