Petri Nets Are Dioids

DOI10.1007/978-3-540-79980-1_5zbMath1170.68536OpenAlexW1510224187MaRDI QIDQ5505415

Fabio Gadducci, Paolo Baldan

Publication date: 27 January 2009

Published in: Algebraic Methodology and Software Technology (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-540-79980-1_5

Mathematics Subject Classification ID

Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85) Semirings (16Y60)

Related Items (2)

Dioid partitions of groups ⋮ Petri nets are dioids: a new algebraic foundation for non-deterministic net theory

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• An axiomatization of the algebra of Petri net concatenable processes
• Petri nets are monoids
• Branching processes of Petri nets
• Normal forms for algebras of connections.
• Axiomatizing the algebra of net computations and processes
• The non-sequential behaviour of Petri nets
• FROM PETRI NETS TO LINEAR LOGIC THROUGH CATEGORIES: A SURVEY
• An axiomatization of the category of Petri net computations

This page was built for publication: Petri Nets Are Dioids