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

DOI10.1007/978-3-662-53401-4_3MaRDI QIDQ5268427zbMATH OpenOpenAlexFDO

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

zbMATH Keywords

excludesinformation flownon-interferencePetri netsrevealsunfolding

Mathematics Subject Classification ID

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

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

Cites work

• Applications and Theory of Petri Nets 2004
• Branching processes of Petri nets
• Building occurrence nets from reveals relations
• Deciding Selective Declassification of Petri Nets
• scientific article; zbMATH DE number 1884405 (Why is no real title available?)
• scientific article; zbMATH DE number 1884409 (Why is no real title available?)
• Lectures on Concurrency and Petri Nets
• Modelling opacity using Petri nets
• Non-interference by unfolding
• Non-interference notions based on reveals and excludes relations for Petri nets
• On intransitive non-interference in some models of concurrency

Cited in

(4)

• Multilevel transitive and intransitive non-interference, causally
• Computing the reveals relation in occurrence nets
• 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)