Merging Relations: A Way to Compact Petri Nets’ Behaviors Uniformly

DOI10.1007/978-3-319-53733-7_24zbMath1485.68157OpenAlexW2588650882MaRDI QIDQ5739008

G. Michele Pinna, Giovanni Casu

Publication date: 1 June 2017

Published in: Language and Automata Theory and Applications (Search for Journal in Brave)

Full work available at URL: http://hdl.handle.net/11584/211988

zbMATH Keywords

Petri netsevent structuresdata structure compression

Mathematics Subject Classification ID

Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85) Coding and information theory (compaction, compression, models of communication, encoding schemes, etc.) (aspects in computer science) (68P30) Data structures (68P05)

Related Items (3)

Unnamed Item ⋮ Spreading nets: a uniform approach to unfoldings ⋮ Unnamed Item

Cites Work

• Configuration structures, event structures and Petri nets
• Merged processes: a new condensed representation of Petri net behaviour
• Branching processes of Petri nets
• An improvement of McMillan's unfolding algorithm
• Trellis processes: a compact representation for runs of concurrent systems
• Understanding Petri Nets
• Flow Unfolding of Multi-clock Nets
• CONCUR 2005 – Concurrency Theory
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Merging Relations: A Way to Compact Petri Nets’ Behaviors Uniformly