TLWT, a temporal logic for concurrent programs:
Abstract: "In this work, a framework is discussed that allows concurrent programs behaviour to be formalized by means of a temporal logic theory. The class of concurrent programs that we take into account cover many CSP-like concurrent programming languages, and, in particular, the OCCAM progra...
Saved in:
| Main Authors: | , |
|---|---|
| Format: | Book |
| Language: | English |
| Published: |
Pisa
1991
|
| Series: | Università degli Studi <Pisa> / Dipartimento di Informatica: Technical report
1991,27 |
| Subjects: | |
| Summary: | Abstract: "In this work, a framework is discussed that allows concurrent programs behaviour to be formalized by means of a temporal logic theory. The class of concurrent programs that we take into account cover many CSP-like concurrent programming languages, and, in particular, the OCCAM programming language. The approach followed here allows us to derive the global behaviour of a concurrent program E by composing the internal behaviour relative to the component processes of E. For our temporal logic theory we propose two different P-time model checking algorithms: one is a sequential and the other one is parallel." |
| Physical Description: | 37 S. |
Staff View
MARC
| LEADER | 00000nam a2200000 cb4500 | ||
|---|---|---|---|
| 001 | BV010848244 | ||
| 003 | DE-604 | ||
| 005 | 00000000000000.0 | ||
| 007 | t | ||
| 008 | 960712s1991 |||| 00||| engod | ||
| 035 | |a (OCoLC)28285023 | ||
| 035 | |a (DE-599)BVBBV010848244 | ||
| 040 | |a DE-604 |b ger |e rakddb | ||
| 041 | 0 | |a eng | |
| 049 | |a DE-91G | ||
| 100 | 1 | |a Danelutto, Marco |e Verfasser |4 aut | |
| 245 | 1 | 0 | |a TLWT, a temporal logic for concurrent programs |c M. Danelutto ; A. Masini |
| 264 | 1 | |a Pisa |c 1991 | |
| 300 | |a 37 S. | ||
| 336 | |b txt |2 rdacontent | ||
| 337 | |b n |2 rdamedia | ||
| 338 | |b nc |2 rdacarrier | ||
| 490 | 1 | |a Università degli Studi <Pisa> / Dipartimento di Informatica: Technical report |v 1991,27 | |
| 520 | 3 | |a Abstract: "In this work, a framework is discussed that allows concurrent programs behaviour to be formalized by means of a temporal logic theory. The class of concurrent programs that we take into account cover many CSP-like concurrent programming languages, and, in particular, the OCCAM programming language. The approach followed here allows us to derive the global behaviour of a concurrent program E by composing the internal behaviour relative to the component processes of E. For our temporal logic theory we propose two different P-time model checking algorithms: one is a sequential and the other one is parallel." | |
| 650 | 4 | |a Concurrent programming | |
| 700 | 1 | |a Masini, Andrea |e Verfasser |4 aut | |
| 810 | 2 | |a Dipartimento di Informatica: Technical report |t Università degli Studi <Pisa> |v 1991,27 |w (DE-604)BV010841375 |9 1991,27 | |
| 999 | |a oai:aleph.bib-bvb.de:BVB01-007250867 | ||
Record in the Search Index
| _version_ | 1804125334206939136 |
|---|---|
| any_adam_object | |
| author | Danelutto, Marco Masini, Andrea |
| author_facet | Danelutto, Marco Masini, Andrea |
| author_role | aut aut |
| author_sort | Danelutto, Marco |
| author_variant | m d md a m am |
| building | Verbundindex |
| bvnumber | BV010848244 |
| ctrlnum | (OCoLC)28285023 (DE-599)BVBBV010848244 |
| format | Book |
| fullrecord | <?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>01609nam a2200301 cb4500</leader><controlfield tag="001">BV010848244</controlfield><controlfield tag="003">DE-604</controlfield><controlfield tag="005">00000000000000.0</controlfield><controlfield tag="007">t</controlfield><controlfield tag="008">960712s1991 |||| 00||| engod</controlfield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(OCoLC)28285023</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-599)BVBBV010848244</subfield></datafield><datafield tag="040" ind1=" " ind2=" "><subfield code="a">DE-604</subfield><subfield code="b">ger</subfield><subfield code="e">rakddb</subfield></datafield><datafield tag="041" ind1="0" ind2=" "><subfield code="a">eng</subfield></datafield><datafield tag="049" ind1=" " ind2=" "><subfield code="a">DE-91G</subfield></datafield><datafield tag="100" ind1="1" ind2=" "><subfield code="a">Danelutto, Marco</subfield><subfield code="e">Verfasser</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">TLWT, a temporal logic for concurrent programs</subfield><subfield code="c">M. Danelutto ; A. Masini</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="a">Pisa</subfield><subfield code="c">1991</subfield></datafield><datafield tag="300" ind1=" " ind2=" "><subfield code="a">37 S.</subfield></datafield><datafield tag="336" ind1=" " ind2=" "><subfield code="b">txt</subfield><subfield code="2">rdacontent</subfield></datafield><datafield tag="337" ind1=" " ind2=" "><subfield code="b">n</subfield><subfield code="2">rdamedia</subfield></datafield><datafield tag="338" ind1=" " ind2=" "><subfield code="b">nc</subfield><subfield code="2">rdacarrier</subfield></datafield><datafield tag="490" ind1="1" ind2=" "><subfield code="a">Università degli Studi <Pisa> / Dipartimento di Informatica: Technical report</subfield><subfield code="v">1991,27</subfield></datafield><datafield tag="520" ind1="3" ind2=" "><subfield code="a">Abstract: "In this work, a framework is discussed that allows concurrent programs behaviour to be formalized by means of a temporal logic theory. The class of concurrent programs that we take into account cover many CSP-like concurrent programming languages, and, in particular, the OCCAM programming language. The approach followed here allows us to derive the global behaviour of a concurrent program E by composing the internal behaviour relative to the component processes of E. For our temporal logic theory we propose two different P-time model checking algorithms: one is a sequential and the other one is parallel."</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Concurrent programming</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Masini, Andrea</subfield><subfield code="e">Verfasser</subfield><subfield code="4">aut</subfield></datafield><datafield tag="810" ind1="2" ind2=" "><subfield code="a">Dipartimento di Informatica: Technical report</subfield><subfield code="t">Università degli Studi <Pisa></subfield><subfield code="v">1991,27</subfield><subfield code="w">(DE-604)BV010841375</subfield><subfield code="9">1991,27</subfield></datafield><datafield tag="999" ind1=" " ind2=" "><subfield code="a">oai:aleph.bib-bvb.de:BVB01-007250867</subfield></datafield></record></collection> |
| id | DE-604.BV010848244 |
| illustrated | Not Illustrated |
| indexdate | 2024-07-09T17:59:54Z |
| institution | BVB |
| language | English |
| oai_aleph_id | oai:aleph.bib-bvb.de:BVB01-007250867 |
| oclc_num | 28285023 |
| open_access_boolean | |
| owner | DE-91G DE-BY-TUM |
| owner_facet | DE-91G DE-BY-TUM |
| physical | 37 S. |
| publishDate | 1991 |
| publishDateSearch | 1991 |
| publishDateSort | 1991 |
| record_format | marc |
| series2 | Università degli Studi <Pisa> / Dipartimento di Informatica: Technical report |
| spelling | Danelutto, Marco Verfasser aut TLWT, a temporal logic for concurrent programs M. Danelutto ; A. Masini Pisa 1991 37 S. txt rdacontent n rdamedia nc rdacarrier Università degli Studi <Pisa> / Dipartimento di Informatica: Technical report 1991,27 Abstract: "In this work, a framework is discussed that allows concurrent programs behaviour to be formalized by means of a temporal logic theory. The class of concurrent programs that we take into account cover many CSP-like concurrent programming languages, and, in particular, the OCCAM programming language. The approach followed here allows us to derive the global behaviour of a concurrent program E by composing the internal behaviour relative to the component processes of E. For our temporal logic theory we propose two different P-time model checking algorithms: one is a sequential and the other one is parallel." Concurrent programming Masini, Andrea Verfasser aut Dipartimento di Informatica: Technical report Università degli Studi <Pisa> 1991,27 (DE-604)BV010841375 1991,27 |
| spellingShingle | Danelutto, Marco Masini, Andrea TLWT, a temporal logic for concurrent programs Concurrent programming |
| title | TLWT, a temporal logic for concurrent programs |
| title_auth | TLWT, a temporal logic for concurrent programs |
| title_exact_search | TLWT, a temporal logic for concurrent programs |
| title_full | TLWT, a temporal logic for concurrent programs M. Danelutto ; A. Masini |
| title_fullStr | TLWT, a temporal logic for concurrent programs M. Danelutto ; A. Masini |
| title_full_unstemmed | TLWT, a temporal logic for concurrent programs M. Danelutto ; A. Masini |
| title_short | TLWT, a temporal logic for concurrent programs |
| title_sort | tlwt a temporal logic for concurrent programs |
| topic | Concurrent programming |
| topic_facet | Concurrent programming |
| volume_link | (DE-604)BV010841375 |
| work_keys_str_mv | AT daneluttomarco tlwtatemporallogicforconcurrentprograms AT masiniandrea tlwtatemporallogicforconcurrentprograms |