scientific article; zbMATH DE number 3974312

From MaRDI portal
Publication:3740251





[For the entire collection see Zbl 0585.00010.] The semantics of Petri Nets is usually described in terms of firing sequences. But they disregard the nonsequential behaviour and thus the ultimate motivation of Petri nets. It is shown how step sequences and processes overcome these shortcomings and how all three execution models can be embedded into a uniform calculus of computations. The consideration of causal order instead of temporal order yields a more refined semantics, a clear distinction between determinism and nondeterminism for nonsequential systems, modified notions of fairness and a drastic reduction of the number of computations (executions) of a nonsequential system.




Cited in
(49)








This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3740251)