Search results for: Jeremy Sproston
Fundamenta Informaticae > 2021 > Vol. 178, nr 1/2 > 101--138
Lecture Notes in Computer Science > Formal Techniques, Modelling and Analysis of Timed and Fault-Tolerant Systems > Regular Papers > 293-308
Lecture Notes in Computer Science > CONCUR 2001 — Concurrency Theory > Probabilistic Systems > 169-183
Lecture Notes in Computer Science > Tools and Algorithms for the Construction and Analysis of Systems > Timed Automata and Duration Calculus > 216-230
Lecture Notes in Computer Science > Process Algebra and Probabilistic Methods: Performance Modeling and Verification > Selected Papers > 169-187
Lecture Notes in Computer Science > Computer and Information Sciences - ISCIS 2004 > Modeling and Performance Evaluation > 543-552
Lecture Notes in Computer Science > Formal Methods for Real-Time and Probabilistic Systems > Model Checking Probabilistic Systems > 75-95
Lecture Notes in Computer Science > Formal Techniques in Real-Time and Fault-Tolerant Systems > Model Checking > 31-45
Lecture Notes in Computer Science > Tools and Algorithms for the Construction and Analysis of Systems > Markov Chains and Real-Time Systems > 170-184
Lecture Notes in Computer Science > Foundations of Software Science and Computational Structures > Probabilistic Models > 140-154
Lecture Notes in Computer Science > Validation of Stochastic Systems > Model Checking of Stochastic Systems > 189-229
Performability Engineering Series > Quantitative Assessments of Distributed Systems > Verification > 1 - 26
Formal Methods in System Design > 2013 > 42 > 2 > 119-145
Formal Methods in System Design > 2013 > 43 > 2 > 164-190