CONCUR 2005 – Concurrency Theory

DOI10.1007/11539452zbMath1134.68426MaRDI QIDQ5897482

Mohit Bhargava, Catuscia Palamidessi

Publication date: 1 November 2006

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/11539452

Mathematics Subject Classification ID

68Q45: Formal languages and automata

94A60: Cryptography

68Q60: Specification and verification (program logics, model checking, etc.)

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

Related Items

Conditional Probabilities over Probabilistic and Nondeterministic Systems, Compositional Methods for Information-Hiding, Epistemic Strategies and Games on Concurrent Processes, Behavioural equivalences of a probabilistic pi-calculus, Maximizing entropy over Markov processes, Analyzing anonymity attacks through noisy channels, Information hiding in probabilistic concurrent systems, To know or not to know: Epistemic approaches to security protocol verification, Probabilistic and nondeterministic aspects of anonymity, Probable innocence revisited, Probabilistic anonymity via coalgebraic simulations, Making random choices invisible to the scheduler, Opacity for linear constraint Markov chains, Conditional anonymity with non-probabilistic adversary, Algorithmic probabilistic game semantics. Playing games with automata, Formalizing provable anonymity in Isabelle/HOL, Quantifying leakage in the presence of unreliable sources of information, Anonymity protocols as noisy channels, Weak Probabilistic Anonymity, Traces, Executions and Schedulers, Coalgebraically, Operational and Epistemic Approaches to Protocol Analysis: Bridging the Gap, Anonymity Protocols as Noisy Channels, A Framework for Automatically Checking Anonymity with μCRL, Analysing the MUTE Anonymous File-Sharing System Using the Pi-Calculus, Bisimulation for Demonic Schedulers