Petri nets are dioids: a new algebraic foundation for non-deterministic net theory
type: Item
instance of: scholarly article
title: Petri nets are dioids: a new algebraic foundation for non-deterministic net theory
zbMATH Open document ID: 1417.68114
author: Paolo Baldan
author: Fabio Gadducci
published in: Acta Informatica
publication date: 2019-01-25T00:00:00Z
review text: In this paper, the approach of \textit{J. Meseguer} and \textit{U. Montanari} given in the seminal paper [Inf. Comput. 88, No. 2, 105--155 (1990; Zbl 0711.68077)] is generalized from deterministic computations of Petri nets to nondeterministic ones. Formally, the algebraic interpretation of Petri nets in terms of commutative monoids is replaced by dioids (idempotent semirings) by adding an idempotent operation for characterizing nondeterministic computations of Petri nets.
reviewed by: Jörg Desel
Mathematics Subject Classification ID: 68Q85
Mathematics Subject Classification ID: 18B20
Mathematics Subject Classification ID: 68Q10
zbMATH DE Number: 7006682
zbMATH Keywords: Petri nets
zbMATH Keywords: algebraic interpretation of Petri net computations
MaRDI profile type: Publication
full work available at URL: s00236-018-0314-0
OpenAlex ID: W2787060132
cites work: Asynchronous Traces and Open Petri Nets
cites work: Recent Trends in Algebraic Development Techniques
cites work: Petri Nets Are Dioids
cites work: Rewriting modulo symmetric monoidal structure
cites work: Full abstraction for signal flow graphs
cites work: Normal forms for algebras of connections.
cites work: Functorial models for Petri nets
cites work: An algebraic presentation of term graphs, via gs-monoidal categories
cites work: A functorial semantics for multi-algebras and partial algebras, with applications to syntax.
cites work: Q3210197
cites work: Axiomatizing the algebra of net computations and processes
cites work: Branching processes of Petri nets
cites work: Unfoldings: A partial-order approach to model checking.
cites work: Q4219030
cites work: The non-sequential behaviour of Petri nets
cites work: Process algebras for Petri nets. The alphabetization of distributed systems
cites work: From reversible to irreversible computations
cites work: Q4520820
cites work: On the category of props
cites work: Traced monoidal categories
cites work: Q3156500
cites work: Q5655528
cites work: Q5639839
cites work: FROM PETRI NETS TO LINEAR LOGIC THROUGH CATEGORIES: A SURVEY
cites work: The construction of $E_{\infty}$ ring spaces from bipermutative categories
cites work: Petri nets are monoids
cites work: The Space and Motion of Communicating Agents
cites work: Petri nets, event structures and domains. I
cites work: Q3219122
cites work: The \(\pi\)-calculus: A theory of mobile processes
cites work: An axiomatization of the category of Petri net computations
cites work: A Survey of Graphical Languages for Monoidal Categories
cites work: Reaction and control I. Mixing additive and multiplicative network algebras
cites work: Q4492940
cites work: Petri nets: applications and relationships to other models of concurrency. Advances in Petri nets 1986, Part II. Proceedings of an advanced course, Bad Honnef, September 8--19, 1986
DOI: 10.1007/S00236-018-0314-0
description: scientific article; zbMATH DE number 7006682