January 01, 2013 conference-paper Symbolic Counterexample Generation for Discrete-Time Markov Chains Lecture notes in computer science DOI: 10.1007/978-3-642-35861-6_9 OpenAlex Authors 0 Author list not loaded yet. Cited by 2 stored of 11 Search Sort Most cited Newest Oldest Patent citations Title Any typearticle review book-chapter conference-paper preprint dissertation book dataset other Any fieldAgricultural and Biological Sciences Arts and Humanities Biochemistry, Genetics and Molecular Biology Business, Management and Accounting Chemical Engineering Chemistry Computer Science Decision Sciences Dentistry Earth and Planetary Sciences Economics, Econometrics and Finance Energy Engineering Environmental Science Health Professions Immunology and Microbiology Materials Science Mathematics Medicine Neuroscience Nursing Pharmacology, Toxicology and Pharmaceutics Physics and Astronomy Psychology Social Sciences Veterinary Open access Probabilistic Counterexamples Through the Ages 2025 Lecture notes in computer science conference-paper Computer Science Formal Methods in Verification Open access 0 citations (de-)Composed And More: Eager and Lazy Specifications (CAMELS) for Stochastic Hybrid Systems 2024 Lecture notes in computer science conference-paper Computer Science Formal Methods in Verification Open access 2 citations 2 results References 0