## Concurrency and nets: advances in Petri nets"Concurrency and Nets" is a special volume in the series "Advances in Petri Nets." Prepared as a tribute to Carl Adam Petri on the occasion of his 60th birthday, it is devoted to an outstanding personality and his pioneering and fruitful scientific work. Part I (70 pages of over 600) presents the congratulatory addresses and invited talks that were given at an Anniversary Colloquium. The contributions of this part honor Carl Adam Petri and his work from many different perspectives. Part II is a collection of invited papers discussing various aspects of the theme Concurrency and Nets. These papers are contributed partly by researchers that were or are still associated with the Petri Institute at GMD and partly by researchers whose scientific work deals with Net Theory or related system models. The topics range from basic theoretical aspects to application oriented methods. |

### What people are saying - Write a review

We haven't found any reviews in the usual places.

### Contents

III MODELS AND SYSTEM SPECIFICATION | 34 |

EXAMPLE OF APPLICATIONS | 43 |

SUPPORT TOOLS | 58 |

Copyright | |

20 other sections not shown

### Other editions - View all

Concurrency and Nets: Advances in Petri Nets Klaus Voss,Hartmann J. Genrich,Grzegorz Rozenberg Limited preview - 2012 |

Concurrency and Nets: Advances in Petri Nets Klaus Voss,Hartmann J. Genrich,Grzegorz Rozenberg No preview available - 2011 |

### Common terms and phrases

abstract abstract data types algebra antichain Applications and Theory assume Bad Honnef basic basis role behaviour bisimulation C.A. Petri called Carl Adam Petri cell CHAOS communication disciplines Computer Science concepts concurrent systems consider cooperation corresponding COSY D-continuity deadlock defined Definition denote dependence graphs distributed distributor elements enabled equivalence equivalence relations example fact FIFO Figure finite firing formal formula free choice systems frozen token given global Hence implementation labelled language Lemma Let g LIFO live and safe logic macro minimal multiset Newcastle upon Tyne notation notion occurrence nets operation P/T-system P/Ta-nets path Petri nets poset possible Proof properties protocols reachable relation replicators represented result rules S-invariant semantics semilattice simulation SPEC specification speech acts Springer string strongly connected structure subset synchronic T-graph T-systems Theorem Theory of Petri totally ordered set transition trap variables