Process semantics of Petri nets over partial algebra

DOI10.1007/3-540-44988-4_10MaRDI QIDQ2766559zbMATH OpenFDO

Authors Jörg Desel, Gabriel Juhás, Robert Lorenz

Publication date 13 June 2002

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://opus.bibliothek.uni-augsburg.de/opus4/frontdoor/index/index/docId/56094

Mathematics Subject Classification ID

Semantics in the theory of computing (68Q55) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)

Recommendations

• On semantics of Petri nets over partial algebra
• Petri nets over partial algebra
• Partial-order process algebra (and its relation to Petri nets)
• scientific article; zbMATH DE number 3967922
• scientific article; zbMATH DE number 3980501
• scientific article; zbMATH DE number 997812
• An axiomatic characterization of algebras of processes of Petri nets
• scientific article; zbMATH DE number 5506906
• Petri nets and algebraic specifications
• scientific article; zbMATH DE number 803796

Cited in

(10)

• Petri net modules in the transformation-based component framework
• Process algebras for Petri nets. The alphabetization of distributed systems
• scientific article; zbMATH DE number 5506906 (Why is no real title available?)
• APC semantics for Petri nets
• Petri nets over partial algebra
• Two algebraic process semantics for contextual nets
• On semantics of Petri nets over partial algebra
• Unifying Petri nets with restricted occurrence rule using partial algebra
• Whole-grain Petri nets and processes
• Process versus unfolding semantics for Place/Transition Petri nets

This page was built for publication: Process semantics of Petri nets over partial algebra

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