M.Y. Vardi. Automatic verification of probabilistic concurrent finite-state programs. In Proceedings of the 26th IEEE Symposium on Foundations of Computer Science, pages 327-- 338, 1985. Home/Search Document Not in Database Summary Related Articles Check |
This paper is cited in the following contexts:
First 50 documents Next 50
Bibliography - Accellera Property Specification Self-citation (Vardi) (Correct)
No context found.
M.Y. Vardi. Automatic Verification of Probabilistic Concurrent Finite-State Programs. In: Proceedings of FOCS'85, pp. 327--338. IEEE Computer Society Press, 1985.
Bounded Model Checking for GSMP Models of Stochastic.. - Alur, Bernadsky (2006) (Correct)
No context found.
M.Y. Vardi. Automatic verification of probabilistic concurrent finite-state programs. In Proceedings of the 26th IEEE Symposium on Foundations of Computer Science, pages 327-- 338, 1985.
Symbolic Verification of Communicating Systems With.. - Baier Bertrand And (Correct)
No context found.
M. Y. Vardi. Automatic verification of probabilistic concurrent finite-state programs. In Proc. 26th IEEE Symp. Foundations of Computer Science (FOCS '85), Portland, OR, USA, Oct. 1985, pages 327--338. IEEE Comp. Soc. Press, 1985. Technical appendix, not for the proceedings version. i A Automatic verification of Pachl's protocol
ProbVerus: Probabilistic Symbolic Model Checking - Hartonas-Garmhausen, Campos.. (1999) (Correct)
No context found.
M. Vardi. Automatic verification of probabilistic concurrent finite-state programs. In Proceedings of the 26th IEEE Symposium on Foundations of Computer Science. IEEE, New York, pp. 327-338, 1985.
Symbolic Model Checking for Probabilistic Processes - Christel Baier Edmund (1997) (31 citations) (Correct)
No context found.
M. Vardi. Automatic Verification of Probabilistic Concurrent Finite-State Programs. In Proc. FOCS'85, pp 327-338, IEEE, 1985.
Establishing Qualitative Properties for - Probabilistic Lossy Channel (Correct)
No context found.
M. Vardi. Automatic verification of probabilistic concurrent finite-state programs. FOCS'85, pages 327--338, 1985.
Electronic Notes in Theoretical Computer Science 21 (1999) - Url Http Www (Correct)
No context found.
M. Vardi. Automatic verification of probabilistic concurrent finite-state Programs. Proc. In Proc. FOCS'85, pages 327--338, 1985.
Approximate Symbolic Model Checking of Continuous-Time.. - Baier, Katoen, Hermanns (1999) (29 citations) (Correct)
No context found.
M.Y. Vardi. Automatic verification of probabilistic concurrent finite state programs. In FOCS, pp 327--338, 1985.
Model Checking Probabilistic Distributed - Systems Benedikt Bollig (Correct)
No context found.
Moshe Y. Vardi. Automatic verification of probabilistic concurrent finitestate programs. In 26th Annual Symposium on Foundations of Computer Science, pages 327--338, Portland, Oregon, 21--23 October 1985. IEEE.
A Note on the Attractor-Property - Of Infinite-State Markov (Correct)
No context found.
M. Y. Vardi, Automatic verification of probabilistic concurrent finite-state programs, in: Proc. Foundations of Computer Science (FOCS '85), 1985, pp. 327--338.
Quantitative Analysis of Distributed Randomized Protocols - Baier, Ciesinski, Groesser (2005) (Correct)
No context found.
M. Vardi. Automatic verification of probabilistic concurrent finite-state programs. FOCS'85, IEEE CS Press, pages 327--338, 1985.
The Complexity of Quantitative Concurrent Parity Games - Chatterjee, Henzinger (2004) (Correct)
No context found.
M.Y. Vardi. Automatic verification of probabilistic concurrent finitestate systems. In Proceedings of the 26th Annual Symposium on Foundations of Computer Science, pages 327--338. IEEE Computer Society Press, 1985. 30
Model Checking Probabilistic Pushdown Automata - Esparza, Kucera, Mayr (2004) (1 citation) (Correct)
No context found.
M. Vardi. Automatic verification of probabilistic concurrent finite-state programs. In Proceedings of 26th Annual Symposium on Foundations of Computer Science, pp. 327--338. IEEE Computer Society Press, 1985.
Implementation of Symbolic Model Checking for Probabilistic.. - Parker (1999) (5 citations) (Correct)
No context found.
M. Vardi. Automatic Verification of Probabilistic Concurrent Finite State Programs. In Proc. IEEE Symposium on Foundations of Computer Science (FOCS'85), pages 327--338, 1985.
Model Checking for Probability and Time: From Theory to Practice - Kwiatkowska (2003) (6 citations) (Correct)
No context found.
M. Vardi. Automatic verification of probabilistic concurrent finite state programs. In Proc. FOCS'85, pages 327--338. IEEE Computer Society Press, 1985.
On the use of MTBDDs for performability analysis.. - Hermanns.. (2002) (2 citations) (Correct)
No context found.
M. Vardi, Automatic Verification of Probabilistic Concurrent Finite State Programs, in: Proc. IEEE Symposium on Foundations of Computer Science (FOCS'85), 1985, pp. 327--338.
Probabilistic Automata: System Types, Parallel Composition.. - Sokolova, de Vink (Correct)
No context found.
M.Y. Vardi, Automatic verification of probabilistic concurrent finite state programs, Proc. FOCS'95 (Portland, Oregon), IEEE Computer Society Press, 1985, pp. 327--338.
Discounting the Future in Systems Theory - de Alfaro, Henzinger, Majumdar (2003) (1 citation) (Correct)
No context found.
M.Y. Vardi. Automatic verification of probabilistic concurrent finite-state systems. In Symp. Foundations of Computer Science, pp. 327--338. IEEE, 1985.
Compositional Methods for Probabilistic Systems - de Alfaro, Henzinger, Jhala (2001) (13 citations) (Correct)
No context found.
M.Y. Vardi. Automatic verification of probabilistic concurrent finite-state systems. In Proc. Symp. Foundations of Computer Science, pages 327--338. IEEE Computer Society Press, 1985. 16
Probability, Nondeterminism and Concurrency: Two Denotational.. - Varacca (2003) (Correct)
No context found.
Moshe Y. Vardi. Automatic verification of probabilistic concurrent finitestate programs. In Proc. 26th FOCS, pages 327--338, 1985.
Probabilistic Model Checking of the CSMA/CD.. - Duflot, Fribourg, .. (2004) (Correct)
No context found.
M.Y. Vardi. Automatic verification of probabilistic concurrent finite-state programs. Proc. 26th Annual Symposium on Foundations of Computer Science, pages 327--338, 1985.
Proving Time Bounds for Randomized Distributed Algorithms - Lynch, Saias, Segala (1994) (21 citations) (Correct)
No context found.
M. Y. Vardi. Automatic verification of probabilistic concurrent finite-state programs. In Proceedings of 26th IEEE Symposium on Foundations of Computer Science, pages 327--338, Portland, OR, 1985.
A Hierarchy of Probabilistic System Types - Falk Bartels Ana (2003) (4 citations) (Correct)
No context found.
M.Y. Vardi. Automatic verification of probabilistic concurrent finite-state programs. In Proc. FOCS'85, pages 327--338, Portland, Oregon, 1985.
Concurrent Omega-Regular Games - de Alfaro, Henzinger (2000) (3 citations) (Correct)
No context found.
M.Y. Vardi. Automatic verification of probabilistic concurrent finite-state systems. In Proc. 26th IEEE Symp. Found. of Comp. Sci., pages 327--338. IEEE Computer Society Press, 1985. 15
Approximate Reasoning for Real-Time Probabilistic Processes - Gupta, Jagadeesan.. (2006) (Correct)
No context found.
M. Vardi. Automatic verification of probabilistic concurrent finite-state systems. In Foundations of Computer Science, pages 327--338. IEEE Computer Society Press, 1985.
First 50 documents Next 50
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC