Labelled Tableaux for Distributed Temporal Logic
The distributed temporal logic DTL is a logic for reasoning about temporal properties of discrete distributed systems from the local point of view of the system's agents, which are assumed to execute sequentially and to interact by means of synchronous event sharing. We present a sound and comp...
Gespeichert in:
Veröffentlicht in: | Journal of logic and computation 2009-12, Vol.19 (6), p.1245-1279 |
---|---|
Hauptverfasser: | , , , |
Format: | Artikel |
Sprache: | eng |
Schlagworte: | |
Online-Zugang: | Volltext |
Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
container_end_page | 1279 |
---|---|
container_issue | 6 |
container_start_page | 1245 |
container_title | Journal of logic and computation |
container_volume | 19 |
creator | Basin, David Caleiro, Carlos Ramos, Jaime Viganò, Luca |
description | The distributed temporal logic DTL is a logic for reasoning about temporal properties of discrete distributed systems from the local point of view of the system's agents, which are assumed to execute sequentially and to interact by means of synchronous event sharing. We present a sound and complete labelled tableaux system for full DTL. To achieve this, we first formalize a labelled tableaux system for reasoning locally at each agent and afterwards we combine the local systems into a global one by adding rules that capture the distributed nature of DTL. We also provide examples illustrating the use of DTL and our tableaux system. |
doi_str_mv | 10.1093/logcom/exp022 |
format | Article |
fullrecord | <record><control><sourceid>proquest_cross</sourceid><recordid>TN_cdi_proquest_miscellaneous_36339554</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><oup_id>10.1093/logcom/exp022</oup_id><sourcerecordid>36339554</sourcerecordid><originalsourceid>FETCH-LOGICAL-c378t-b64012271fd0b409b88fdbd79cbbb8442e8044f8ae309e6fb9efb061aab3301d3</originalsourceid><addsrcrecordid>eNqFkM9LwzAYhoMoOKdH7z2Jl7ovP5o2R9ncJhREnDK8hKRNRrU1NWlh_vd2dHj19B2-h5f3fRC6xnCHQdBZ7XaFa2Zm3wIhJ2iCGU9iyun2FE1AJEmcCrI9RxchfAAA4ZhNEORKm7o2ZbRRujaq30fW-WhRhc5Xuu8OD9O0zqs6yt2uKi7RmVV1MFfHO0Wvy4fNfB3nT6vH-X0eFzTNulhzBpiQFNsSNAOhs8yWukxFobXOGCMmA8ZspgwFYbjVwlgNHCulKQVc0im6GXNb7757EzrZVKEYqqov4_ogh1102MQGMB7BwrsQvLGy9VWj_I_EIA9e5OhFjl4G_nbkXd_-ix6jBxtm_wcr_yl5StNErrfvMn95XrwtAUtGfwFwWnVM</addsrcrecordid><sourcetype>Aggregation Database</sourcetype><iscdi>true</iscdi><recordtype>article</recordtype><pqid>36339554</pqid></control><display><type>article</type><title>Labelled Tableaux for Distributed Temporal Logic</title><source>Oxford University Press Journals All Titles (1996-Current)</source><creator>Basin, David ; Caleiro, Carlos ; Ramos, Jaime ; Viganò, Luca</creator><creatorcontrib>Basin, David ; Caleiro, Carlos ; Ramos, Jaime ; Viganò, Luca</creatorcontrib><description>The distributed temporal logic DTL is a logic for reasoning about temporal properties of discrete distributed systems from the local point of view of the system's agents, which are assumed to execute sequentially and to interact by means of synchronous event sharing. We present a sound and complete labelled tableaux system for full DTL. To achieve this, we first formalize a labelled tableaux system for reasoning locally at each agent and afterwards we combine the local systems into a global one by adding rules that capture the distributed nature of DTL. We also provide examples illustrating the use of DTL and our tableaux system.</description><identifier>ISSN: 0955-792X</identifier><identifier>EISSN: 1465-363X</identifier><identifier>DOI: 10.1093/logcom/exp022</identifier><language>eng</language><publisher>Oxford University Press</publisher><subject>discrete time ; Distributed temporal logic ; labelled tableaux system ; soundness and completeness ; until and since</subject><ispartof>Journal of logic and computation, 2009-12, Vol.19 (6), p.1245-1279</ispartof><rights>The Author, 2009. Published by Oxford University Press. All rights reserved. For Permissions, please email: journals.permissions@oxfordjournals.org 2009</rights><lds50>peer_reviewed</lds50><oa>free_for_read</oa><woscitedreferencessubscribed>false</woscitedreferencessubscribed><citedby>FETCH-LOGICAL-c378t-b64012271fd0b409b88fdbd79cbbb8442e8044f8ae309e6fb9efb061aab3301d3</citedby><cites>FETCH-LOGICAL-c378t-b64012271fd0b409b88fdbd79cbbb8442e8044f8ae309e6fb9efb061aab3301d3</cites></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><link.rule.ids>314,780,784,1584,27924,27925</link.rule.ids></links><search><creatorcontrib>Basin, David</creatorcontrib><creatorcontrib>Caleiro, Carlos</creatorcontrib><creatorcontrib>Ramos, Jaime</creatorcontrib><creatorcontrib>Viganò, Luca</creatorcontrib><title>Labelled Tableaux for Distributed Temporal Logic</title><title>Journal of logic and computation</title><description>The distributed temporal logic DTL is a logic for reasoning about temporal properties of discrete distributed systems from the local point of view of the system's agents, which are assumed to execute sequentially and to interact by means of synchronous event sharing. We present a sound and complete labelled tableaux system for full DTL. To achieve this, we first formalize a labelled tableaux system for reasoning locally at each agent and afterwards we combine the local systems into a global one by adding rules that capture the distributed nature of DTL. We also provide examples illustrating the use of DTL and our tableaux system.</description><subject>discrete time</subject><subject>Distributed temporal logic</subject><subject>labelled tableaux system</subject><subject>soundness and completeness</subject><subject>until and since</subject><issn>0955-792X</issn><issn>1465-363X</issn><fulltext>true</fulltext><rsrctype>article</rsrctype><creationdate>2009</creationdate><recordtype>article</recordtype><recordid>eNqFkM9LwzAYhoMoOKdH7z2Jl7ovP5o2R9ncJhREnDK8hKRNRrU1NWlh_vd2dHj19B2-h5f3fRC6xnCHQdBZ7XaFa2Zm3wIhJ2iCGU9iyun2FE1AJEmcCrI9RxchfAAA4ZhNEORKm7o2ZbRRujaq30fW-WhRhc5Xuu8OD9O0zqs6yt2uKi7RmVV1MFfHO0Wvy4fNfB3nT6vH-X0eFzTNulhzBpiQFNsSNAOhs8yWukxFobXOGCMmA8ZspgwFYbjVwlgNHCulKQVc0im6GXNb7757EzrZVKEYqqov4_ogh1102MQGMB7BwrsQvLGy9VWj_I_EIA9e5OhFjl4G_nbkXd_-ix6jBxtm_wcr_yl5StNErrfvMn95XrwtAUtGfwFwWnVM</recordid><startdate>200912</startdate><enddate>200912</enddate><creator>Basin, David</creator><creator>Caleiro, Carlos</creator><creator>Ramos, Jaime</creator><creator>Viganò, Luca</creator><general>Oxford University Press</general><scope>BSCLL</scope><scope>AAYXX</scope><scope>CITATION</scope><scope>7SC</scope><scope>8FD</scope><scope>JQ2</scope><scope>L7M</scope><scope>L~C</scope><scope>L~D</scope></search><sort><creationdate>200912</creationdate><title>Labelled Tableaux for Distributed Temporal Logic</title><author>Basin, David ; Caleiro, Carlos ; Ramos, Jaime ; Viganò, Luca</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-c378t-b64012271fd0b409b88fdbd79cbbb8442e8044f8ae309e6fb9efb061aab3301d3</frbrgroupid><rsrctype>articles</rsrctype><prefilter>articles</prefilter><language>eng</language><creationdate>2009</creationdate><topic>discrete time</topic><topic>Distributed temporal logic</topic><topic>labelled tableaux system</topic><topic>soundness and completeness</topic><topic>until and since</topic><toplevel>peer_reviewed</toplevel><toplevel>online_resources</toplevel><creatorcontrib>Basin, David</creatorcontrib><creatorcontrib>Caleiro, Carlos</creatorcontrib><creatorcontrib>Ramos, Jaime</creatorcontrib><creatorcontrib>Viganò, Luca</creatorcontrib><collection>Istex</collection><collection>CrossRef</collection><collection>Computer and Information Systems Abstracts</collection><collection>Technology Research Database</collection><collection>ProQuest Computer Science Collection</collection><collection>Advanced Technologies Database with Aerospace</collection><collection>Computer and Information Systems Abstracts Academic</collection><collection>Computer and Information Systems Abstracts Professional</collection><jtitle>Journal of logic and computation</jtitle></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext</fulltext></delivery><addata><au>Basin, David</au><au>Caleiro, Carlos</au><au>Ramos, Jaime</au><au>Viganò, Luca</au><format>journal</format><genre>article</genre><ristype>JOUR</ristype><atitle>Labelled Tableaux for Distributed Temporal Logic</atitle><jtitle>Journal of logic and computation</jtitle><date>2009-12</date><risdate>2009</risdate><volume>19</volume><issue>6</issue><spage>1245</spage><epage>1279</epage><pages>1245-1279</pages><issn>0955-792X</issn><eissn>1465-363X</eissn><abstract>The distributed temporal logic DTL is a logic for reasoning about temporal properties of discrete distributed systems from the local point of view of the system's agents, which are assumed to execute sequentially and to interact by means of synchronous event sharing. We present a sound and complete labelled tableaux system for full DTL. To achieve this, we first formalize a labelled tableaux system for reasoning locally at each agent and afterwards we combine the local systems into a global one by adding rules that capture the distributed nature of DTL. We also provide examples illustrating the use of DTL and our tableaux system.</abstract><pub>Oxford University Press</pub><doi>10.1093/logcom/exp022</doi><tpages>35</tpages><oa>free_for_read</oa></addata></record> |
fulltext | fulltext |
identifier | ISSN: 0955-792X |
ispartof | Journal of logic and computation, 2009-12, Vol.19 (6), p.1245-1279 |
issn | 0955-792X 1465-363X |
language | eng |
recordid | cdi_proquest_miscellaneous_36339554 |
source | Oxford University Press Journals All Titles (1996-Current) |
subjects | discrete time Distributed temporal logic labelled tableaux system soundness and completeness until and since |
title | Labelled Tableaux for Distributed Temporal Logic |
url | https://sfx.bib-bvb.de/sfx_tum?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2024-12-19T07%3A55%3A12IST&url_ver=Z39.88-2004&url_ctx_fmt=infofi/fmt:kev:mtx:ctx&rfr_id=info:sid/primo.exlibrisgroup.com:primo3-Article-proquest_cross&rft_val_fmt=info:ofi/fmt:kev:mtx:journal&rft.genre=article&rft.atitle=Labelled%20Tableaux%20for%20Distributed%20Temporal%20Logic&rft.jtitle=Journal%20of%20logic%20and%20computation&rft.au=Basin,%20David&rft.date=2009-12&rft.volume=19&rft.issue=6&rft.spage=1245&rft.epage=1279&rft.pages=1245-1279&rft.issn=0955-792X&rft.eissn=1465-363X&rft_id=info:doi/10.1093/logcom/exp022&rft_dat=%3Cproquest_cross%3E36339554%3C/proquest_cross%3E%3Curl%3E%3C/url%3E&disable_directlink=true&sfx.directlink=off&sfx.report_link=0&rft_id=info:oai/&rft_pqid=36339554&rft_id=info:pmid/&rft_oup_id=10.1093/logcom/exp022&rfr_iscdi=true |