Computing a parametric reveals relation for bounded equal-conflict Petri nets

DOI10.1007/978-3-662-68191-6_3MaRDI QIDQ6550563zbMATH OpenFDO

Authors Federica Adobbati, Luca Bernardinello, Görkem Kılınç Soylu, Lucia Pomello

Publication date 5 June 2024

zbMATH Keywords

distributed systemsinformation flownoninterferencebounded equal-conflict Petri netsreveals relations

Mathematics Subject Classification ID

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

Recommendations

• Non-interference notions based on reveals and excludes relations for Petri nets
• Computing the reveals relation in occurrence nets
• Computing the reveals relation in occurrence nets
• Non-interference by unfolding
• Gained and Excluded Private Actions by Process Observations

Cites work

• scientific article; zbMATH DE number 4037216 (Why is no real title available?)
• A two-player asynchronous game on fully observable Petri nets
• An improvement of McMillan's unfolding algorithm
• Branching processes of Petri nets
• Building occurrence nets from reveals relations
• Concurrent and maximally concurrent evolution of nonsequential systems
• Free Choice Petri Nets
• Lectures on Concurrency and Petri Nets
• Non-interference by unfolding
• Non-interference notions based on reveals and excludes relations for Petri nets
• Noninterference Enforcement via Supervisory Control in Bounded Petri Nets
• Noninterference for concurrent programs and thread systems
• On the border of causality: contact and confusion
• Sequential and concurrent behaviour in Petri net theory
• Structural non-interference in elementary and trace nets
• The Petri net markup language
• The non-sequential behaviour of Petri nets
• Weak observable liveness and infinite games on finite graphs

This page was built for publication: Computing a parametric reveals relation for bounded equal-conflict Petri nets

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6550563)