Structural non-interference in elementary and trace nets

DOI10.1017/S0960129509990120MaRDI QIDQ3655757zbMATH OpenFDO

Authors Nadia Busi, Roberto Gorrieri

Publication date 12 January 2010

Published in Mathematical Structures in Computer Science (Search for Journal in Brave)

Mathematics Subject Classification ID

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

Recommendations

• Applications and Theory of Petri Nets 2004
• Trace nets and conflict-free computations
• Strict nonblockingness of reduced shuffle‐exchange networks
• On Nonblocking Multiconnection Networks
• A lower bound on strictly non-blocking networks
• Publication:4515748
• On Interference Networks Over Finite Fields
• Partial Intersection Theorem and Flows in Abstract Networks
• On Nonblocking Multirate Interconnection Networks
• Mutex causality in processes and traces of general elementary nets

Cites work

• A Theory of Communicating Sequential Processes
• Trace nets and process automata

Cited in

(11)

• Interleaving vs True Concurrency: Some Instructive Security Examples
• An optimization-based approach to assess non-interference in labeled and bounded Petri net systems
• Lectures on Concurrency and Petri Nets
• Multilevel transitive and intransitive non-interference, causally
• Applications and Theory of Petri Nets 2004
• Non-interference notions based on reveals and excludes relations for Petri nets
• Non-interference by unfolding
• On intransitive non-interference in some models of concurrency
• A causal view on non-interference
• Concurrent hyperproperties
• Computing a parametric reveals relation for bounded equal-conflict Petri nets

This page was built for publication: Structural non-interference in elementary and trace nets

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