Flow unfolding of multi-clock nets
From MaRDI portal
Recommendations
Cites work
- A technique of state space search based on unfolding
- An algorithm for direct construction of complete merged processes
- An improvement of McMillan's unfolding algorithm
- Branching processes of Petri nets
- Building occurrence nets from reveals relations
- Canonical prefixes of Petri net unfoldings
- Computing the reveals relation in occurrence nets
- Configuration structures, event structures and Petri nets
- Contextual Petri nets, asymmetric event structures, and processes
- Distributed monitoring of concurrent and asynchronous systems
- Domain and event structure semantics for Petri nets with read and inhibitor arcs
- Flow models of distributed computations: Three equivalent semantics for CCS
- How Much Is Worth to Remember? A Taxonomy Based on Petri Nets Unfoldings
- scientific article; zbMATH DE number 4018370 (Why is no real title available?)
- scientific article; zbMATH DE number 3885321 (Why is no real title available?)
- Merged processes: a new condensed representation of Petri net behaviour
- On the nature of events: another perspective in concurrency
- Petri nets, event structures and domains. I
- Trellis processes: a compact representation for runs of concurrent systems
Cited in
(5)
This page was built for publication: Flow unfolding of multi-clock nets
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5166763)