Spreading nets: a uniform approach to unfoldings
From MaRDI portal
Publication:1987731
DOI10.1016/j.jlamp.2020.100526zbMath1433.68258OpenAlexW3006480059MaRDI QIDQ1987731
Publication date: 15 April 2020
Published in: Journal of Logical and Algebraic Methods in Programming (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.jlamp.2020.100526
Related Items
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Computing the reveals relation in occurrence nets
- Configuration structures, event structures and Petri nets
- Merged processes: a new condensed representation of Petri net behaviour
- Petri nets, event structures and domains. I
- Branching processes of Petri nets
- An improvement of McMillan's unfolding algorithm
- Contextual Petri nets, asymmetric event structures, and processes
- Domain and event structure semantics for Petri nets with read and inhibitor arcs
- Canonical prefixes of Petri net unfoldings
- Axiomatizing the algebra of net computations and processes
- Trellis processes: a compact representation for runs of concurrent systems
- How Much Is Worth to Remember? A Taxonomy Based on Petri Nets Unfoldings
- The non-sequential behaviour of Petri nets
- Continuous Lattices and Domains
- Flow Unfolding of Multi-clock Nets
- Building Occurrence Nets from Reveals Relations
- Merging Relations: A Way to Compact Petri Nets’ Behaviors Uniformly
- CONCUR 2005 – Concurrency Theory