Opacity for linear constraint Markov chains

DOI10.1007/s10626-017-0259-4zbMath1384.93137OpenAlexW4298777366MaRDI QIDQ1745942

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

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)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Probabilistic opacity for Markov decision processes
• Maximizing entropy over Markov processes
• Constraint Markov chains
• The dining cryptographers problem: Unconditional sender and recipient untraceability
• Comparative branching-time semantics for Markov chains
• Current-State Opacity Formulations in Probabilistic Finite Automata
• Preserving Secrecy Under Refinement
• LTL Model Checking of Interval Markov Chains
• From Nondeterministic B\"uchi and Streett Automata to Deterministic Parity Automata
• Model-Checking ω-Regular Properties of Interval Markov Chains
• Quantifying opacity
• CONCUR 2005 – Concurrency Theory
• Tools and Algorithms for the Construction and Analysis of Systems