Saved in:
Main Authors: | , , |
---|---|
Format: | Electronic eBook |
Language: | English |
Published: |
Berlin, Heidelberg
Springer Berlin Heidelberg
2001
|
Edition: | 1st ed. 2001 |
Series: | Monographs in Theoretical Computer Science. An EATCS Series
|
Subjects: | |
Links: | https://doi.org/10.1007/978-3-662-04457-5 https://doi.org/10.1007/978-3-662-04457-5 |
Summary: | This book presents a step-by-step development of a rigorous framework for the specification and verification of concurrent systems. Petri Net Algebra takes its inspiration and methods from Process Algebra and Petri Nets, two prominent branches of concurrency theory. Added synergistic benefit is derived from combining their respective advantages. Petri nets are treated as composable objects, and as such they are embedded in a general process algebra. On the other hand, a generic process algebra is given an automatic Petri net semantics so that net-based verification techniques, based on structural invariants and causal partial orders, can be applied to the process algebra. Finally, the theory is applied to a realistic concurrent programming language. The book contains full proofs, carefully chosen examples and several possible directions for further research. It is self-contained and supposes only acquaintance with basic discrete mathematics. A unique aspect is that the development of the Petri net algebra is handled so as to allow for further application-oriented extensions and modifications |
Physical Description: | 1 Online-Ressource (XI, 378 p) |
ISBN: | 9783662044575 |
DOI: | 10.1007/978-3-662-04457-5 |
Staff View
MARC
LEADER | 00000nam a2200000zc 4500 | ||
---|---|---|---|
001 | BV047064336 | ||
003 | DE-604 | ||
005 | 00000000000000.0 | ||
007 | cr|uuu---uuuuu | ||
008 | 201216s2001 xx o|||| 00||| eng d | ||
020 | |a 9783662044575 |9 978-3-662-04457-5 | ||
024 | 7 | |a 10.1007/978-3-662-04457-5 |2 doi | |
035 | |a (ZDB-2-SCS)978-3-662-04457-5 | ||
035 | |a (OCoLC)1227478595 | ||
035 | |a (DE-599)BVBBV047064336 | ||
040 | |a DE-604 |b ger |e aacr | ||
041 | 0 | |a eng | |
049 | |a DE-706 | ||
082 | 0 | |a 512 |2 23 | |
084 | |a ST 130 |0 (DE-625)143588: |2 rvk | ||
084 | |a ST 132 |0 (DE-625)143589: |2 rvk | ||
100 | 1 | |a Best, Eike |e Verfasser |4 aut | |
245 | 1 | 0 | |a Petri Net Algebra |c by Eike Best, Raymond Devillers, Maciej Koutny |
250 | |a 1st ed. 2001 | ||
264 | 1 | |a Berlin, Heidelberg |b Springer Berlin Heidelberg |c 2001 | |
300 | |a 1 Online-Ressource (XI, 378 p) | ||
336 | |b txt |2 rdacontent | ||
337 | |b c |2 rdamedia | ||
338 | |b cr |2 rdacarrier | ||
490 | 0 | |a Monographs in Theoretical Computer Science. An EATCS Series | |
520 | |a This book presents a step-by-step development of a rigorous framework for the specification and verification of concurrent systems. Petri Net Algebra takes its inspiration and methods from Process Algebra and Petri Nets, two prominent branches of concurrency theory. Added synergistic benefit is derived from combining their respective advantages. Petri nets are treated as composable objects, and as such they are embedded in a general process algebra. On the other hand, a generic process algebra is given an automatic Petri net semantics so that net-based verification techniques, based on structural invariants and causal partial orders, can be applied to the process algebra. Finally, the theory is applied to a realistic concurrent programming language. The book contains full proofs, carefully chosen examples and several possible directions for further research. It is self-contained and supposes only acquaintance with basic discrete mathematics. A unique aspect is that the development of the Petri net algebra is handled so as to allow for further application-oriented extensions and modifications | ||
650 | 4 | |a Algebra | |
650 | 4 | |a Logics and Meanings of Programs | |
650 | 4 | |a Computation by Abstract Devices | |
650 | 4 | |a Software Engineering | |
650 | 4 | |a Symbolic and Algebraic Manipulation | |
650 | 4 | |a Discrete Mathematics in Computer Science | |
650 | 4 | |a Algebra | |
650 | 4 | |a Computer logic | |
650 | 4 | |a Computers | |
650 | 4 | |a Software engineering | |
650 | 4 | |a Computer science—Mathematics | |
650 | 0 | 7 | |a Prozessalgebra |0 (DE-588)4283920-8 |2 gnd |9 rswk-swf |
650 | 0 | 7 | |a Petri-Netz |0 (DE-588)4045388-1 |2 gnd |9 rswk-swf |
689 | 0 | 0 | |a Petri-Netz |0 (DE-588)4045388-1 |D s |
689 | 0 | 1 | |a Prozessalgebra |0 (DE-588)4283920-8 |D s |
689 | 0 | |5 DE-604 | |
700 | 1 | |a Devillers, Raymond |4 aut | |
700 | 1 | |a Koutny, Maciej |4 aut | |
776 | 0 | 8 | |i Erscheint auch als |n Druck-Ausgabe |z 9783642086779 |
776 | 0 | 8 | |i Erscheint auch als |n Druck-Ausgabe |z 9783540673989 |
776 | 0 | 8 | |i Erscheint auch als |n Druck-Ausgabe |z 9783662044582 |
856 | 4 | 0 | |u https://doi.org/10.1007/978-3-662-04457-5 |x Verlag |z URL des Eerstveröffentlichers |3 Volltext |
912 | |a ZDB-2-SCS | ||
940 | 1 | |q ZDB-2-SCS_2000/2004 | |
943 | 1 | |a oai:aleph.bib-bvb.de:BVB01-032471448 | |
966 | e | |u https://doi.org/10.1007/978-3-662-04457-5 |l DE-706 |p ZDB-2-SCS |q ZDB-2-SCS_2000/2004 |x Verlag |3 Volltext |
Record in the Search Index
_version_ | 1818987567039643648 |
---|---|
any_adam_object | |
author | Best, Eike Devillers, Raymond Koutny, Maciej |
author_facet | Best, Eike Devillers, Raymond Koutny, Maciej |
author_role | aut aut aut |
author_sort | Best, Eike |
author_variant | e b eb r d rd m k mk |
building | Verbundindex |
bvnumber | BV047064336 |
classification_rvk | ST 130 ST 132 |
collection | ZDB-2-SCS |
ctrlnum | (ZDB-2-SCS)978-3-662-04457-5 (OCoLC)1227478595 (DE-599)BVBBV047064336 |
dewey-full | 512 |
dewey-hundreds | 500 - Natural sciences and mathematics |
dewey-ones | 512 - Algebra |
dewey-raw | 512 |
dewey-search | 512 |
dewey-sort | 3512 |
dewey-tens | 510 - Mathematics |
discipline | Informatik Mathematik |
doi_str_mv | 10.1007/978-3-662-04457-5 |
edition | 1st ed. 2001 |
format | Electronic eBook |
fullrecord | <?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>03437nam a2200649zc 4500</leader><controlfield tag="001">BV047064336</controlfield><controlfield tag="003">DE-604</controlfield><controlfield tag="005">00000000000000.0</controlfield><controlfield tag="007">cr|uuu---uuuuu</controlfield><controlfield tag="008">201216s2001 xx o|||| 00||| eng d</controlfield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">9783662044575</subfield><subfield code="9">978-3-662-04457-5</subfield></datafield><datafield tag="024" ind1="7" ind2=" "><subfield code="a">10.1007/978-3-662-04457-5</subfield><subfield code="2">doi</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(ZDB-2-SCS)978-3-662-04457-5</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(OCoLC)1227478595</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-599)BVBBV047064336</subfield></datafield><datafield tag="040" ind1=" " ind2=" "><subfield code="a">DE-604</subfield><subfield code="b">ger</subfield><subfield code="e">aacr</subfield></datafield><datafield tag="041" ind1="0" ind2=" "><subfield code="a">eng</subfield></datafield><datafield tag="049" ind1=" " ind2=" "><subfield code="a">DE-706</subfield></datafield><datafield tag="082" ind1="0" ind2=" "><subfield code="a">512</subfield><subfield code="2">23</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="084" ind1=" " ind2=" "><subfield code="a">ST 132</subfield><subfield code="0">(DE-625)143589:</subfield><subfield code="2">rvk</subfield></datafield><datafield tag="100" ind1="1" ind2=" "><subfield code="a">Best, Eike</subfield><subfield code="e">Verfasser</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">Petri Net Algebra</subfield><subfield code="c">by Eike Best, Raymond Devillers, Maciej Koutny</subfield></datafield><datafield tag="250" ind1=" " ind2=" "><subfield code="a">1st ed. 2001</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="a">Berlin, Heidelberg</subfield><subfield code="b">Springer Berlin Heidelberg</subfield><subfield code="c">2001</subfield></datafield><datafield tag="300" ind1=" " ind2=" "><subfield code="a">1 Online-Ressource (XI, 378 p)</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">Monographs in Theoretical Computer Science. An EATCS Series</subfield></datafield><datafield tag="520" ind1=" " ind2=" "><subfield code="a">This book presents a step-by-step development of a rigorous framework for the specification and verification of concurrent systems. Petri Net Algebra takes its inspiration and methods from Process Algebra and Petri Nets, two prominent branches of concurrency theory. Added synergistic benefit is derived from combining their respective advantages. Petri nets are treated as composable objects, and as such they are embedded in a general process algebra. On the other hand, a generic process algebra is given an automatic Petri net semantics so that net-based verification techniques, based on structural invariants and causal partial orders, can be applied to the process algebra. Finally, the theory is applied to a realistic concurrent programming language. The book contains full proofs, carefully chosen examples and several possible directions for further research. It is self-contained and supposes only acquaintance with basic discrete mathematics. A unique aspect is that the development of the Petri net algebra is handled so as to allow for further application-oriented extensions and modifications</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Algebra</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Logics and Meanings of Programs</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Computation by Abstract Devices</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Software Engineering</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Symbolic and Algebraic Manipulation</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Discrete Mathematics in Computer Science</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Algebra</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Computer logic</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Computers</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Software engineering</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Computer science—Mathematics</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="650" ind1="0" ind2="7"><subfield code="a">Petri-Netz</subfield><subfield code="0">(DE-588)4045388-1</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</subfield></datafield><datafield tag="689" ind1="0" ind2="0"><subfield code="a">Petri-Netz</subfield><subfield code="0">(DE-588)4045388-1</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="0" ind2="1"><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="5">DE-604</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Devillers, Raymond</subfield><subfield code="4">aut</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Koutny, Maciej</subfield><subfield code="4">aut</subfield></datafield><datafield tag="776" ind1="0" ind2="8"><subfield code="i">Erscheint auch als</subfield><subfield code="n">Druck-Ausgabe</subfield><subfield code="z">9783642086779</subfield></datafield><datafield tag="776" ind1="0" ind2="8"><subfield code="i">Erscheint auch als</subfield><subfield code="n">Druck-Ausgabe</subfield><subfield code="z">9783540673989</subfield></datafield><datafield tag="776" ind1="0" ind2="8"><subfield code="i">Erscheint auch als</subfield><subfield code="n">Druck-Ausgabe</subfield><subfield code="z">9783662044582</subfield></datafield><datafield tag="856" ind1="4" ind2="0"><subfield code="u">https://doi.org/10.1007/978-3-662-04457-5</subfield><subfield code="x">Verlag</subfield><subfield code="z">URL des Eerstveröffentlichers</subfield><subfield code="3">Volltext</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">ZDB-2-SCS</subfield></datafield><datafield tag="940" ind1="1" ind2=" "><subfield code="q">ZDB-2-SCS_2000/2004</subfield></datafield><datafield tag="943" ind1="1" ind2=" "><subfield code="a">oai:aleph.bib-bvb.de:BVB01-032471448</subfield></datafield><datafield tag="966" ind1="e" ind2=" "><subfield code="u">https://doi.org/10.1007/978-3-662-04457-5</subfield><subfield code="l">DE-706</subfield><subfield code="p">ZDB-2-SCS</subfield><subfield code="q">ZDB-2-SCS_2000/2004</subfield><subfield code="x">Verlag</subfield><subfield code="3">Volltext</subfield></datafield></record></collection> |
id | DE-604.BV047064336 |
illustrated | Not Illustrated |
indexdate | 2024-12-20T19:08:44Z |
institution | BVB |
isbn | 9783662044575 |
language | English |
oai_aleph_id | oai:aleph.bib-bvb.de:BVB01-032471448 |
oclc_num | 1227478595 |
open_access_boolean | |
owner | DE-706 |
owner_facet | DE-706 |
physical | 1 Online-Ressource (XI, 378 p) |
psigel | ZDB-2-SCS ZDB-2-SCS_2000/2004 ZDB-2-SCS ZDB-2-SCS_2000/2004 |
publishDate | 2001 |
publishDateSearch | 2001 |
publishDateSort | 2001 |
publisher | Springer Berlin Heidelberg |
record_format | marc |
series2 | Monographs in Theoretical Computer Science. An EATCS Series |
spelling | Best, Eike Verfasser aut Petri Net Algebra by Eike Best, Raymond Devillers, Maciej Koutny 1st ed. 2001 Berlin, Heidelberg Springer Berlin Heidelberg 2001 1 Online-Ressource (XI, 378 p) txt rdacontent c rdamedia cr rdacarrier Monographs in Theoretical Computer Science. An EATCS Series This book presents a step-by-step development of a rigorous framework for the specification and verification of concurrent systems. Petri Net Algebra takes its inspiration and methods from Process Algebra and Petri Nets, two prominent branches of concurrency theory. Added synergistic benefit is derived from combining their respective advantages. Petri nets are treated as composable objects, and as such they are embedded in a general process algebra. On the other hand, a generic process algebra is given an automatic Petri net semantics so that net-based verification techniques, based on structural invariants and causal partial orders, can be applied to the process algebra. Finally, the theory is applied to a realistic concurrent programming language. The book contains full proofs, carefully chosen examples and several possible directions for further research. It is self-contained and supposes only acquaintance with basic discrete mathematics. A unique aspect is that the development of the Petri net algebra is handled so as to allow for further application-oriented extensions and modifications Algebra Logics and Meanings of Programs Computation by Abstract Devices Software Engineering Symbolic and Algebraic Manipulation Discrete Mathematics in Computer Science Computer logic Computers Software engineering Computer science—Mathematics Prozessalgebra (DE-588)4283920-8 gnd rswk-swf Petri-Netz (DE-588)4045388-1 gnd rswk-swf Petri-Netz (DE-588)4045388-1 s Prozessalgebra (DE-588)4283920-8 s DE-604 Devillers, Raymond aut Koutny, Maciej aut Erscheint auch als Druck-Ausgabe 9783642086779 Erscheint auch als Druck-Ausgabe 9783540673989 Erscheint auch als Druck-Ausgabe 9783662044582 https://doi.org/10.1007/978-3-662-04457-5 Verlag URL des Eerstveröffentlichers Volltext |
spellingShingle | Best, Eike Devillers, Raymond Koutny, Maciej Petri Net Algebra Algebra Logics and Meanings of Programs Computation by Abstract Devices Software Engineering Symbolic and Algebraic Manipulation Discrete Mathematics in Computer Science Computer logic Computers Software engineering Computer science—Mathematics Prozessalgebra (DE-588)4283920-8 gnd Petri-Netz (DE-588)4045388-1 gnd |
subject_GND | (DE-588)4283920-8 (DE-588)4045388-1 |
title | Petri Net Algebra |
title_auth | Petri Net Algebra |
title_exact_search | Petri Net Algebra |
title_full | Petri Net Algebra by Eike Best, Raymond Devillers, Maciej Koutny |
title_fullStr | Petri Net Algebra by Eike Best, Raymond Devillers, Maciej Koutny |
title_full_unstemmed | Petri Net Algebra by Eike Best, Raymond Devillers, Maciej Koutny |
title_short | Petri Net Algebra |
title_sort | petri net algebra |
topic | Algebra Logics and Meanings of Programs Computation by Abstract Devices Software Engineering Symbolic and Algebraic Manipulation Discrete Mathematics in Computer Science Computer logic Computers Software engineering Computer science—Mathematics Prozessalgebra (DE-588)4283920-8 gnd Petri-Netz (DE-588)4045388-1 gnd |
topic_facet | Algebra Logics and Meanings of Programs Computation by Abstract Devices Software Engineering Symbolic and Algebraic Manipulation Discrete Mathematics in Computer Science Computer logic Computers Software engineering Computer science—Mathematics Prozessalgebra Petri-Netz |
url | https://doi.org/10.1007/978-3-662-04457-5 |
work_keys_str_mv | AT besteike petrinetalgebra AT devillersraymond petrinetalgebra AT koutnymaciej petrinetalgebra |