Toward a Uniform Approach to the Unfolding of Nets
Eric Fabre, G. Michele Pinna
Electronic Proceedings in Theoretical Computer Science · 2018
doi:10.4204/eptcs.279.5 (opens in a new tab)
We email you when a new notice or a question about this paper appears.
Abstract
In this paper we introduce the notion of spread net. Spread nets are (safe) Petri nets equipped with vector clocks on places and with ticking functions on transitions, and are such that vector clocks are consistent with the ticking of transitions. Such nets generalize previous families of nets like unfoldings, merged processes and trellis processes, and can thus be used to represent runs of a net in a true concurrency semantics through an operation called the spreading of a net. By contrast with previous constructions, which may identify conflicts, spread nets allow loops in time
Abstract licence: CC BY-NC-ND
References16
16 more references, whose wording the paper’s licence keeps private.
Reads
Read by people on this page
None yet.
Checked or read by AI through naulon
None yet.
A person counts once a day per paper. We keep no cookie and no address: a reader is a hash that changes every day. Any month under five reads shows no number.
Are you an author?
Is this your paper?
Claim it to add your note and be paid when agents cite it. Free.