Opacity for linear constraint Markov chains

DOI10.1007/S10626-017-0259-4MaRDI QIDQ1745942zbMATH OpenOpenAlexFDO

Authors Béatrice Bérard, Olga Kouchnarenko, John Mullins, Mathieu Sassolas

Publication date 18 April 2018

Published in Discrete Event Dynamic Systems (Search for Journal in Brave)

Full work available at URL https://hal.sorbonne-universite.fr/hal-01384153/file/bkms-hal.pdf

zbMATH Keywords

Markov modelsrefinementspecificationopacity

Mathematics Subject Classification ID

Stochastic ordinary differential equations (aspects of stochastic analysis) (60H10) Linear systems in control theory (93C05) Stochastic systems in control theory (general) (93E03)

Recommendations

• Probabilistic opacity for Markov decision processes
• Quantifying opacity
• Probabilistic system opacity in discrete event systems
• Comparing the notions of opacity for discrete-event systems
• Opacity of discrete event systems and its applications

Cites work

• scientific article; zbMATH DE number 1017028 (Why is no real title available?)
• scientific article; zbMATH DE number 765034 (Why is no real title available?)
• scientific article; zbMATH DE number 5585443 (Why is no real title available?)
• CONCUR 2005 – Concurrency Theory
• Comparative branching-time semantics for Markov chains
• Consistency for parametric interval Markov chains
• Constraint Markov chains
• Current-State Opacity Formulations in Probabilistic Finite Automata
• From Nondeterministic B\"uchi and Streett Automata to Deterministic Parity Automata
• LTL model checking of interval Markov chains
• Maximizing entropy over Markov processes
• Model-Checking ω-Regular Properties of Interval Markov Chains
• Preserving Secrecy Under Refinement
• Probabilistic opacity for Markov decision processes
• Quantifying opacity
• The dining cryptographers problem: Unconditional sender and recipient untraceability
• Tools and Algorithms for the Construction and Analysis of Systems

Cited in

(3)

• Probabilistic opacity for Markov decision processes
• Concurrent secrets
• Probabilistic disclosure: maximisation vs. minimisation

This page was built for publication: Opacity for linear constraint Markov chains

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