Flow Unfolding of Multi-clock Nets

DOI10.1007/978-3-319-07734-5_10zbMath1410.68248OpenAlexW16158588MaRDI QIDQ5166763

G. Michele Pinna, Giovanni Casu

Publication date: 8 July 2014

Published in: Application and Theory of Petri Nets and Concurrency (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-319-07734-5_10

Mathematics Subject Classification ID

Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)

Related Items (4)

Unnamed Item ⋮ Spreading nets: a uniform approach to unfoldings ⋮ Merging Relations: A Way to Compact Petri Nets’ Behaviors Uniformly ⋮ A Petri net view of covalent bonds

Cites Work

• Unnamed Item
• Unnamed Item
• Computing the reveals relation in occurrence nets
• On the nature of events: another perspective in concurrency
• 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
• Flow models of distributed computations: Three equivalent semantics for CCS
• A technique of state space search based on unfolding
• An improvement of McMillan's unfolding algorithm
• Distributed monitoring of concurrent and asynchronous systems
• 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
• Trellis processes: a compact representation for runs of concurrent systems
• An Algorithm for Direct Construction of Complete Merged Processes
• How Much Is Worth to Remember? A Taxonomy Based on Petri Nets Unfoldings
• Building Occurrence Nets from Reveals Relations

This page was built for publication: Flow Unfolding of Multi-clock Nets