Your email was sent successfully. Check your inbox.

An error occurred while sending the email. Please try again.

Proceed reservation?

Export
Filter
Type of Medium
Language
Region
Years
Subjects(RVK)
Keywords
Access
  • 1
    Book
    Book
    Cambridge :Cambridge Univ. Press,
    UID:
    almafu_BV010122324
    Format: VIII, 244 S. : graph. Darst.
    Edition: 1. publ.
    ISBN: 0-521-46519-2
    Series Statement: Cambridge tracts in theoretical computer science 40
    Language: English
    Subjects: Computer Science
    RVK:
    RVK:
    Keywords: Petri-Netz ; Free-choice-Netz
    Author information: Esparza, Javier 1964-
    Author information: Desel, Jörg 1959-
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
  • 2
    Online Resource
    Online Resource
    Cambridge :Cambridge University Press,
    UID:
    almafu_9960117027802883
    Format: 1 online resource (viii, 244 pages) : , digital, PDF file(s).
    Edition: 1st pbk. version.
    ISBN: 0-511-52655-5
    Series Statement: Cambridge tracts in theoretical computer science ; 40
    Content: 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.
    Note: 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. , English
    Additional Edition: ISBN 0-521-01945-1
    Additional Edition: ISBN 0-521-46519-2
    Language: English
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
  • 3
    Online Resource
    Online Resource
    Cambridge : Cambridge University Press
    UID:
    gbv_883385767
    Format: 1 Online-Ressource (viii, 244 pages) , digital, PDF file(s)
    ISBN: 9780511526558
    Series Statement: Cambridge tracts in theoretical computer science 40
    Content: 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
    Content: 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
    Note: Title from publisher's bibliographic system (viewed on 05 Oct 2015)
    Additional Edition: ISBN 9780521465199
    Additional Edition: ISBN 9780521019453
    Additional Edition: Erscheint auch als Druck-Ausgabe ISBN 9780521465199
    Language: English
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
Did you mean 9780521265799?
Did you mean 9780521065191?
Did you mean 9780511565199?
Close ⊗
This website uses cookies and the analysis tool Matomo. Further information can be found on the KOBV privacy pages