Free choice Petri nets

Petri nets are a popular and powerful formal model for the analysis and modelling of concurrent systems, and a rich theory has developed around them. Petri nets are taught to undergraduates, and also used by industrial practitioners. This book focuses on a particular class of petri nets, free choice...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
1. Verfasser: Desel, Jörg (VerfasserIn)
Format: Elektronisch E-Book
Sprache:English
Veröffentlicht: Cambridge Cambridge University Press 1995
Schriftenreihe:Cambridge tracts in theoretical computer science 40
Schlagworte:
Online-Zugang:DE-12
DE-92
URL des Erstveröffentlichers
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!

MARC

LEADER 00000nam a2200000zcb4500
001 BV043942381
003 DE-604
005 00000000000000.0
007 cr|uuu---uuuuu
008 161206s1995 xx o|||| 00||| eng d
020 |a 9780511526558  |c Online  |9 978-0-511-52655-8 
024 7 |a 10.1017/CBO9780511526558  |2 doi 
035 |a (ZDB-20-CBO)CR9780511526558 
035 |a (OCoLC)967602600 
035 |a (DE-599)BVBBV043942381 
040 |a DE-604  |b ger  |e rda 
041 0 |a eng 
049 |a DE-12  |a DE-92 
082 0 |a 511.5  |2 20 
084 |a ST 130  |0 (DE-625)143588:  |2 rvk 
084 |a ST 132  |0 (DE-625)143589:  |2 rvk 
100 1 |a Desel, Jörg  |e Verfasser  |4 aut 
245 1 0 |a Free choice Petri nets  |c Jörg Desel, Javier Esparza 
264 1 |a Cambridge  |b Cambridge University Press  |c 1995 
300 |a 1 online resource (viii, 244 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 40 
500 |a Title from publisher's bibliographic system (viewed on 05 Oct 2015) 
505 8 |a Introduction -- Analysis techniques for Petri nets -- S-systems and T-systems -- Liveness in free-choice systems -- The coverability theorems -- The rank theorem -- Reduction and synthesis -- Home markings -- Reachability and shortest sequences -- Generalizations 
520 |a Petri nets are a popular and powerful formal model for the analysis and modelling of concurrent systems, and a rich theory has developed around them. Petri nets are taught to undergraduates, and also used by industrial practitioners. This book focuses on a particular class of petri nets, free choice petri nets, which play a central role in the theory. The text is very clearly organised, with every notion carefully explained and every result proved. Clear exposition is given for place invariants, siphons, traps and many other important analysis techniques. The material is organised along the lines of a course book, and each chapter contains numerous exercises, making this book ideal for graduate students and research workers alike 
650 4 |a Petri nets 
650 0 7 |a Petri-Netz  |0 (DE-588)4045388-1  |2 gnd  |9 rswk-swf 
650 0 7 |a Free-choice-Netz  |0 (DE-588)4288878-5  |2 gnd  |9 rswk-swf 
689 0 0 |a Petri-Netz  |0 (DE-588)4045388-1  |D s 
689 0 1 |a Free-choice-Netz  |0 (DE-588)4288878-5  |D s 
689 0 |8 1\p  |5 DE-604 
700 1 |a Esparza, Javier  |e Sonstige  |4 oth 
776 0 8 |i Erscheint auch als  |n Druckausgabe  |z 978-0-521-01945-3 
776 0 8 |i Erscheint auch als  |n Druckausgabe  |z 978-0-521-46519-9 
856 4 0 |u https://doi.org/10.1017/CBO9780511526558  |x Verlag  |z URL des Erstveröffentlichers  |3 Volltext 
912 |a ZDB-20-CBO 
883 1 |8 1\p  |a cgwrk  |d 20201028  |q DE-101  |u https://d-nb.info/provenance/plan#cgwrk 
943 1 |a oai:aleph.bib-bvb.de:BVB01-029351351 
966 e |u https://doi.org/10.1017/CBO9780511526558  |l DE-12  |p ZDB-20-CBO  |q BSB_PDA_CBO  |x Verlag  |3 Volltext 
966 e |u https://doi.org/10.1017/CBO9780511526558  |l DE-92  |p ZDB-20-CBO  |q FHN_PDA_CBO  |x Verlag  |3 Volltext 

Datensatz im Suchindex

_version_ 1819298718370758656
any_adam_object
author Desel, Jörg
author_facet Desel, Jörg
author_role aut
author_sort Desel, Jörg
author_variant j d jd
building Verbundindex
bvnumber BV043942381
classification_rvk ST 130
ST 132
collection ZDB-20-CBO
contents Introduction -- Analysis techniques for Petri nets -- S-systems and T-systems -- Liveness in free-choice systems -- The coverability theorems -- The rank theorem -- Reduction and synthesis -- Home markings -- Reachability and shortest sequences -- Generalizations
ctrlnum (ZDB-20-CBO)CR9780511526558
(OCoLC)967602600
(DE-599)BVBBV043942381
dewey-full 511.5
dewey-hundreds 500 - Natural sciences and mathematics
dewey-ones 511 - General principles of mathematics
dewey-raw 511.5
dewey-search 511.5
dewey-sort 3511.5
dewey-tens 510 - Mathematics
discipline Informatik
Mathematik
doi_str_mv 10.1017/CBO9780511526558
format Electronic
eBook
fullrecord <?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>03056nam a2200529zcb4500</leader><controlfield tag="001">BV043942381</controlfield><controlfield tag="003">DE-604</controlfield><controlfield tag="005">00000000000000.0</controlfield><controlfield tag="007">cr|uuu---uuuuu</controlfield><controlfield tag="008">161206s1995 xx o|||| 00||| eng d</controlfield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">9780511526558</subfield><subfield code="c">Online</subfield><subfield code="9">978-0-511-52655-8</subfield></datafield><datafield tag="024" ind1="7" ind2=" "><subfield code="a">10.1017/CBO9780511526558</subfield><subfield code="2">doi</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(ZDB-20-CBO)CR9780511526558</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(OCoLC)967602600</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-599)BVBBV043942381</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">511.5</subfield><subfield code="2">20</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">Desel, Jörg</subfield><subfield code="e">Verfasser</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">Free choice Petri nets</subfield><subfield code="c">Jörg Desel, Javier Esparza</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="a">Cambridge</subfield><subfield code="b">Cambridge University Press</subfield><subfield code="c">1995</subfield></datafield><datafield tag="300" ind1=" " ind2=" "><subfield code="a">1 online resource (viii, 244 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">40</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">Introduction -- Analysis techniques for Petri nets -- S-systems and T-systems -- Liveness in free-choice systems -- The coverability theorems -- The rank theorem -- Reduction and synthesis -- Home markings -- Reachability and shortest sequences -- Generalizations</subfield></datafield><datafield tag="520" ind1=" " ind2=" "><subfield code="a">Petri nets are a popular and powerful formal model for the analysis and modelling of concurrent systems, and a rich theory has developed around them. Petri nets are taught to undergraduates, and also used by industrial practitioners. This book focuses on a particular class of petri nets, free choice petri nets, which play a central role in the theory. The text is very clearly organised, with every notion carefully explained and every result proved. Clear exposition is given for place invariants, siphons, traps and many other important analysis techniques. The material is organised along the lines of a course book, and each chapter contains numerous exercises, making this book ideal for graduate students and research workers alike</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Petri nets</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="650" ind1="0" ind2="7"><subfield code="a">Free-choice-Netz</subfield><subfield code="0">(DE-588)4288878-5</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">Free-choice-Netz</subfield><subfield code="0">(DE-588)4288878-5</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">Esparza, Javier</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-01945-3</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-46519-9</subfield></datafield><datafield tag="856" ind1="4" ind2="0"><subfield code="u">https://doi.org/10.1017/CBO9780511526558</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="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="943" ind1="1" ind2=" "><subfield code="a">oai:aleph.bib-bvb.de:BVB01-029351351</subfield></datafield><datafield tag="966" ind1="e" ind2=" "><subfield code="u">https://doi.org/10.1017/CBO9780511526558</subfield><subfield code="l">DE-12</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/CBO9780511526558</subfield><subfield code="l">DE-92</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.BV043942381
illustrated Not Illustrated
indexdate 2024-12-24T05:34:01Z
institution BVB
isbn 9780511526558
language English
oai_aleph_id oai:aleph.bib-bvb.de:BVB01-029351351
oclc_num 967602600
open_access_boolean
owner DE-12
DE-92
owner_facet DE-12
DE-92
physical 1 online resource (viii, 244 pages)
psigel ZDB-20-CBO
ZDB-20-CBO BSB_PDA_CBO
ZDB-20-CBO FHN_PDA_CBO
publishDate 1995
publishDateSearch 1995
publishDateSort 1995
publisher Cambridge University Press
record_format marc
series2 Cambridge tracts in theoretical computer science
spelling Desel, Jörg Verfasser aut
Free choice Petri nets Jörg Desel, Javier Esparza
Cambridge Cambridge University Press 1995
1 online resource (viii, 244 pages)
txt rdacontent
c rdamedia
cr rdacarrier
Cambridge tracts in theoretical computer science 40
Title from publisher's bibliographic system (viewed on 05 Oct 2015)
Introduction -- Analysis techniques for Petri nets -- S-systems and T-systems -- Liveness in free-choice systems -- The coverability theorems -- The rank theorem -- Reduction and synthesis -- Home markings -- Reachability and shortest sequences -- Generalizations
Petri nets are a popular and powerful formal model for the analysis and modelling of concurrent systems, and a rich theory has developed around them. Petri nets are taught to undergraduates, and also used by industrial practitioners. This book focuses on a particular class of petri nets, free choice petri nets, which play a central role in the theory. The text is very clearly organised, with every notion carefully explained and every result proved. Clear exposition is given for place invariants, siphons, traps and many other important analysis techniques. The material is organised along the lines of a course book, and each chapter contains numerous exercises, making this book ideal for graduate students and research workers alike
Petri nets
Petri-Netz (DE-588)4045388-1 gnd rswk-swf
Free-choice-Netz (DE-588)4288878-5 gnd rswk-swf
Petri-Netz (DE-588)4045388-1 s
Free-choice-Netz (DE-588)4288878-5 s
1\p DE-604
Esparza, Javier Sonstige oth
Erscheint auch als Druckausgabe 978-0-521-01945-3
Erscheint auch als Druckausgabe 978-0-521-46519-9
https://doi.org/10.1017/CBO9780511526558 Verlag URL des Erstveröffentlichers Volltext
1\p cgwrk 20201028 DE-101 https://d-nb.info/provenance/plan#cgwrk
spellingShingle Desel, Jörg
Free choice Petri nets
Introduction -- Analysis techniques for Petri nets -- S-systems and T-systems -- Liveness in free-choice systems -- The coverability theorems -- The rank theorem -- Reduction and synthesis -- Home markings -- Reachability and shortest sequences -- Generalizations
Petri nets
Petri-Netz (DE-588)4045388-1 gnd
Free-choice-Netz (DE-588)4288878-5 gnd
subject_GND (DE-588)4045388-1
(DE-588)4288878-5
title Free choice Petri nets
title_auth Free choice Petri nets
title_exact_search Free choice Petri nets
title_full Free choice Petri nets Jörg Desel, Javier Esparza
title_fullStr Free choice Petri nets Jörg Desel, Javier Esparza
title_full_unstemmed Free choice Petri nets Jörg Desel, Javier Esparza
title_short Free choice Petri nets
title_sort free choice petri nets
topic Petri nets
Petri-Netz (DE-588)4045388-1 gnd
Free-choice-Netz (DE-588)4288878-5 gnd
topic_facet Petri nets
Petri-Netz
Free-choice-Netz
url https://doi.org/10.1017/CBO9780511526558
work_keys_str_mv AT deseljorg freechoicepetrinets
AT esparzajavier freechoicepetrinets