Process algebra: equational theories of communicating processes
Process algebra is a widely accepted and much used technique in the specification and verification of parallel and distributed software systems. This book sets the standard for the field. It assembles the relevant results of most process algebras currently in use, and presents them in a unified fram...
Gespeichert in:
| 1. Verfasser: | |
|---|---|
| Format: | Elektronisch E-Book |
| Sprache: | English |
| Veröffentlicht: |
Cambridge
Cambridge University Press
2010
|
| Schriftenreihe: | Cambridge tracts in theoretical computer science
50 |
| Schlagworte: | |
| Online-Zugang: | BSB01 FHN01 Volltext |
| Zusammenfassung: | Process algebra is a widely accepted and much used technique in the specification and verification of parallel and distributed software systems. This book sets the standard for the field. It assembles the relevant results of most process algebras currently in use, and presents them in a unified framework and notation. The authors describe the theory underlying the development, realization and maintenance of software that occurs in parallel or distributed systems. A system can be specified in the syntax provided, and the axioms can be used to verify that a composed system has the required external behaviour. As examples, two protocols are completely specified and verified in the text: the Alternating-Bit Protocol for Data Communication, and Fischer's Protocol of Mutual Exclusion. The book serves as a reference text for researchers and graduate students in computer science, offering a complete overview of the field and referring to further literature where appropriate |
| Beschreibung: | Title from publisher's bibliographic system (viewed on 05 Oct 2015) |
| Beschreibung: | 1 online resource (xvi, 460 pages) |
| ISBN: | 9781139195003 |
| DOI: | 10.1017/CBO9781139195003 |
Internformat
MARC
| LEADER | 00000nmm a2200000zcb4500 | ||
|---|---|---|---|
| 001 | BV043940624 | ||
| 003 | DE-604 | ||
| 005 | 00000000000000.0 | ||
| 007 | cr|uuu---uuuuu | ||
| 008 | 161206s2010 |||| o||u| ||||||eng d | ||
| 020 | |a 9781139195003 |c Online |9 978-1-139-19500-3 | ||
| 024 | 7 | |a 10.1017/CBO9781139195003 |2 doi | |
| 035 | |a (ZDB-20-CBO)CR9781139195003 | ||
| 035 | |a (OCoLC)992928429 | ||
| 035 | |a (DE-599)BVBBV043940624 | ||
| 040 | |a DE-604 |b ger |e rda | ||
| 041 | 0 | |a eng | |
| 049 | |a DE-12 |a DE-92 | ||
| 082 | 0 | |a 004.0151 |2 22 | |
| 084 | |a ST 130 |0 (DE-625)143588: |2 rvk | ||
| 100 | 1 | |a Baeten, J. C. M. |e Verfasser |4 aut | |
| 245 | 1 | 0 | |a Process algebra |b equational theories of communicating processes |c J.C.M. Baeten, T. Basten, M.A. Raniers |
| 264 | 1 | |a Cambridge |b Cambridge University Press |c 2010 | |
| 300 | |a 1 online resource (xvi, 460 pages) | ||
| 336 | |b txt |2 rdacontent | ||
| 337 | |b c |2 rdamedia | ||
| 338 | |b cr |2 rdacarrier | ||
| 490 | 0 | |a Cambridge tracts in theoretical computer science |v 50 | |
| 500 | |a Title from publisher's bibliographic system (viewed on 05 Oct 2015) | ||
| 505 | 8 | |a Foreword / Tony Hoare -- Foreword / Robin Milner -- Foreword / Jan Bergstra -- 1. Process algebra -- 2. Preliminaries -- 3. Transition systems -- 4. Basic process theory -- 5. Recursion -- 6. Sequential processes -- 7. Parallel and communicating processes -- 8. Abstraction -- 9. Timing -- 10. Data and states -- 11. Features -- 12. Semantics | |
| 520 | |a Process algebra is a widely accepted and much used technique in the specification and verification of parallel and distributed software systems. This book sets the standard for the field. It assembles the relevant results of most process algebras currently in use, and presents them in a unified framework and notation. The authors describe the theory underlying the development, realization and maintenance of software that occurs in parallel or distributed systems. A system can be specified in the syntax provided, and the axioms can be used to verify that a composed system has the required external behaviour. As examples, two protocols are completely specified and verified in the text: the Alternating-Bit Protocol for Data Communication, and Fischer's Protocol of Mutual Exclusion. The book serves as a reference text for researchers and graduate students in computer science, offering a complete overview of the field and referring to further literature where appropriate | ||
| 650 | 4 | |a Datenverarbeitung | |
| 650 | 4 | |a Parallel processing (Electronic computers) | |
| 650 | 4 | |a Electronic data processing / Distributed processing | |
| 650 | 0 | 7 | |a Prozess |g Informatik |0 (DE-588)4235427-4 |2 gnd |9 rswk-swf |
| 650 | 0 | 7 | |a Prozessalgebra |0 (DE-588)4283920-8 |2 gnd |9 rswk-swf |
| 689 | 0 | 0 | |a Prozessalgebra |0 (DE-588)4283920-8 |D s |
| 689 | 0 | |8 1\p |5 DE-604 | |
| 689 | 1 | 0 | |a Prozess |g Informatik |0 (DE-588)4235427-4 |D s |
| 689 | 1 | |8 2\p |5 DE-604 | |
| 700 | 1 | |a Basten, Thomas Geertruida Henricus |d 1973- |e Sonstige |4 oth | |
| 700 | 1 | |a Reniers, M. A. |d 1970- |e Sonstige |4 oth | |
| 776 | 0 | 8 | |i Erscheint auch als |n Druckausgabe |z 978-0-521-82049-3 |
| 856 | 4 | 0 | |u https://doi.org/10.1017/CBO9781139195003 |x Verlag |z URL des Erstveröffentlichers |3 Volltext |
| 912 | |a ZDB-20-CBO | ||
| 999 | |a oai:aleph.bib-bvb.de:BVB01-029349594 | ||
| 883 | 1 | |8 1\p |a cgwrk |d 20201028 |q DE-101 |u https://d-nb.info/provenance/plan#cgwrk | |
| 883 | 1 | |8 2\p |a cgwrk |d 20201028 |q DE-101 |u https://d-nb.info/provenance/plan#cgwrk | |
| 966 | e | |u https://doi.org/10.1017/CBO9781139195003 |l BSB01 |p ZDB-20-CBO |q BSB_PDA_CBO |x Verlag |3 Volltext | |
| 966 | e | |u https://doi.org/10.1017/CBO9781139195003 |l FHN01 |p ZDB-20-CBO |q FHN_PDA_CBO |x Verlag |3 Volltext | |
Datensatz im Suchindex
| _version_ | 1804176881398841344 |
|---|---|
| any_adam_object | |
| author | Baeten, J. C. M. |
| author_facet | Baeten, J. C. M. |
| author_role | aut |
| author_sort | Baeten, J. C. M. |
| author_variant | j c m b jcm jcmb |
| building | Verbundindex |
| bvnumber | BV043940624 |
| classification_rvk | ST 130 |
| collection | ZDB-20-CBO |
| contents | Foreword / Tony Hoare -- Foreword / Robin Milner -- Foreword / Jan Bergstra -- 1. Process algebra -- 2. Preliminaries -- 3. Transition systems -- 4. Basic process theory -- 5. Recursion -- 6. Sequential processes -- 7. Parallel and communicating processes -- 8. Abstraction -- 9. Timing -- 10. Data and states -- 11. Features -- 12. Semantics |
| ctrlnum | (ZDB-20-CBO)CR9781139195003 (OCoLC)992928429 (DE-599)BVBBV043940624 |
| dewey-full | 004.0151 |
| dewey-hundreds | 000 - Computer science, information, general works |
| dewey-ones | 004 - Computer science |
| dewey-raw | 004.0151 |
| dewey-search | 004.0151 |
| dewey-sort | 14.0151 |
| dewey-tens | 000 - Computer science, information, general works |
| discipline | Informatik |
| doi_str_mv | 10.1017/CBO9781139195003 |
| format | Electronic eBook |
| fullrecord | <?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>03662nmm a2200565zcb4500</leader><controlfield tag="001">BV043940624</controlfield><controlfield tag="003">DE-604</controlfield><controlfield tag="005">00000000000000.0</controlfield><controlfield tag="007">cr|uuu---uuuuu</controlfield><controlfield tag="008">161206s2010 |||| o||u| ||||||eng d</controlfield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">9781139195003</subfield><subfield code="c">Online</subfield><subfield code="9">978-1-139-19500-3</subfield></datafield><datafield tag="024" ind1="7" ind2=" "><subfield code="a">10.1017/CBO9781139195003</subfield><subfield code="2">doi</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(ZDB-20-CBO)CR9781139195003</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(OCoLC)992928429</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-599)BVBBV043940624</subfield></datafield><datafield tag="040" ind1=" " ind2=" "><subfield code="a">DE-604</subfield><subfield code="b">ger</subfield><subfield code="e">rda</subfield></datafield><datafield tag="041" ind1="0" ind2=" "><subfield code="a">eng</subfield></datafield><datafield tag="049" ind1=" " ind2=" "><subfield code="a">DE-12</subfield><subfield code="a">DE-92</subfield></datafield><datafield tag="082" ind1="0" ind2=" "><subfield code="a">004.0151</subfield><subfield code="2">22</subfield></datafield><datafield tag="084" ind1=" " ind2=" "><subfield code="a">ST 130</subfield><subfield code="0">(DE-625)143588:</subfield><subfield code="2">rvk</subfield></datafield><datafield tag="100" ind1="1" ind2=" "><subfield code="a">Baeten, J. C. M.</subfield><subfield code="e">Verfasser</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">Process algebra</subfield><subfield code="b">equational theories of communicating processes</subfield><subfield code="c">J.C.M. Baeten, T. Basten, M.A. Raniers</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="a">Cambridge</subfield><subfield code="b">Cambridge University Press</subfield><subfield code="c">2010</subfield></datafield><datafield tag="300" ind1=" " ind2=" "><subfield code="a">1 online resource (xvi, 460 pages)</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">c</subfield><subfield code="2">rdamedia</subfield></datafield><datafield tag="338" ind1=" " ind2=" "><subfield code="b">cr</subfield><subfield code="2">rdacarrier</subfield></datafield><datafield tag="490" ind1="0" ind2=" "><subfield code="a">Cambridge tracts in theoretical computer science</subfield><subfield code="v">50</subfield></datafield><datafield tag="500" ind1=" " ind2=" "><subfield code="a">Title from publisher's bibliographic system (viewed on 05 Oct 2015)</subfield></datafield><datafield tag="505" ind1="8" ind2=" "><subfield code="a">Foreword / Tony Hoare -- Foreword / Robin Milner -- Foreword / Jan Bergstra -- 1. Process algebra -- 2. Preliminaries -- 3. Transition systems -- 4. Basic process theory -- 5. Recursion -- 6. Sequential processes -- 7. Parallel and communicating processes -- 8. Abstraction -- 9. Timing -- 10. Data and states -- 11. Features -- 12. Semantics</subfield></datafield><datafield tag="520" ind1=" " ind2=" "><subfield code="a">Process algebra is a widely accepted and much used technique in the specification and verification of parallel and distributed software systems. This book sets the standard for the field. It assembles the relevant results of most process algebras currently in use, and presents them in a unified framework and notation. The authors describe the theory underlying the development, realization and maintenance of software that occurs in parallel or distributed systems. A system can be specified in the syntax provided, and the axioms can be used to verify that a composed system has the required external behaviour. As examples, two protocols are completely specified and verified in the text: the Alternating-Bit Protocol for Data Communication, and Fischer's Protocol of Mutual Exclusion. The book serves as a reference text for researchers and graduate students in computer science, offering a complete overview of the field and referring to further literature where appropriate</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Datenverarbeitung</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Parallel processing (Electronic computers)</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Electronic data processing / Distributed processing</subfield></datafield><datafield tag="650" ind1="0" ind2="7"><subfield code="a">Prozess</subfield><subfield code="g">Informatik</subfield><subfield code="0">(DE-588)4235427-4</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</subfield></datafield><datafield tag="650" ind1="0" ind2="7"><subfield code="a">Prozessalgebra</subfield><subfield code="0">(DE-588)4283920-8</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</subfield></datafield><datafield tag="689" ind1="0" ind2="0"><subfield code="a">Prozessalgebra</subfield><subfield code="0">(DE-588)4283920-8</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="0" ind2=" "><subfield code="8">1\p</subfield><subfield code="5">DE-604</subfield></datafield><datafield tag="689" ind1="1" ind2="0"><subfield code="a">Prozess</subfield><subfield code="g">Informatik</subfield><subfield code="0">(DE-588)4235427-4</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="1" ind2=" "><subfield code="8">2\p</subfield><subfield code="5">DE-604</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Basten, Thomas Geertruida Henricus</subfield><subfield code="d">1973-</subfield><subfield code="e">Sonstige</subfield><subfield code="4">oth</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Reniers, M. A.</subfield><subfield code="d">1970-</subfield><subfield code="e">Sonstige</subfield><subfield code="4">oth</subfield></datafield><datafield tag="776" ind1="0" ind2="8"><subfield code="i">Erscheint auch als</subfield><subfield code="n">Druckausgabe</subfield><subfield code="z">978-0-521-82049-3</subfield></datafield><datafield tag="856" ind1="4" ind2="0"><subfield code="u">https://doi.org/10.1017/CBO9781139195003</subfield><subfield code="x">Verlag</subfield><subfield code="z">URL des Erstveröffentlichers</subfield><subfield code="3">Volltext</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">ZDB-20-CBO</subfield></datafield><datafield tag="999" ind1=" " ind2=" "><subfield code="a">oai:aleph.bib-bvb.de:BVB01-029349594</subfield></datafield><datafield tag="883" ind1="1" ind2=" "><subfield code="8">1\p</subfield><subfield code="a">cgwrk</subfield><subfield code="d">20201028</subfield><subfield code="q">DE-101</subfield><subfield code="u">https://d-nb.info/provenance/plan#cgwrk</subfield></datafield><datafield tag="883" ind1="1" ind2=" "><subfield code="8">2\p</subfield><subfield code="a">cgwrk</subfield><subfield code="d">20201028</subfield><subfield code="q">DE-101</subfield><subfield code="u">https://d-nb.info/provenance/plan#cgwrk</subfield></datafield><datafield tag="966" ind1="e" ind2=" "><subfield code="u">https://doi.org/10.1017/CBO9781139195003</subfield><subfield code="l">BSB01</subfield><subfield code="p">ZDB-20-CBO</subfield><subfield code="q">BSB_PDA_CBO</subfield><subfield code="x">Verlag</subfield><subfield code="3">Volltext</subfield></datafield><datafield tag="966" ind1="e" ind2=" "><subfield code="u">https://doi.org/10.1017/CBO9781139195003</subfield><subfield code="l">FHN01</subfield><subfield code="p">ZDB-20-CBO</subfield><subfield code="q">FHN_PDA_CBO</subfield><subfield code="x">Verlag</subfield><subfield code="3">Volltext</subfield></datafield></record></collection> |
| id | DE-604.BV043940624 |
| illustrated | Not Illustrated |
| indexdate | 2024-07-10T07:39:13Z |
| institution | BVB |
| isbn | 9781139195003 |
| language | English |
| oai_aleph_id | oai:aleph.bib-bvb.de:BVB01-029349594 |
| oclc_num | 992928429 |
| open_access_boolean | |
| owner | DE-12 DE-92 |
| owner_facet | DE-12 DE-92 |
| physical | 1 online resource (xvi, 460 pages) |
| psigel | ZDB-20-CBO ZDB-20-CBO BSB_PDA_CBO ZDB-20-CBO FHN_PDA_CBO |
| publishDate | 2010 |
| publishDateSearch | 2010 |
| publishDateSort | 2010 |
| publisher | Cambridge University Press |
| record_format | marc |
| series2 | Cambridge tracts in theoretical computer science |
| spelling | Baeten, J. C. M. Verfasser aut Process algebra equational theories of communicating processes J.C.M. Baeten, T. Basten, M.A. Raniers Cambridge Cambridge University Press 2010 1 online resource (xvi, 460 pages) txt rdacontent c rdamedia cr rdacarrier Cambridge tracts in theoretical computer science 50 Title from publisher's bibliographic system (viewed on 05 Oct 2015) Foreword / Tony Hoare -- Foreword / Robin Milner -- Foreword / Jan Bergstra -- 1. Process algebra -- 2. Preliminaries -- 3. Transition systems -- 4. Basic process theory -- 5. Recursion -- 6. Sequential processes -- 7. Parallel and communicating processes -- 8. Abstraction -- 9. Timing -- 10. Data and states -- 11. Features -- 12. Semantics Process algebra is a widely accepted and much used technique in the specification and verification of parallel and distributed software systems. This book sets the standard for the field. It assembles the relevant results of most process algebras currently in use, and presents them in a unified framework and notation. The authors describe the theory underlying the development, realization and maintenance of software that occurs in parallel or distributed systems. A system can be specified in the syntax provided, and the axioms can be used to verify that a composed system has the required external behaviour. As examples, two protocols are completely specified and verified in the text: the Alternating-Bit Protocol for Data Communication, and Fischer's Protocol of Mutual Exclusion. The book serves as a reference text for researchers and graduate students in computer science, offering a complete overview of the field and referring to further literature where appropriate Datenverarbeitung Parallel processing (Electronic computers) Electronic data processing / Distributed processing Prozess Informatik (DE-588)4235427-4 gnd rswk-swf Prozessalgebra (DE-588)4283920-8 gnd rswk-swf Prozessalgebra (DE-588)4283920-8 s 1\p DE-604 Prozess Informatik (DE-588)4235427-4 s 2\p DE-604 Basten, Thomas Geertruida Henricus 1973- Sonstige oth Reniers, M. A. 1970- Sonstige oth Erscheint auch als Druckausgabe 978-0-521-82049-3 https://doi.org/10.1017/CBO9781139195003 Verlag URL des Erstveröffentlichers Volltext 1\p cgwrk 20201028 DE-101 https://d-nb.info/provenance/plan#cgwrk 2\p cgwrk 20201028 DE-101 https://d-nb.info/provenance/plan#cgwrk |
| spellingShingle | Baeten, J. C. M. Process algebra equational theories of communicating processes Foreword / Tony Hoare -- Foreword / Robin Milner -- Foreword / Jan Bergstra -- 1. Process algebra -- 2. Preliminaries -- 3. Transition systems -- 4. Basic process theory -- 5. Recursion -- 6. Sequential processes -- 7. Parallel and communicating processes -- 8. Abstraction -- 9. Timing -- 10. Data and states -- 11. Features -- 12. Semantics Datenverarbeitung Parallel processing (Electronic computers) Electronic data processing / Distributed processing Prozess Informatik (DE-588)4235427-4 gnd Prozessalgebra (DE-588)4283920-8 gnd |
| subject_GND | (DE-588)4235427-4 (DE-588)4283920-8 |
| title | Process algebra equational theories of communicating processes |
| title_auth | Process algebra equational theories of communicating processes |
| title_exact_search | Process algebra equational theories of communicating processes |
| title_full | Process algebra equational theories of communicating processes J.C.M. Baeten, T. Basten, M.A. Raniers |
| title_fullStr | Process algebra equational theories of communicating processes J.C.M. Baeten, T. Basten, M.A. Raniers |
| title_full_unstemmed | Process algebra equational theories of communicating processes J.C.M. Baeten, T. Basten, M.A. Raniers |
| title_short | Process algebra |
| title_sort | process algebra equational theories of communicating processes |
| title_sub | equational theories of communicating processes |
| topic | Datenverarbeitung Parallel processing (Electronic computers) Electronic data processing / Distributed processing Prozess Informatik (DE-588)4235427-4 gnd Prozessalgebra (DE-588)4283920-8 gnd |
| topic_facet | Datenverarbeitung Parallel processing (Electronic computers) Electronic data processing / Distributed processing Prozess Informatik Prozessalgebra |
| url | https://doi.org/10.1017/CBO9781139195003 |
| work_keys_str_mv | AT baetenjcm processalgebraequationaltheoriesofcommunicatingprocesses AT bastenthomasgeertruidahenricus processalgebraequationaltheoriesofcommunicatingprocesses AT reniersma processalgebraequationaltheoriesofcommunicatingprocesses |