Process algebra with guards: combining Hoare logic with process algebra
Abstract: "We extended process algebra with guards, comparable to the guards in guarded commands or conditions in common programming constructs such as 'if - then - else - fi' and 'while - do - od'. The extended language is provided with an operational semantics based on tra...
Gespeichert in:
| Hauptverfasser: | , |
|---|---|
| Format: | Buch |
| Sprache: | English |
| Veröffentlicht: |
Amsterdam
1990
|
| Schriftenreihe: | Centrum voor Wiskunde en Informatica <Amsterdam>/ Department of Computer Science: Report CS
90,69 |
| Schlagworte: | |
| Online-Zugang: | Volltext |
| Zusammenfassung: | Abstract: "We extended process algebra with guards, comparable to the guards in guarded commands or conditions in common programming constructs such as 'if - then - else - fi' and 'while - do - od'. The extended language is provided with an operational semantics based on transitions between pairs of a process and a (data-)state. The data-states are given by a data environment that also defines in which data-states guards hold and how actions (non-deterministically) transform these states. The operational semantics is studied modulo strong bisimulation equivalence For basic process algebra (without operators for parallelism) we present a small axiom system that is complete with respect to a general class of data environments. Given a particular data environment S we add three axioms to this system, which is then again complete, provided weakest preconditions are expressible and S is sufficiently deterministic. Then we study process algebra with parallelism and guards. A two phase-calculus is provided that makes it possible to prove identities between parallel processes. Also this calculus is complete. In the last section we show that partial correctness formulas can easily be expressed in this setting We use process algebra with guards to prove the soundness of a Hoare logic for linear processes by translating proofs in Hoare logic into proofs in process algebra |
| Beschreibung: | 56 S. |
Internformat
MARC
| LEADER | 00000nam a2200000 cb4500 | ||
|---|---|---|---|
| 001 | BV008974427 | ||
| 003 | DE-604 | ||
| 005 | 20220228 | ||
| 007 | t | ||
| 008 | 940206s1990 |||| 00||| eng d | ||
| 035 | |a (OCoLC)24924102 | ||
| 035 | |a (DE-599)BVBBV008974427 | ||
| 040 | |a DE-604 |b ger |e rakddb | ||
| 041 | 0 | |a eng | |
| 049 | |a DE-29T |a DE-91G | ||
| 100 | 1 | |a Groote, Jan F. |e Verfasser |4 aut | |
| 245 | 1 | 0 | |a Process algebra with guards |b combining Hoare logic with process algebra |c J. F. Groote ; A. Ponse |
| 264 | 1 | |a Amsterdam |c 1990 | |
| 300 | |a 56 S. | ||
| 336 | |b txt |2 rdacontent | ||
| 337 | |b n |2 rdamedia | ||
| 338 | |b nc |2 rdacarrier | ||
| 490 | 1 | |a Centrum voor Wiskunde en Informatica <Amsterdam>/ Department of Computer Science: Report CS |v 90,69 | |
| 520 | 3 | |a Abstract: "We extended process algebra with guards, comparable to the guards in guarded commands or conditions in common programming constructs such as 'if - then - else - fi' and 'while - do - od'. The extended language is provided with an operational semantics based on transitions between pairs of a process and a (data-)state. The data-states are given by a data environment that also defines in which data-states guards hold and how actions (non-deterministically) transform these states. The operational semantics is studied modulo strong bisimulation equivalence | |
| 520 | 3 | |a For basic process algebra (without operators for parallelism) we present a small axiom system that is complete with respect to a general class of data environments. Given a particular data environment S we add three axioms to this system, which is then again complete, provided weakest preconditions are expressible and S is sufficiently deterministic. Then we study process algebra with parallelism and guards. A two phase-calculus is provided that makes it possible to prove identities between parallel processes. Also this calculus is complete. In the last section we show that partial correctness formulas can easily be expressed in this setting | |
| 520 | 3 | |a We use process algebra with guards to prove the soundness of a Hoare logic for linear processes by translating proofs in Hoare logic into proofs in process algebra | |
| 650 | 4 | |a Completeness theorem | |
| 650 | 4 | |a Computer programming | |
| 650 | 4 | |a Conditionals (Logic) | |
| 700 | 1 | |a Ponse, Alban |e Verfasser |4 aut | |
| 776 | 0 | 8 | |i Erscheint auch als |n Online-Ausgabe |
| 830 | 0 | |a Centrum voor Wiskunde en Informatica <Amsterdam>/ Department of Computer Science: Report CS |v 90,69 |w (DE-604)BV008928356 |9 90,69 | |
| 856 | 4 | 1 | |u https://ir.cwi.nl/pub/5614 |x Verlag |z kostenfrei |3 Volltext |
| 912 | |a ebook | ||
| 999 | |a oai:aleph.bib-bvb.de:BVB01-005926001 | ||
Datensatz im Suchindex
| _version_ | 1804123312444407808 |
|---|---|
| any_adam_object | |
| author | Groote, Jan F. Ponse, Alban |
| author_facet | Groote, Jan F. Ponse, Alban |
| author_role | aut aut |
| author_sort | Groote, Jan F. |
| author_variant | j f g jf jfg a p ap |
| building | Verbundindex |
| bvnumber | BV008974427 |
| collection | ebook |
| ctrlnum | (OCoLC)24924102 (DE-599)BVBBV008974427 |
| format | Book |
| fullrecord | <?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>02673nam a2200385 cb4500</leader><controlfield tag="001">BV008974427</controlfield><controlfield tag="003">DE-604</controlfield><controlfield tag="005">20220228 </controlfield><controlfield tag="007">t</controlfield><controlfield tag="008">940206s1990 |||| 00||| eng d</controlfield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(OCoLC)24924102</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-599)BVBBV008974427</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-29T</subfield><subfield code="a">DE-91G</subfield></datafield><datafield tag="100" ind1="1" ind2=" "><subfield code="a">Groote, Jan F.</subfield><subfield code="e">Verfasser</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">Process algebra with guards</subfield><subfield code="b">combining Hoare logic with process algebra</subfield><subfield code="c">J. F. Groote ; A. Ponse</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="a">Amsterdam</subfield><subfield code="c">1990</subfield></datafield><datafield tag="300" ind1=" " ind2=" "><subfield code="a">56 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">Centrum voor Wiskunde en Informatica <Amsterdam>/ Department of Computer Science: Report CS</subfield><subfield code="v">90,69</subfield></datafield><datafield tag="520" ind1="3" ind2=" "><subfield code="a">Abstract: "We extended process algebra with guards, comparable to the guards in guarded commands or conditions in common programming constructs such as 'if - then - else - fi' and 'while - do - od'. The extended language is provided with an operational semantics based on transitions between pairs of a process and a (data-)state. The data-states are given by a data environment that also defines in which data-states guards hold and how actions (non-deterministically) transform these states. The operational semantics is studied modulo strong bisimulation equivalence</subfield></datafield><datafield tag="520" ind1="3" ind2=" "><subfield code="a">For basic process algebra (without operators for parallelism) we present a small axiom system that is complete with respect to a general class of data environments. Given a particular data environment S we add three axioms to this system, which is then again complete, provided weakest preconditions are expressible and S is sufficiently deterministic. Then we study process algebra with parallelism and guards. A two phase-calculus is provided that makes it possible to prove identities between parallel processes. Also this calculus is complete. In the last section we show that partial correctness formulas can easily be expressed in this setting</subfield></datafield><datafield tag="520" ind1="3" ind2=" "><subfield code="a">We use process algebra with guards to prove the soundness of a Hoare logic for linear processes by translating proofs in Hoare logic into proofs in process algebra</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Completeness theorem</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Computer programming</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Conditionals (Logic)</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Ponse, Alban</subfield><subfield code="e">Verfasser</subfield><subfield code="4">aut</subfield></datafield><datafield tag="776" ind1="0" ind2="8"><subfield code="i">Erscheint auch als</subfield><subfield code="n">Online-Ausgabe</subfield></datafield><datafield tag="830" ind1=" " ind2="0"><subfield code="a">Centrum voor Wiskunde en Informatica <Amsterdam>/ Department of Computer Science: Report CS</subfield><subfield code="v">90,69</subfield><subfield code="w">(DE-604)BV008928356</subfield><subfield code="9">90,69</subfield></datafield><datafield tag="856" ind1="4" ind2="1"><subfield code="u">https://ir.cwi.nl/pub/5614</subfield><subfield code="x">Verlag</subfield><subfield code="z">kostenfrei</subfield><subfield code="3">Volltext</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">ebook</subfield></datafield><datafield tag="999" ind1=" " ind2=" "><subfield code="a">oai:aleph.bib-bvb.de:BVB01-005926001</subfield></datafield></record></collection> |
| id | DE-604.BV008974427 |
| illustrated | Not Illustrated |
| indexdate | 2024-07-09T17:27:46Z |
| institution | BVB |
| language | English |
| oai_aleph_id | oai:aleph.bib-bvb.de:BVB01-005926001 |
| oclc_num | 24924102 |
| open_access_boolean | 1 |
| owner | DE-29T DE-91G DE-BY-TUM |
| owner_facet | DE-29T DE-91G DE-BY-TUM |
| physical | 56 S. |
| psigel | ebook |
| publishDate | 1990 |
| publishDateSearch | 1990 |
| publishDateSort | 1990 |
| record_format | marc |
| series | Centrum voor Wiskunde en Informatica <Amsterdam>/ Department of Computer Science: Report CS |
| series2 | Centrum voor Wiskunde en Informatica <Amsterdam>/ Department of Computer Science: Report CS |
| spelling | Groote, Jan F. Verfasser aut Process algebra with guards combining Hoare logic with process algebra J. F. Groote ; A. Ponse Amsterdam 1990 56 S. txt rdacontent n rdamedia nc rdacarrier Centrum voor Wiskunde en Informatica <Amsterdam>/ Department of Computer Science: Report CS 90,69 Abstract: "We extended process algebra with guards, comparable to the guards in guarded commands or conditions in common programming constructs such as 'if - then - else - fi' and 'while - do - od'. The extended language is provided with an operational semantics based on transitions between pairs of a process and a (data-)state. The data-states are given by a data environment that also defines in which data-states guards hold and how actions (non-deterministically) transform these states. The operational semantics is studied modulo strong bisimulation equivalence For basic process algebra (without operators for parallelism) we present a small axiom system that is complete with respect to a general class of data environments. Given a particular data environment S we add three axioms to this system, which is then again complete, provided weakest preconditions are expressible and S is sufficiently deterministic. Then we study process algebra with parallelism and guards. A two phase-calculus is provided that makes it possible to prove identities between parallel processes. Also this calculus is complete. In the last section we show that partial correctness formulas can easily be expressed in this setting We use process algebra with guards to prove the soundness of a Hoare logic for linear processes by translating proofs in Hoare logic into proofs in process algebra Completeness theorem Computer programming Conditionals (Logic) Ponse, Alban Verfasser aut Erscheint auch als Online-Ausgabe Centrum voor Wiskunde en Informatica <Amsterdam>/ Department of Computer Science: Report CS 90,69 (DE-604)BV008928356 90,69 https://ir.cwi.nl/pub/5614 Verlag kostenfrei Volltext |
| spellingShingle | Groote, Jan F. Ponse, Alban Process algebra with guards combining Hoare logic with process algebra Centrum voor Wiskunde en Informatica <Amsterdam>/ Department of Computer Science: Report CS Completeness theorem Computer programming Conditionals (Logic) |
| title | Process algebra with guards combining Hoare logic with process algebra |
| title_auth | Process algebra with guards combining Hoare logic with process algebra |
| title_exact_search | Process algebra with guards combining Hoare logic with process algebra |
| title_full | Process algebra with guards combining Hoare logic with process algebra J. F. Groote ; A. Ponse |
| title_fullStr | Process algebra with guards combining Hoare logic with process algebra J. F. Groote ; A. Ponse |
| title_full_unstemmed | Process algebra with guards combining Hoare logic with process algebra J. F. Groote ; A. Ponse |
| title_short | Process algebra with guards |
| title_sort | process algebra with guards combining hoare logic with process algebra |
| title_sub | combining Hoare logic with process algebra |
| topic | Completeness theorem Computer programming Conditionals (Logic) |
| topic_facet | Completeness theorem Computer programming Conditionals (Logic) |
| url | https://ir.cwi.nl/pub/5614 |
| volume_link | (DE-604)BV008928356 |
| work_keys_str_mv | AT grootejanf processalgebrawithguardscombininghoarelogicwithprocessalgebra AT ponsealban processalgebrawithguardscombininghoarelogicwithprocessalgebra |