Synchronisationsgraphen

Genrich, Hartmann J.; Lautenbach, Kurt

doi:10.1007/bf00264027

Cited by 74 publications

(15 citation statements)

References 0 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…The notions of liveness and boundedness originated, to our knowledge, from the early work cited above [KM69,CHEP71,GL73]. Soon after these publications, Leslie Lamport coined the terminology of liveness versus safety properties in connection with program verification [Lam77].…”

Section: Bibliographical Remarks and Further Readingmentioning

confidence: 97%

“…Petri nets were conceived in [Pet62] and brought into the form presented in these notes, called the place/transition nets, by several research teams, prominent amongst whom were Hartmann Genrich, Amir Pnueli, et al [CHEP71,GL73]. Around the same time, a closely related model, the vector addition systems, was put forward and investigated by Richard Karp and others [KM69].…”

Section: Bibliographical Remarks and Further Readingmentioning

confidence: 98%

See 1 more Smart Citation

Structure Theory of Petri Nets

Best

Wimmel

2013

Lecture Notes in Computer Science

View full text Add to dashboard Cite

Abstract. The aim of this tutorial is to give a concise, but nonetheless not too narrow, overview of definitions and results pertaining centrally to Petri net structure theory. The Petri net model considered in these notes are the classical place/transition nets, as they have been defined in the First Advanced Course held in 1979 and originate back to the late Sixties. Structure theory asks what behavioural properties of a Petri net can be derived from its structural properties. Other aspects of Petri nets are neglected to a large extent in the present notes, such as various extensions and generalisations of central notions and results, as well as almost all algorithmic and complexity-theoretic consequences that accompany the structure-theoretic results. Because full proofs can easily be retrieved from the literature, they are not given, unless they are small and perhaps somewhat characteristic for Petri net oriented reasoning. Proof ideas are often sketched, however, and the sharpness of various results is accentuated by means of examples and counterexamples. A list for further reading is also provided.

show abstract

Section: Bibliographical Remarks and Further Readingmentioning

confidence: 97%

Section: Bibliographical Remarks and Further Readingmentioning

confidence: 98%

Structure Theory of Petri Nets

Best

Wimmel

2013

Lecture Notes in Computer Science

View full text Add to dashboard Cite

show abstract

“…This theorem can be generalised by dropping the strong connectedness assumptwn (see [17], (148) and (158)). However, we will not bother to do so, smce the chief mterest Js in strongly connected (i) L: as lwe.…”

Section: Theorem 43 Gharactensatwn Of the Llveness Of T-systems A T-mentioning

confidence: 96%

“…We shall say that a net (S, T, F) Is covered by (simple) cycles zff every x E S U T lies on some (simple) cycle The reader should be cautious With defimt10n 4 2, because It may occur that an element of a cycle has more than one F-predecessors (or successors) on the same cycle, and similarly for paths In cases of doubt, It may be advisable to mclude F-arrows that are meant to belong to the cycle or to the path expliCitly m the defimtion The last theorem can be generalised by droppmg the hveness assumptiOn, see [17], theorem (28S)…”

Section: Definition 42 Cycles and Pathsmentioning

confidence: 98%