Non-interference notions based on reveals and excludes relations for Petri nets

DOI10.1007/978-3-662-53401-4_3zbMATH Open1366.68200OpenAlexW2407994015MaRDI QIDQ5268427FDOQ5268427

Authors: Luca Bernardinello, G. Kılınç, Lucia Pomello 

Publication date: 20 June 2017

Published in: Transactions on Petri Nets and Other Models of Concurrency XI (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-662-53401-4_3

Recommendations

• Lectures on Concurrency and Petri Nets
• Structural non-interference in elementary and trace nets
• Non-interference by unfolding
• A causal view on non-interference
• On intransitive non-interference in some models of concurrency

zbMATH Keywords

Petri netsunfoldingnon-interferenceinformation flowexcludesreveals

Mathematics Subject Classification ID

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

Cites Work

• Branching processes of Petri nets
• Modelling opacity using Petri nets
• Title not available (Why is that?)
• Building occurrence nets from reveals relations
• Title not available (Why is that?)
• Non-interference by unfolding
• Deciding Selective Declassification of Petri Nets
• On intransitive non-interference in some models of concurrency
• Lectures on Concurrency and Petri Nets
• Applications and Theory of Petri Nets 2004
• Non-interference notions based on reveals and excludes relations for Petri nets

Cited In (4)

• Computing the reveals relation in occurrence nets
• Multilevel transitive and intransitive non-interference, causally
• Non-interference notions based on reveals and excludes relations for Petri nets
• Computing a parametric reveals relation for bounded equal-conflict Petri nets

This page was built for publication: Non-interference notions based on reveals and excludes relations for Petri nets

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