scientific article; zbMATH DE number 3829262

MaRDI QIDQ3674068zbMATHFDO

Authors Ursula Goltz, Wolfgang Reisig

Publication date 1983

zbMATH Keywords

partially ordered setsdiscretenessPetri-netsnonsequential processesoccurrence netscut-finitenessK-densityplace/transitions-nets

Mathematics Subject Classification ID

Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)

Cited in

(10)

• Firing partial orders in a Petri net
• Petri nets, algebras, morphisms, and compositionality
• Synthesis and Analysis of Petri Nets from Causal Specifications
• Normalization of place/transition-systems preserves net behaviour
• Hasse Diagram Generators and Petri Nets
• Unifying Petri Net Semantics with Token Flows
• An algebra of concurrent non-deterministic processes
• Token trail semantics -- modeling behavior of Petri nets with labeled Petri nets
• Causality in bounded Petri nets is MSO definable
• Modeling Petri Nets by Local Action Systems1 1Partially supported by the EC TMR Network GETGRATS (General Theory of Graph Transformation Systems) and Esprit Working Group APPLIGRAPH through Universitaire Instelling Antwerpen.

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 Q3674068)