Handbook of process algebra:
Process Algebra is a formal description technique for complex computer systems, especially those involving communicating, concurrently executing components. It is a subject that concurrently touches many topic areas of computer science and discrete math, including system design notations, logic, con...
Gespeichert in:
| Format: | Elektronisch E-Book |
|---|---|
| Sprache: | English |
| Veröffentlicht: |
Amsterdam New York
Elsevier
2001
|
| Ausgabe: | 1st ed |
| Schlagworte: | |
| Online-Zugang: | FLA01 Volltext |
| Zusammenfassung: | Process Algebra is a formal description technique for complex computer systems, especially those involving communicating, concurrently executing components. It is a subject that concurrently touches many topic areas of computer science and discrete math, including system design notations, logic, concurrency theory, specification and verification, operational semantics, algorithms, complexity theory, and, of course, algebra. This Handbook documents the fate of process algebra since its inception in the late 1970's to the present. It is intended to serve as a reference source for researchers, students, and system designers and engineers interested in either the theory of process algebra or in learning what process algebra brings to the table as a formal system description and verification technique. The Handbook is divided into six parts spanning a total of 19 self-contained Chapters. The organization is as follows. Part 1, consisting of four chapters, covers a broad swath of the basic theory of process algebra. Part 2 contains two chapters devoted to the sub-specialization of process algebra known as finite-state processes, while the three chapters of Part 3 look at infinite-state processes, value-passing processes and mobile processes in particular. Part 4, also three chapters in length, explores several extensions to process algebra including real-time, probability and priority. The four chapters of Part 5 examine non-interleaving process algebras, while Part 6's three chapters address process-algebra tools and applications |
| Beschreibung: | Includes bibliographical references and indexes |
| Beschreibung: | 1 online resource (xiv, 1342 pages) illustrations |
| ISBN: | 9780444828309 0444828303 9780080533674 0080533671 |
Internformat
MARC
| LEADER | 00000nmm a2200000zc 4500 | ||
|---|---|---|---|
| 001 | BV046123632 | ||
| 003 | DE-604 | ||
| 005 | 00000000000000.0 | ||
| 007 | cr|uuu---uuuuu | ||
| 008 | 190827s2001 |||| o||u| ||||||eng d | ||
| 020 | |a 9780444828309 |9 978-0-444-82830-9 | ||
| 020 | |a 0444828303 |9 0-444-82830-3 | ||
| 020 | |a 9780080533674 |9 978-0-08-053367-4 | ||
| 020 | |a 0080533671 |9 0-08-053367-1 | ||
| 035 | |a (ZDB-33-ESD)ocn162131201 | ||
| 035 | |a (OCoLC)162131201 | ||
| 035 | |a (DE-599)BVBBV046123632 | ||
| 040 | |a DE-604 |b ger |e rda | ||
| 041 | 0 | |a eng | |
| 082 | 0 | |a 511.3 |2 22 | |
| 245 | 1 | 0 | |a Handbook of process algebra |c edited by J.A. Bergstra, A. Ponse, S.A. Smolka |
| 250 | |a 1st ed | ||
| 264 | 1 | |a Amsterdam |a New York |b Elsevier |c 2001 | |
| 300 | |a 1 online resource (xiv, 1342 pages) |b illustrations | ||
| 336 | |b txt |2 rdacontent | ||
| 337 | |b c |2 rdamedia | ||
| 338 | |b cr |2 rdacarrier | ||
| 500 | |a Includes bibliographical references and indexes | ||
| 520 | |a Process Algebra is a formal description technique for complex computer systems, especially those involving communicating, concurrently executing components. It is a subject that concurrently touches many topic areas of computer science and discrete math, including system design notations, logic, concurrency theory, specification and verification, operational semantics, algorithms, complexity theory, and, of course, algebra. This Handbook documents the fate of process algebra since its inception in the late 1970's to the present. It is intended to serve as a reference source for researchers, students, and system designers and engineers interested in either the theory of process algebra or in learning what process algebra brings to the table as a formal system description and verification technique. The Handbook is divided into six parts spanning a total of 19 self-contained Chapters. The organization is as follows. Part 1, consisting of four chapters, covers a broad swath of the basic theory of process algebra. Part 2 contains two chapters devoted to the sub-specialization of process algebra known as finite-state processes, while the three chapters of Part 3 look at infinite-state processes, value-passing processes and mobile processes in particular. Part 4, also three chapters in length, explores several extensions to process algebra including real-time, probability and priority. The four chapters of Part 5 examine non-interleaving process algebras, while Part 6's three chapters address process-algebra tools and applications | ||
| 650 | 4 | |a Automates mathématiques, Théorie des | |
| 650 | 4 | |a Parallélisme (Informatique) | |
| 650 | 7 | |a MATHEMATICS / Infinity |2 bisacsh | |
| 650 | 7 | |a MATHEMATICS / Logic |2 bisacsh | |
| 650 | 7 | |a Machine theory |2 fast | |
| 650 | 7 | |a Parallel processing (Electronic computers) |2 fast | |
| 650 | 7 | |a Prozessalgebra |2 gnd | |
| 650 | 7 | |a Técnicas de programação |2 larpcal | |
| 650 | 4 | |a Machine theory | |
| 650 | 4 | |a Parallel processing (Electronic computers) | |
| 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 | |
| 700 | 1 | |a Bergstra, J. A. |e Sonstige |4 oth | |
| 700 | 1 | |a Ponse, A. |d 1955- |e Sonstige |4 oth | |
| 700 | 1 | |a Smolka, Scott A. |e Sonstige |4 oth | |
| 856 | 4 | 0 | |u http://www.sciencedirect.com/science/book/9780444828309 |x Verlag |z URL des Erstveröffentlichers |3 Volltext |
| 912 | |a ZDB-33-ESD | ||
| 999 | |a oai:aleph.bib-bvb.de:BVB01-031504085 | ||
| 883 | 1 | |8 1\p |a cgwrk |d 20201028 |q DE-101 |u https://d-nb.info/provenance/plan#cgwrk | |
| 966 | e | |u http://www.sciencedirect.com/science/book/9780444828309 |l FLA01 |p ZDB-33-ESD |q FLA_PDA_ESD |x Verlag |3 Volltext | |
Datensatz im Suchindex
| _version_ | 1804180440792170496 |
|---|---|
| any_adam_object | |
| building | Verbundindex |
| bvnumber | BV046123632 |
| collection | ZDB-33-ESD |
| ctrlnum | (ZDB-33-ESD)ocn162131201 (OCoLC)162131201 (DE-599)BVBBV046123632 |
| dewey-full | 511.3 |
| dewey-hundreds | 500 - Natural sciences and mathematics |
| dewey-ones | 511 - General principles of mathematics |
| dewey-raw | 511.3 |
| dewey-search | 511.3 |
| dewey-sort | 3511.3 |
| dewey-tens | 510 - Mathematics |
| discipline | Mathematik |
| edition | 1st ed |
| format | Electronic eBook |
| fullrecord | <?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>03679nmm a2200565zc 4500</leader><controlfield tag="001">BV046123632</controlfield><controlfield tag="003">DE-604</controlfield><controlfield tag="005">00000000000000.0</controlfield><controlfield tag="007">cr|uuu---uuuuu</controlfield><controlfield tag="008">190827s2001 |||| o||u| ||||||eng d</controlfield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">9780444828309</subfield><subfield code="9">978-0-444-82830-9</subfield></datafield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">0444828303</subfield><subfield code="9">0-444-82830-3</subfield></datafield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">9780080533674</subfield><subfield code="9">978-0-08-053367-4</subfield></datafield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">0080533671</subfield><subfield code="9">0-08-053367-1</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(ZDB-33-ESD)ocn162131201</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(OCoLC)162131201</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-599)BVBBV046123632</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="082" ind1="0" ind2=" "><subfield code="a">511.3</subfield><subfield code="2">22</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">Handbook of process algebra</subfield><subfield code="c">edited by J.A. Bergstra, A. Ponse, S.A. Smolka</subfield></datafield><datafield tag="250" ind1=" " ind2=" "><subfield code="a">1st ed</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="a">Amsterdam</subfield><subfield code="a">New York</subfield><subfield code="b">Elsevier</subfield><subfield code="c">2001</subfield></datafield><datafield tag="300" ind1=" " ind2=" "><subfield code="a">1 online resource (xiv, 1342 pages)</subfield><subfield code="b">illustrations</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="500" ind1=" " ind2=" "><subfield code="a">Includes bibliographical references and indexes</subfield></datafield><datafield tag="520" ind1=" " ind2=" "><subfield code="a">Process Algebra is a formal description technique for complex computer systems, especially those involving communicating, concurrently executing components. It is a subject that concurrently touches many topic areas of computer science and discrete math, including system design notations, logic, concurrency theory, specification and verification, operational semantics, algorithms, complexity theory, and, of course, algebra. This Handbook documents the fate of process algebra since its inception in the late 1970's to the present. It is intended to serve as a reference source for researchers, students, and system designers and engineers interested in either the theory of process algebra or in learning what process algebra brings to the table as a formal system description and verification technique. The Handbook is divided into six parts spanning a total of 19 self-contained Chapters. The organization is as follows. Part 1, consisting of four chapters, covers a broad swath of the basic theory of process algebra. Part 2 contains two chapters devoted to the sub-specialization of process algebra known as finite-state processes, while the three chapters of Part 3 look at infinite-state processes, value-passing processes and mobile processes in particular. Part 4, also three chapters in length, explores several extensions to process algebra including real-time, probability and priority. The four chapters of Part 5 examine non-interleaving process algebras, while Part 6's three chapters address process-algebra tools and applications</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Automates mathématiques, Théorie des</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Parallélisme (Informatique)</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">MATHEMATICS / Infinity</subfield><subfield code="2">bisacsh</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">MATHEMATICS / Logic</subfield><subfield code="2">bisacsh</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">Machine theory</subfield><subfield code="2">fast</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">Parallel processing (Electronic computers)</subfield><subfield code="2">fast</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">Prozessalgebra</subfield><subfield code="2">gnd</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">Técnicas de programação</subfield><subfield code="2">larpcal</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Machine theory</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Parallel processing (Electronic computers)</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="700" ind1="1" ind2=" "><subfield code="a">Bergstra, J. A.</subfield><subfield code="e">Sonstige</subfield><subfield code="4">oth</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Ponse, A.</subfield><subfield code="d">1955-</subfield><subfield code="e">Sonstige</subfield><subfield code="4">oth</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Smolka, Scott A.</subfield><subfield code="e">Sonstige</subfield><subfield code="4">oth</subfield></datafield><datafield tag="856" ind1="4" ind2="0"><subfield code="u">http://www.sciencedirect.com/science/book/9780444828309</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-33-ESD</subfield></datafield><datafield tag="999" ind1=" " ind2=" "><subfield code="a">oai:aleph.bib-bvb.de:BVB01-031504085</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="966" ind1="e" ind2=" "><subfield code="u">http://www.sciencedirect.com/science/book/9780444828309</subfield><subfield code="l">FLA01</subfield><subfield code="p">ZDB-33-ESD</subfield><subfield code="q">FLA_PDA_ESD</subfield><subfield code="x">Verlag</subfield><subfield code="3">Volltext</subfield></datafield></record></collection> |
| id | DE-604.BV046123632 |
| illustrated | Illustrated |
| indexdate | 2024-07-10T08:35:48Z |
| institution | BVB |
| isbn | 9780444828309 0444828303 9780080533674 0080533671 |
| language | English |
| oai_aleph_id | oai:aleph.bib-bvb.de:BVB01-031504085 |
| oclc_num | 162131201 |
| open_access_boolean | |
| physical | 1 online resource (xiv, 1342 pages) illustrations |
| psigel | ZDB-33-ESD ZDB-33-ESD FLA_PDA_ESD |
| publishDate | 2001 |
| publishDateSearch | 2001 |
| publishDateSort | 2001 |
| publisher | Elsevier |
| record_format | marc |
| spelling | Handbook of process algebra edited by J.A. Bergstra, A. Ponse, S.A. Smolka 1st ed Amsterdam New York Elsevier 2001 1 online resource (xiv, 1342 pages) illustrations txt rdacontent c rdamedia cr rdacarrier Includes bibliographical references and indexes Process Algebra is a formal description technique for complex computer systems, especially those involving communicating, concurrently executing components. It is a subject that concurrently touches many topic areas of computer science and discrete math, including system design notations, logic, concurrency theory, specification and verification, operational semantics, algorithms, complexity theory, and, of course, algebra. This Handbook documents the fate of process algebra since its inception in the late 1970's to the present. It is intended to serve as a reference source for researchers, students, and system designers and engineers interested in either the theory of process algebra or in learning what process algebra brings to the table as a formal system description and verification technique. The Handbook is divided into six parts spanning a total of 19 self-contained Chapters. The organization is as follows. Part 1, consisting of four chapters, covers a broad swath of the basic theory of process algebra. Part 2 contains two chapters devoted to the sub-specialization of process algebra known as finite-state processes, while the three chapters of Part 3 look at infinite-state processes, value-passing processes and mobile processes in particular. Part 4, also three chapters in length, explores several extensions to process algebra including real-time, probability and priority. The four chapters of Part 5 examine non-interleaving process algebras, while Part 6's three chapters address process-algebra tools and applications Automates mathématiques, Théorie des Parallélisme (Informatique) MATHEMATICS / Infinity bisacsh MATHEMATICS / Logic bisacsh Machine theory fast Parallel processing (Electronic computers) fast Prozessalgebra gnd Técnicas de programação larpcal Machine theory Parallel processing (Electronic computers) Prozessalgebra (DE-588)4283920-8 gnd rswk-swf Prozessalgebra (DE-588)4283920-8 s 1\p DE-604 Bergstra, J. A. Sonstige oth Ponse, A. 1955- Sonstige oth Smolka, Scott A. Sonstige oth http://www.sciencedirect.com/science/book/9780444828309 Verlag URL des Erstveröffentlichers Volltext 1\p cgwrk 20201028 DE-101 https://d-nb.info/provenance/plan#cgwrk |
| spellingShingle | Handbook of process algebra Automates mathématiques, Théorie des Parallélisme (Informatique) MATHEMATICS / Infinity bisacsh MATHEMATICS / Logic bisacsh Machine theory fast Parallel processing (Electronic computers) fast Prozessalgebra gnd Técnicas de programação larpcal Machine theory Parallel processing (Electronic computers) Prozessalgebra (DE-588)4283920-8 gnd |
| subject_GND | (DE-588)4283920-8 |
| title | Handbook of process algebra |
| title_auth | Handbook of process algebra |
| title_exact_search | Handbook of process algebra |
| title_full | Handbook of process algebra edited by J.A. Bergstra, A. Ponse, S.A. Smolka |
| title_fullStr | Handbook of process algebra edited by J.A. Bergstra, A. Ponse, S.A. Smolka |
| title_full_unstemmed | Handbook of process algebra edited by J.A. Bergstra, A. Ponse, S.A. Smolka |
| title_short | Handbook of process algebra |
| title_sort | handbook of process algebra |
| topic | Automates mathématiques, Théorie des Parallélisme (Informatique) MATHEMATICS / Infinity bisacsh MATHEMATICS / Logic bisacsh Machine theory fast Parallel processing (Electronic computers) fast Prozessalgebra gnd Técnicas de programação larpcal Machine theory Parallel processing (Electronic computers) Prozessalgebra (DE-588)4283920-8 gnd |
| topic_facet | Automates mathématiques, Théorie des Parallélisme (Informatique) MATHEMATICS / Infinity MATHEMATICS / Logic Machine theory Parallel processing (Electronic computers) Prozessalgebra Técnicas de programação |
| url | http://www.sciencedirect.com/science/book/9780444828309 |
| work_keys_str_mv | AT bergstraja handbookofprocessalgebra AT ponsea handbookofprocessalgebra AT smolkascotta handbookofprocessalgebra |