Persistent Stochastic Non-Interference
From MaRDI portal
Publication:5158656
DOI10.3233/FI-2021-2049OpenAlexW3178515540MaRDI QIDQ5158656
Carla Piazza, Andrea Marin, Jane Hillston, 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
Related Items (1)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Finite representations of CCS and TCSP programs by automata and Petri nets
- Lumping-based equivalences in Markovian automata: algorithms and applications to product-form analyses
- Verifying persistent security properties
- On the semantics of Markov automata
- Unwinding biological systems
- Comparative branching-time semantics for Markov chains
- On the relations between Markov chain lumpability and reversibility
- Controlling information release in the \(\pi\)-calculus
- A Proof System for Information Flow Security
- The Applied Pi Calculus
- A General Framework for Nondeterministic, Probabilistic, and Stochastic Noninterference
- A Compositional Semantics for Dynamic Fault Trees in Terms of Interactive Markov Chains
- Simple O(m logn) Time Markov Chain Lumping
- Bisimilarity Minimization in O(m logn) Time
- Tools and Algorithms for the Construction and Analysis of Systems
- A Compositional Approach to Performance Modelling
- Foundations of Software Science and Computational Structures
- Unwinding Possibilistic Security Properties
This page was built for publication: Persistent Stochastic Non-Interference