Three partition refinement algorithms
SIAM Journal on Computing
The dining cryptographers problem: unconditional sender and recipient untraceability
Journal of Cryptology
CCS expressions finite state processes, and three problems of equivalence
Information and Computation
Bisimulation through probabilistic testing
Information and Computation
From ATP to timed graphs and hybrid systems
Acta Informatica
Theoretical Computer Science
Symbolic model checking for real-time systems
Information and Computation
Forward and backward simulations II.: timing-based systems
Information and Computation
A compositional approach to performance modelling
A compositional approach to performance modelling
Modeling and verification of randomized distributed real-time systems
Modeling and verification of randomized distributed real-time systems
Time-abstracted bisimulation: implicit specifications and decidability
Information and Computation
Theoretical Computer Science
Crowds: anonymity for Web transactions
ACM Transactions on Information and System Security (TISSEC)
Stochastic process algebras—between LOTOS and Markov chains
Computer Networks and ISDN Systems - Special issue: trends in formal description techniques
Communication and Concurrency
Automatic verification of real-time systems with discrete probability distributions
Theoretical Computer Science
On probabilistic timed automata
Theoretical Computer Science
An Asynchronous Algebra with Multiple Clocks
ESOP '94 Proceedings of the 5th European Symposium on Programming: Programming Languages and Systems
The Metric Analogue of Weak Bisimulation for Probabilistic Processes
LICS '02 Proceedings of the 17th Annual IEEE Symposium on Logic in Computer Science
Towards Quantitative Verification of Probabilistic Transition Systems
ICALP '01 Proceedings of the 28th International Colloquium on Automata, Languages and Programming,
Automatic Synthesis of Real Time Systems
ICALP '95 Proceedings of the 22nd International Colloquium on Automata, Languages and Programming
On Discretization of Delays in Timed Automata and Digital Circuits
CONCUR '98 Proceedings of the 9th International Conference on Concurrency Theory
Weak Bisimulation for Probabilistic Systems
CONCUR '00 Proceedings of the 11th International Conference on Concurrency Theory
Decision Algorithms for Probabilistic Bisimulation
CONCUR '02 Proceedings of the 13th International Conference on Concurrency Theory
Timing Attacks on Implementations of Diffie-Hellman, RSA, DSS, and Other Systems
CRYPTO '96 Proceedings of the 16th Annual International Cryptology Conference on Advances in Cryptology
Decidability of Bisimulation Equivalences for Parallel Timer Processes
CAV '92 Proceedings of the Fourth International Workshop on Computer Aided Verification
Weak Bisimulation for Fully Probabilistic Processes
CAV '97 Proceedings of the 9th International Conference on Computer Aided Verification
Bisimulation Algorithms for Stochastic Process Algebras and Their BDD-Based Implementation
ARTS '99 Proceedings of the 5th International AMAST Workshop on Formal Methods for Real-Time and Probabilistic Systems
Verifying Automata Specifications of Probabilistic Real-time Systems
Proceedings of the Real-Time: Theory in Practice, REX Workshop
Process Algebra and Non-interference
CSFW '99 Proceedings of the 12th IEEE workshop on Computer Security Foundations
Forward Analysis of Updatable Timed Automata
Formal Methods in System Design
A process-algebraic approach for the analysis of probabilistic noninterference
Journal of Computer Security
Metrics for labelled Markov processes
Theoretical Computer Science - Logic, semantics and theory of programming
Theoretical Computer Science - Automated reasoning for security protocol analysis
Design and verification of long-running transactions in a timed framework
Science of Computer Programming
Bisimulation for Demonic Schedulers
FOSSACS '09 Proceedings of the 12th International Conference on Foundations of Software Science and Computational Structures: Held as Part of the Joint European Conferences on Theory and Practice of Software, ETAPS 2009
Remote timing attacks are practical
Computer Networks: The International Journal of Computer and Telecommunications Networking - Web security
A Decidable Probability Logic for Timed Probabilistic Systems
Fundamenta Informaticae
A Classification of Time and/or Probability Dependent Security Properties
Electronic Notes in Theoretical Computer Science (ENTCS)
Simulation and bisimulation for probabilistic timed automata
FORMATS'10 Proceedings of the 8th international conference on Formal modeling and analysis of timed systems
Making random choices invisible to the scheduler
CONCUR'07 Proceedings of the 18th international conference on Concurrency Theory
| Hi-index | 5.23 |
We are interested in describing timed systems that exhibit probabilistic behaviour. To this purpose, we consider a model of Probabilistic Timed Automata and introduce a concept of weak bisimulation for these automata, together with an algorithm to decide it. The weak bisimulation relation is shown to be preserved when either time, or probability is abstracted away. As an application, we use weak bisimulation for Probabilistic Timed Automata to model and analyze a timing attack on the dining cryptographers protocol.