id: 05498129
dt: a
an: 05498129
au: Baldan, Paolo; Gadducci, Fabio
ti: Petri nets are dioids.
so: Meseguer, José (ed.) et al., Algebraic methodology and software
    technology. 12th international conference, AMAST 2008, Urbana, IL, USA,
    July 28‒31, 2008. Proceedings. Berlin: Springer (ISBN
    978-3-540-79979-5/pbk). Lecture Notes in Computer Science 5140, 51-66
    (2008).
py: 2008
pu: Berlin: Springer
la: EN
cc: 
ut: 
ci: 
li: doi:10.1007/978-3-540-79980-1_5
ab: Summary: In a seminal paper Montanari and Meseguer showed that an algebraic
    interpretation of Petri nets in terms of commutative monoids can be
    used to provide an elegant characterisation of the deterministic
    computations of a net, accounting for their sequential and parallel
    composition. Here we show that, along the same lines, by adding an
    (idempotent) operation and thus taking dioids (commutative semirings)
    rather than monoids, one can faithfully characterise the
    non-deterministic computations of a Petri net.
rv: