Persistent stochastic non-interference

DOI10.3233/FI-2021-2049OpenAlexW3178515540MaRDI QIDQ5158656FDOQ5158656

Authors Jane Hillston, Andrea Marin, Carla Piazza, Sabina Rossi 

Publication date 25 October 2021

Published in Fundamenta Informaticae (Search for Journal in Brave)

Full work available at URL https://doi.org/10.3233/fi-2021-2049

zbMATH Keywords

process algebrastochastic modelsnon-interference

Mathematics Subject Classification ID

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

Recommendations

• A General Framework for Nondeterministic, Probabilistic, and Stochastic Noninterference
• \textit{D\_PSNI}: delimited persistent stochastic non-interference
• scientific article; zbMATH DE number 1863164
• Foundations of Security Analysis and Design II
• Verifying persistent security properties

Cites Work

• scientific article; zbMATH DE number 1670837 (Why is no real title available?)
• scientific article; zbMATH DE number 1670841 (Why is no real title available?)
• scientific article; zbMATH DE number 3145626 (Why is no real title available?)
• scientific article; zbMATH DE number 42752 (Why is no real title available?)
• scientific article; zbMATH DE number 48139 (Why is no real title available?)
• scientific article; zbMATH DE number 1953033 (Why is no real title available?)
• scientific article; zbMATH DE number 1956549 (Why is no real title available?)
• scientific article; zbMATH DE number 1884409 (Why is no real title available?)
• A Compositional Approach to Performance Modelling
• A Compositional Semantics for Dynamic Fault Trees in Terms of Interactive Markov Chains
• A General Framework for Nondeterministic, Probabilistic, and Stochastic Noninterference
• A proof system for information flow security
• Bisimilarity Minimization in O(m logn) Time
• Comparative branching-time semantics for Markov chains
• Controlling information release in the \(\pi\)-calculus
• Finite representations of CCS and TCSP programs by automata and Petri nets
• Foundations of Software Science and Computational Structures
• Lumping-based equivalences in Markovian automata: algorithms and applications to product-form analyses
• On the relations between Markov chain lumpability and reversibility
• On the semantics of Markov automata
• Simple \(O(m \log n)\) time Markov chain lumping
• The Applied Pi Calculus
• Tools and Algorithms for the Construction and Analysis of Systems
• Unwinding Possibilistic Security Properties
• Unwinding biological systems
• Verifying persistent security properties

Cited In (7)

• Title not available (Why is no real title available?)
• \textit{D\_PSNI}: delimited persistent stochastic non-interference
• A Process Algebra for (Delimited) Persistent Stochastic Non-Interference
• Nondeterministic admissible interference
• Tools and Algorithms for the Construction and Analysis of Systems
• A General Framework for Nondeterministic, Probabilistic, and Stochastic Noninterference
• Branching bisimulation semantics enables noninterference analysis of reversible systems

This page was built for publication: Persistent stochastic non-interference

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