Making Random Choices Invisible to the Scheduler-Reference-Cited by-同舟云学术

Making Random Choices Invisible to the Scheduler

Published: Issue: Volume: Page:42-58
ISSN:0302-9743
Container-title:CONCUR 2007 – Concurrency Theory
language:
Short-container-title:

Author:

Chatzikokolakis Konstantinos,Palamidessi Catuscia

Publisher

Springer Berlin Heidelberg

Link

http://link.springer.com/content/pdf/10.1007/978-3-540-74407-8_4.pdf

Reference22 articles.

1. Vardi, M.: Automatic verification of probabilistic concurrent finite-state programs. In: Proc. of the Symp. on Foundations of Comp. Sci., pp. 327–338. IEEE Computer Society Press, Los Alamitos (1985)

2. Hansson, H., Jonsson, B.: A framework for reasoning about time and reliability. In: Proceedings of the Symp. on Real-Time Systems, pp. 102–111. IEEE Computer Society Press, Los Alamitos (1989)

3. Yi, W., Larsen, K.: Testing probabilistic and nondeterministic processes. In: Proc. of the IFIP Symp. on Protocol Specification, Testing and Verification (1992)

4. Segala, R.: Modeling and Verification of Randomized Distributed Real-Time Systems. PhD thesis, MIT/LCS/TR-676 (1995)

5. Segala, R., Lynch, N.: Probabilistic simulations for probabilistic processes. Nordic Journal of Computing 2(2), 250–273 (1995)

Cited by 18 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Trace Equivalence and Epistemic Logic to Express Security Properties;Formal Techniques for Distributed Objects, Components, and Systems;2020

2. Model Checking Indistinguishability of Randomized Security Protocols;Computer Aided Verification;2018

3. Metrics for Differential Privacy in Concurrent Systems;Formal Techniques for Distributed Objects, Components, and Systems;2014

4. Probabilistic Testing Semantics;Semantics of Probabilistic Processes;2014

5. Probabilistic may/must testing: retaining probabilities by restricted schedulers;Formal Aspects of Computing;2012-07