On the public citation graph

Model checking for a probabilistic branching time logic with fairness

0 signed · 230 inferred · view as graph

Inferred edges come from two machine sources: sweeps of open repository metadata (mostly SSRN and Zenodo), and a bulk OpenAlex citation snapshot. Every row below is labelled with the one it came from. Neither is a complete citation index — absence here is not evidence of absence.

Is this your work? Sign in with ORCID and put your name on the claims that are yours.

Claim with ORCID

Reference health. See whether every reference in this work resolves to a known work and none has been retracted — and get a dated CiteStamped badge you can embed.

See reference health

What this work says

Outgoing claims: the papers this work cites, builds on, or argues with.

inferredcites →https://doi.org/10.1006/inco.1993.1012openalex-snapshot

Probabilistic Verification

inferredcites →https://doi.org/10.1007/3-540-54233-7_128openalex-snapshot

Model-checking for probabilistic real-time systems

inferredcites →https://doi.org/10.1007/3-540-55719-9_116openalex-snapshot

Testing preorders for probabilistic processes

inferredcites →https://doi.org/10.1007/3-540-56287-7_117openalex-snapshot

Reasoning about safety and liveness properties for probabilistic processes

inferredcites →https://doi.org/10.1007/3-540-58468-4_190openalex-snapshot

Algebraic reasoning for real-time probabilistic processes with uncertain information

inferredcites →https://doi.org/10.1007/3-540-60045-0_48openalex-snapshot

It usually works: The temporal logic of stochastic systems

inferredcites →https://doi.org/10.1007/3-540-60218-6_17openalex-snapshot

A compositional trace-based semantics for probabilistic automata

inferredcites →https://doi.org/10.1007/3-540-60218-6_18openalex-snapshot

Acceptance trees for probabilistic processes

inferredcites →https://doi.org/10.1007/3-540-61474-5_57openalex-snapshot

Polynomial time algorithms for testing probabilistic bisimulation and simulation

inferredcites →https://doi.org/10.1007/3-540-63165-8_199openalex-snapshot

Symbolic model checking for probabilistic processes

inferredcites →https://doi.org/10.1007/3-540-63166-6_14openalex-snapshot

Weak bisimulation for fully probabilistic processes

inferredcites →https://doi.org/10.1007/978-0-387-35358-6_18openalex-snapshot

Comparing CTL and PCTL on Labeled Markov Chains

inferredcites →https://doi.org/10.1007/978-3-540-48654-1_35openalex-snapshot

Probabilistic Simulations for Probabilistic Processes

inferredcites →https://doi.org/10.1007/978-3-540-48654-1_36openalex-snapshot

Fully Abstract Characterizations of Testing Preorders for Probabilistic Processes

inferredcites →https://doi.org/10.1007/bf01843570openalex-snapshot

Verification of multiprocess probabilistic protocols

inferredcites →https://doi.org/10.1007/bfb0023457openalex-snapshot

Temporal logics for the specification of performance and reliability

inferredcites →https://doi.org/10.1007/bfb0031986openalex-snapshot

Verifying automata specifications of probabilistic real-time systems

inferredcites →https://doi.org/10.1007/bfb0032043openalex-snapshot

Markov decision processes and regular events

inferredcites →https://doi.org/10.1007/bfb0084809openalex-snapshot

Compositional verification of probabilistic processes

inferredcites →https://doi.org/10.1016/0020-0190(85)90056-0openalex-snapshot

Defining liveness

inferredcites →https://doi.org/10.1016/0022-0000(85)90001-7openalex-snapshot

Decision procedures and expressiveness in the temporal logic of branching time

inferredcites →https://doi.org/10.1016/0022-0000(85)90012-1openalex-snapshot

A probabilistic PDL

inferredcites →https://doi.org/10.1016/0167-6423(83)90017-5openalex-snapshot

Using branching time temporal logic to synthesize synchronization skeletons

inferredcites →https://doi.org/10.1016/0890-5401(91)90030-6openalex-snapshot

Bisimulation through probabilistic testing

inferredcites →https://doi.org/10.1016/b978-0-444-89874-6.50010-6openalex-snapshot

Testing Probabilistic and Nondeterministic Processes

inferredcites →https://doi.org/10.1016/s0019-9958(82)91022-1openalex-snapshot

Reasoning with time and chance

inferredcites →https://doi.org/10.1016/s0020-0190(98)00038-6openalex-snapshot

On the verification of qualitative properties of probabilistic processes under fairness constraints

inferredcites →https://doi.org/10.1109/lics.1990.113740openalex-snapshot

Reactive, generative, and stratified models of probabilistic processes

inferredcites →https://doi.org/10.1109/lics.1991.151651openalex-snapshot

Specification and refinement of probabilistic processes

inferredcites →https://doi.org/10.1109/lics.1995.523277openalex-snapshot

Compositional testing preorders for probabilistic processes

inferredcites →https://doi.org/10.1109/lics.1997.614940openalex-snapshot

Quantitative analysis and model checking

inferredcites →https://doi.org/10.1109/sfcs.1985.12openalex-snapshot

Automatic verification of probabilistic concurrent finite state programs

inferredcites →https://doi.org/10.1109/sfcs.1988.21948openalex-snapshot

On the complexity of omega -automata

inferredcites →https://doi.org/10.1109/sfcs.1988.21950openalex-snapshot

Verifying temporal properties of finite-state probabilistic programs

inferredcites →https://doi.org/10.1145/197917.198117openalex-snapshot

Proving time bounds for randomized distributed algorithms

inferredcites →https://doi.org/10.1145/210332.210339openalex-snapshot

The complexity of probabilistic verification

inferredcites →https://doi.org/10.1145/2166.357214openalex-snapshot

Termination of Probabilistic Concurrent Program

inferredcites →https://doi.org/10.1145/224964.224984openalex-snapshot

Formal verification of timed properties of randomized distributed algorithms

inferredcites →https://doi.org/10.1145/259380.259527openalex-snapshot

Automatic verification of liveness properties of randomized systems

inferredcites →https://doi.org/10.1145/318593.318620openalex-snapshot

Modalities for model checking (extended abstract)

inferredcites →https://doi.org/10.1145/318593.318622openalex-snapshot

Checking that finite state concurrent programs satisfy their linear specification

inferredcites →https://doi.org/10.1145/567067.567080openalex-snapshot

Automatic verification of finite state concurrent system using temporal logic specifications

inferredcites →https://doi.org/10.1145/800057.808660openalex-snapshot

Probabilistic temporal logics for finite and bounded models

inferredcites →https://doi.org/10.1145/800061.808757openalex-snapshot

On the extremely fair treatment of probabilistic algorithms

inferredcites →https://doi.org/10.1145/800061.808759openalex-snapshot

A decidable propositional probabilistic dynamic logic

inferredcites →https://doi.org/10.21236/ada461346openalex-snapshot

Model Checking of Probabilistic and Nondeterministic Systems

inferredcites →https://doi.org/10.2307/2289262openalex-snapshot

Introduction to Stochastic Dynamic Programming.

inferredcites →https://doi.org/10.3233/fi-1992-17304openalex-snapshot

On Some Equivalence Relations for Probabilistic Processes1

What points at this work

Incoming claims: where this work appears in other papers’ reference lists and arguments.

inferred← citeshttps://doi.org/10.3217/jucs-012-08-0981openalex-extracted

Variations on Itai-Rodeh Leader Election for Anonymous Rings and their Analysis in PRISM

inferred← citeshttps://doi.org/10.1002/9780470611012.ch9openalex-snapshot

Verification of Probabilistic Systems Methods and Tools

inferred← citeshttps://doi.org/10.1002/9781119131151.ch1openalex-snapshot

Modeling and Verification of Distributed Systems Using Markov Decision Processes

inferred← citeshttps://doi.org/10.1007/0-387-32520-4_23openalex-snapshot

Model Checking: Algorithms

inferred← citeshttps://doi.org/10.1007/1-4020-8141-3_38openalex-snapshot

Controller Synthesis for Probabilistic Systems (Extended Abstract)

inferred← citeshttps://doi.org/10.1007/11513988_24openalex-snapshot

Improved Probabilistic Models for 802.11 Protocol Verification

inferred← citeshttps://doi.org/10.1007/11523468_72openalex-snapshot

Recursive Markov Decision Processes and Recursive Stochastic Games

inferred← citeshttps://doi.org/10.1007/11605157_17openalex-snapshot

Experiments with Deterministic ω-Automata for Formulas of Linear Temporal Logic

inferred← citeshttps://doi.org/10.1007/11691372_26openalex-snapshot

Model-Checking Markov Chains in the Presence of Uncertainties

inferred← citeshttps://doi.org/10.1007/11795490_6openalex-snapshot

Randomized Wait-Free Consensus Using an Atomicity Assumption

inferred← citeshttps://doi.org/10.1007/11817949_24openalex-snapshot

Reachability in Recursive Markov Decision Processes

inferred← citeshttps://doi.org/10.1007/11888116_17openalex-snapshot

Symbolic Verification of Communicating Systems with Probabilistic Message Losses: Liveness and Fairness

inferred← citeshttps://doi.org/10.1007/11901914_4openalex-snapshot

Symmetry Reduction for Probabilistic Model Checking Using Generic Representatives

inferred← citeshttps://doi.org/10.1007/3-540-40911-4_11openalex-snapshot

Specification and Analysis of Automata-Based Designs

inferred← citeshttps://doi.org/10.1007/3-540-44585-4_17openalex-snapshot

Automated Verification of a Randomized Distributed Consensus Protocol Using Cadence SMV and PRISM?

inferred← citeshttps://doi.org/10.1007/3-540-44618-4_11openalex-snapshot

Verifying Quantitative Properties of Continuous Probabilistic Timed Automata

inferred← citeshttps://doi.org/10.1007/3-540-44667-2_6openalex-snapshot

Verification of Randomized Distributed Algorithms

inferred← citeshttps://doi.org/10.1007/3-540-44685-0_12openalex-snapshot

Symbolic Computation of Maximal Probabilisti Reachability

inferred← citeshttps://doi.org/10.1007/3-540-44685-0_6openalex-snapshot

Performance Evaluation:= (Process Algebra + Model Checking) X Markov Chains

inferred← citeshttps://doi.org/10.1007/3-540-44804-7_2openalex-snapshot

Faster and Symbolic CTMC Model Checking

inferred← citeshttps://doi.org/10.1007/3-540-44804-7_7openalex-snapshot

Randomization Helps in LTL Model Checking

inferred← citeshttps://doi.org/10.1007/3-540-44919-1_5openalex-snapshot

Compositional Theories of Qualitative and Quantitative Behaviour

inferred← citeshttps://doi.org/10.1007/3-540-45352-0_5openalex-snapshot

Decidable Model Checking of Probabilistic Hybrid Automata

inferred← citeshttps://doi.org/10.1007/3-540-45605-8_8openalex-snapshot

Possibilistic and Probabilistic Abstraction-Based Model Checking

inferred← citeshttps://doi.org/10.1007/3-540-45739-9openalex-snapshot

Formal Techniques in Real-Time and Fault-Tolerant Systems

inferred← citeshttps://doi.org/10.1007/3-540-45739-9_21openalex-snapshot

A Probabilistic Extension of UML Statecharts

inferred← citeshttps://doi.org/10.1007/3-540-46002-0_5openalex-snapshot

Probabilistic Symbolic Model Checking with PRISM: A Hybrid Approach

inferred← citeshttps://doi.org/10.1007/3-540-46029-2_13openalex-snapshot

PRISM: Probabilistic Symbolic Model Checker

inferred← citeshttps://doi.org/10.1007/3-540-46419-0_27openalex-snapshot

Symbolic Model Checking of Probabilistic Processes Using MTBDDs and the Kronecker Representation

inferred← citeshttps://doi.org/10.1007/3-540-48320-9openalex-snapshot

CONCUR’99 Concurrency Theory

inferred← citeshttps://doi.org/10.1007/3-540-48320-9_12openalex-snapshot

Approximative Symbolic Model Checking of Continuous-Time Markov Chains

inferred← citeshttps://doi.org/10.1007/3-540-48320-9_7openalex-snapshot

Computing Minimum and Maximum Reachability Times in Probabilistic Systems

inferred← citeshttps://doi.org/10.1007/3-540-48778-6_3openalex-snapshot

Establishing Qualitative Properties for Probabilistic Lossy Channel Systems

inferred← citeshttps://doi.org/10.1007/3-540-48778-6_5openalex-snapshot

Automatic Verification of Real-Time Systems with Discrete Probability Distributions

inferred← citeshttps://doi.org/10.1007/3-540-63165-8_199openalex-snapshot

Symbolic model checking for probabilistic processes

inferred← citeshttps://doi.org/10.1007/978-0-387-35358-6_18openalex-snapshot

Comparing CTL and PCTL on Labeled Markov Chains

inferred← citeshttps://doi.org/10.1007/978-3-030-00359-3_13openalex-snapshot

Toward Implicit Learning for the Compositional Verification of Markov Decision Processes

inferred← citeshttps://doi.org/10.1007/978-3-030-43177-8_6openalex-snapshot

Coupling Robust Optimization and Model-Checking Techniques for Robust Scheduling in the Context of Industry 4.0

inferred← citeshttps://doi.org/10.1007/978-3-030-86593-1_10openalex-snapshot

The Satisfiability Problem for a Quantitative Fragment of PCTL

inferred← citeshttps://doi.org/10.1007/978-3-030-99527-0_4openalex-snapshot

Correlated Equilibria and Fairness in Concurrent Stochastic Games

inferred← citeshttps://doi.org/10.1007/978-3-031-13188-2_3openalex-snapshot

Playing Against Fair Adversaries in Stochastic Games with Total Rewards

inferred← citeshttps://doi.org/10.1007/978-3-031-72621-7_2openalex-snapshot

The Satisfiability and Validity Problems for Probabilistic CTL

inferred← citeshttps://doi.org/10.1007/978-3-031-97439-7_1openalex-snapshot

The Optimal Strategy to Meet the Deadline: Ask Christel!

inferred← citeshttps://doi.org/10.1007/978-3-031-97439-7_9openalex-snapshot

PCTL Satisfiability for Infinite Binary Trees

inferred← citeshttps://doi.org/10.1007/978-3-319-10575-8_28openalex-snapshot

Model Checking Probabilistic Systems

inferred← citeshttps://doi.org/10.1007/978-3-319-43425-4_17openalex-snapshot

Policy Learning for Time-Bounded Reachability in Continuous-Time Markov Decision Processes via Doubly-Stochastic Gradient Ascent

inferred← citeshttps://doi.org/10.1007/978-3-319-63387-9_8openalex-snapshot

Ensuring the Reliability of Your Model Checker: Interval Iteration for Markov Decision Processes

inferred← citeshttps://doi.org/10.1007/978-3-319-66197-1_22openalex-snapshot

Computing Conditional Probabilities: Implementation and Evaluation

inferred← citeshttps://doi.org/10.1007/978-3-319-91908-9_21openalex-snapshot

The 10,000 Facets of MDP Model Checking

inferred← citeshttps://doi.org/10.1007/978-3-540-24611-4_11openalex-snapshot

Analysing Randomized Distributed Algorithms

inferred← citeshttps://doi.org/10.1007/978-3-540-24611-4_5openalex-snapshot

On Probabilistic Computation Tree Logic

inferred← citeshttps://doi.org/10.1007/978-3-540-24611-4_6openalex-snapshot

Model Checking for Probabilistic Timed Systems

inferred← citeshttps://doi.org/10.1007/978-3-540-24730-2_5openalex-snapshot

Efficient Computation of Time-Bounded Reachability Probabilities in Uniform Continuous-Time Markov Decision Processes

inferred← citeshttps://doi.org/10.1007/978-3-540-30206-3_21openalex-snapshot

Symbolic Model Checking for Probabilistic Timed Automata

inferred← citeshttps://doi.org/10.1007/978-3-540-31982-5_9openalex-snapshot

Model Checking Durational Probabilistic Systems

inferred← citeshttps://doi.org/10.1007/978-3-540-40903-8_9openalex-snapshot

Performance Analysis of Probabilistic Timed Automata Using Digital Clocks

inferred← citeshttps://doi.org/10.1007/978-3-540-40981-6_9openalex-snapshot

Analysis of Probabilistic Contract Signing

inferred← citeshttps://doi.org/10.1007/978-3-540-71209-1_15openalex-snapshot

Model Checking Probabilistic Timed Automata with One or Two Clocks

inferred← citeshttps://doi.org/10.1007/978-3-540-72522-0_6openalex-snapshot

Stochastic Model Checking

inferred← citeshttps://doi.org/10.1007/978-3-540-74407-8_28openalex-snapshot

Bisimulation and Logical Preservation for Continuous-Time Markov Decision Processes

inferred← citeshttps://doi.org/10.1007/978-3-540-76336-9_7openalex-snapshot

On-the-Fly Stuttering in the Construction of Deterministic ω-Automata

inferred← citeshttps://doi.org/10.1007/978-3-540-95891-8_10openalex-snapshot

On Compositionality, Efficiency, and Applicability of Abstraction in Probabilistic Systems

inferred← citeshttps://doi.org/10.1007/978-3-642-01492-5_13openalex-snapshot

Model Checking Linear-Time Properties of Probabilistic Systems

inferred← citeshttps://doi.org/10.1007/978-3-642-04081-8_41openalex-snapshot

Strict Divergence for Probabilistic Timed Automata

inferred← citeshttps://doi.org/10.1007/978-3-642-04761-9_12openalex-snapshot

Quantitative Analysis under Fairness Constraints

inferred← citeshttps://doi.org/10.1007/978-3-642-12032-9_6openalex-snapshot

Fair Adversaries and Randomization in Two-Player Games

inferred← citeshttps://doi.org/10.1007/978-3-642-16265-7_1openalex-snapshot

On Model Checking Techniques for Randomized Distributed Systems

inferred← citeshttps://doi.org/10.1007/978-3-642-19835-9_11openalex-snapshot

Quantitative Multi-objective Verification for Probabilistic Systems

inferred← citeshttps://doi.org/10.1007/978-3-642-21455-4_3openalex-snapshot

Automated Verification Techniques for Probabilistic Systems

inferred← citeshttps://doi.org/10.1007/978-3-642-24288-5_2openalex-snapshot

Observing Continuous-Time MDPs by 1-Clock Timed Automata

inferred← citeshttps://doi.org/10.1007/978-3-642-33475-7_23openalex-snapshot

Compositional Abstraction Techniques for Probabilistic Automata

inferred← citeshttps://doi.org/10.1007/978-3-662-46734-3_5openalex-snapshot

Probabilistic Model Checking for Feature-Oriented Systems

inferred← citeshttps://doi.org/10.1007/978-981-96-0602-3_16openalex-snapshot

Runtime Verification of Neural-Symbolic Systems

inferred← citeshttps://doi.org/10.1007/bfb0023457openalex-snapshot

Temporal logics for the specification of performance and reliability

inferred← citeshttps://doi.org/10.1007/bfb0055639openalex-snapshot

Stochastic transition systems

inferred← citeshttps://doi.org/10.1007/s00165-006-0015-2openalex-snapshot

Parametric probabilistic transition systems for system design and analysis

inferred← citeshttps://doi.org/10.1007/s00165-017-0432-4openalex-snapshot

ProFeat: feature-oriented engineering for family-based probabilistic model checking

inferred← citeshttps://doi.org/10.1007/s001650300007openalex-snapshot

Probabilistic Model Checking of Deadline Properties in the IEEE 1394 FireWire Root Contention Protocol

inferred← citeshttps://doi.org/10.1007/s10009-003-0118-5openalex-snapshot

Automatic verification of the IEEE 1394 root contention protocol with KRONOS and PRISM

inferred← citeshttps://doi.org/10.1007/s10009-004-0140-2openalex-snapshot

Probabilistic symbolic model checking with PRISM: a hybrid approach

inferred← citeshttps://doi.org/10.1007/s100090100072openalex-snapshot

A tool for model-checking Markov chains

inferred← citeshttps://doi.org/10.1007/s10489-016-0790-2openalex-snapshot

Verifying concurrent probabilistic systems using probabilistic-epistemic logic specifications

inferred← citeshttps://doi.org/10.1007/s10703-006-0005-2openalex-snapshot

Performance analysis of probabilistic timed automata using digital clocks

inferred← citeshttps://doi.org/10.1007/s10703-010-0097-6openalex-snapshot

A game-based abstraction-refinement framework for Markov decision processes

inferred← citeshttps://doi.org/10.1007/s10703-012-0177-xopenalex-snapshot

Model checking for probabilistic timed automata

inferred← citeshttps://doi.org/10.1007/s10703-013-0194-4openalex-snapshot

Preface to the special issue on Probabilistic Model Checking

inferred← citeshttps://doi.org/10.1007/s11334-018-0316-7openalex-snapshot

Learning-based symbolic assume-guarantee reasoning for Markov decision process by using interval Markov process

inferred← citeshttps://doi.org/10.1007/s11787-013-0087-8openalex-snapshot

Probabilization of Logics: Completeness and Decidability

inferred← citeshttps://doi.org/10.1016/j.entcs.2004.01.020openalex-snapshot

Automatic Analysis of a Non-Repudiation Protocol

inferred← citeshttps://doi.org/10.1016/j.entcs.2005.04.004openalex-snapshot

Simplifying Itai-Rodeh Leader Election for Anonymous Rings

inferred← citeshttps://doi.org/10.1016/j.entcs.2005.05.043openalex-snapshot

Preface

inferred← citeshttps://doi.org/10.1016/j.entcs.2005.05.047openalex-snapshot

Weak Probabilistic Anonymity

inferred← citeshttps://doi.org/10.1016/j.entcs.2005.10.030openalex-snapshot

Quantitative Analysis With the Probabilistic Model Checker PRISM

inferred← citeshttps://doi.org/10.1016/j.entcs.2007.07.007openalex-snapshot

Exogenous Probabilistic Computation Tree Logic

inferred← citeshttps://doi.org/10.1016/j.ic.2005.03.001openalex-snapshot

Comparative branching-time semantics for Markov chains

inferred← citeshttps://doi.org/10.1016/j.ic.2007.01.004openalex-snapshot

Symbolic model checking for probabilistic timed automata

inferred← citeshttps://doi.org/10.1016/j.ic.2007.09.002openalex-snapshot

Reachability in recursive Markov decision processes

inferred← citeshttps://doi.org/10.1016/j.ic.2013.10.001openalex-snapshot

Compositional probabilistic verification through multi-objective model checking

inferred← citeshttps://doi.org/10.1016/j.ipl.2025.106596openalex-snapshot

Logical characterization of branching bisimilarity over random processes

inferred← citeshttps://doi.org/10.1016/j.jcss.2017.09.007openalex-snapshot

Task-structured probabilistic I/O automata

inferred← citeshttps://doi.org/10.1016/j.jcss.2023.103478openalex-snapshot

The satisfiability problem for a quantitative fragment of PCTL

inferred← citeshttps://doi.org/10.1016/j.peva.2017.08.007openalex-snapshot

Policy learning in continuous-time Markov decision processes using Gaussian Processes

inferred← citeshttps://doi.org/10.1016/j.tcs.2005.07.022openalex-snapshot

Efficient computation of time-bounded reachability probabilities in uniform continuous-time Markov decision processes

inferred← citeshttps://doi.org/10.1016/j.tcs.2006.07.022openalex-snapshot

Experiments with deterministic ω -automata for formulas of linear temporal logic

inferred← citeshttps://doi.org/10.1016/j.tcs.2011.07.020openalex-snapshot

Branching bisimulation congruence for probabilistic systems

inferred← citeshttps://doi.org/10.1016/s0020-0190(98)00038-6openalex-snapshot

On the verification of qualitative properties of probabilistic processes under fairness constraints

inferred← citeshttps://doi.org/10.1016/s0304-3975(01)00046-9openalex-snapshot

Automatic verification of real-time systems with discrete probability distributions

inferred← citeshttps://doi.org/10.1016/s1567-8326(02)00066-8openalex-snapshot

On the use of MTBDDs for performability analysis and verification of stochastic systems

inferred← citeshttps://doi.org/10.1016/s1571-0661(04)80406-7openalex-snapshot

Automatic Verification of the IEEE-1394 Root Contention Protocol with KRONOS and PRISM

inferred← citeshttps://doi.org/10.1016/s1571-0661(05)80039-8openalex-snapshot

Linear Structures for Concurrency in Probabilistic Programming Languages

inferred← citeshttps://doi.org/10.1016/s1571-0661(05)80597-3openalex-snapshot

From Fairness to Chance

inferred← citeshttps://doi.org/10.1109/acc.2011.5990952openalex-snapshot

Control of Markov decision processes from PCTL specifications

inferred← citeshttps://doi.org/10.1109/access.2023.3332367openalex-snapshot

Exploring Equivalences in Multi-Valued Systems: Concepts, Properties, and Generation Methods

inferred← citeshttps://doi.org/10.1109/csfw.2002.1021811openalex-snapshot

Probabilistic analysis of anonymity

inferred← citeshttps://doi.org/10.1109/ecbs.2009.44openalex-snapshot

Modeling and Analysis of Probabilistic Timed Systems

inferred← citeshttps://doi.org/10.1109/iccl.1998.674168openalex-snapshot

An operational semantics for probabilistic concurrent constraint programming

inferred← citeshttps://doi.org/10.1109/icse.2001.919104openalex-snapshot

Survivability analysis of networked systems

inferred← citeshttps://doi.org/10.1109/icsess.2016.7883133openalex-snapshot

Analyzing leader election protocol by probabilistic model checking

inferred← citeshttps://doi.org/10.1109/iiai-aai.2018.00026openalex-snapshot

Analysis of Interrupt Behavior Based on Probabilistic Model Checking

inferred← citeshttps://doi.org/10.1109/lics.1998.705679openalex-snapshot

How to specify and verify the long-run average behaviour of probabilistic systems

inferred← citeshttps://doi.org/10.1109/lics.2003.1210075openalex-snapshot

Model checking for probability and time: from theory to practice

inferred← citeshttps://doi.org/10.1109/lics.2019.8785892openalex-snapshot

MSO+∇ is undecidable

inferred← citeshttps://doi.org/10.1109/memcod.2003.1210081openalex-snapshot

Executable computational logics: combining formal methods and programming language based system design

inferred← citeshttps://doi.org/10.1109/memcod.2011.5970522openalex-snapshot

Reachability analysis for incomplete networks of Markov decision processes

inferred← citeshttps://doi.org/10.1109/qest.2006.19openalex-snapshot

Game-based Abstraction for Markov Decision Processes

inferred← citeshttps://doi.org/10.1109/qest.2008.45openalex-snapshot

Reduction Techniques for Model Checking Markov Decision Processes

inferred← citeshttps://doi.org/10.1109/qest.2009.10openalex-snapshot

Generation of Counterexamples for Model Checking of Markov Decision Processes

inferred← citeshttps://doi.org/10.1109/qest.2011.18openalex-snapshot

Discrete-Time Verification and Control for Probabilistic Rectangular Hybrid Automata

inferred← citeshttps://doi.org/10.1109/rtcsa.2007.53openalex-snapshot

On Verification of Probabilistic Timed Automata against Probabilistic Duration Properties

inferred← citeshttps://doi.org/10.1109/sefm.2004.12openalex-snapshot

Decidability results for parametric probabilistic transition systems with an application to security

inferred← citeshttps://doi.org/10.1109/sefm.2004.1347512openalex-snapshot

Decidability results for parametric probabilistic transition systems with an application to security

inferred← citeshttps://doi.org/10.1109/tse.2003.1205180openalex-snapshot

Model-checking algorithms for continuous-time markov chains

inferred← citeshttps://doi.org/10.1109/tse.2016.2527000openalex-snapshot

Probabilistic Interface Automata

inferred← citeshttps://doi.org/10.1142/s0218194022500061openalex-snapshot

Inconsistency-Tolerant Hierarchical Probabilistic CTL Model Checking: Logical Foundations and Illustrative Examples

inferred← citeshttps://doi.org/10.1145/1059816.1059819openalex-snapshot

Model checking meets performance evaluation

inferred← citeshttps://doi.org/10.1145/1059816.1059821openalex-snapshot

ProbMela and verification of Markov decision processes

inferred← citeshttps://doi.org/10.1145/1081180.1081182openalex-snapshot

Quantitative analysis of distributed randomized protocols

inferred← citeshttps://doi.org/10.1145/1287624.1287688openalex-snapshot

Quantitative verification

inferred← citeshttps://doi.org/10.1145/1295014.1295018openalex-snapshot

Quantitative verification

inferred← citeshttps://doi.org/10.1145/1314690.1314693openalex-snapshot

A testing scenario for probabilistic processes

inferred← citeshttps://doi.org/10.1145/1481506.1481511openalex-snapshot

Analysis of a gossip protocol in PRISM

inferred← citeshttps://doi.org/10.1145/2577080.2577095openalex-snapshot

Probabilistic model checking for energy analysis in software product lines

inferred← citeshttps://doi.org/10.1145/2584469.2577095openalex-snapshot

Probabilistic model checking for energy analysis in software product lines

inferred← citeshttps://doi.org/10.1145/259380.259527openalex-snapshot

Automatic verification of liveness properties of randomized systems

inferred← citeshttps://doi.org/10.1145/2603088.2603089openalex-snapshot

Trade-off analysis meets probabilistic model checking

inferred← citeshttps://doi.org/10.1145/2699431openalex-snapshot

Recursive Markov Decision Processes and Recursive Stochastic Games

inferred← citeshttps://doi.org/10.1145/2933575.2934574openalex-snapshot

The Probabilistic Model Checking Landscape

inferred← citeshttps://doi.org/10.1145/351268.351284openalex-snapshot

Concurrent constraint programming

inferred← citeshttps://doi.org/10.1145/3661814.3662145openalex-snapshot

The Finite Satisfiability Problem for PCTL is Undecidable

inferred← citeshttps://doi.org/10.1145/3787496openalex-snapshot

The Finite Satisfiability Problem for PCTL is Undecidable

inferred← citeshttps://doi.org/10.1145/903893.903940openalex-snapshot

The complexity cross

inferred← citeshttps://doi.org/10.1145/937555.937558openalex-snapshot

Model checking stochastic automata

inferred← citeshttps://doi.org/10.13140/2.1.2204.8641openalex-snapshot

Formal Techniques for the Verification and Optimal Control of Probabilistic Systems in the Presence of Modeling Uncertainties

inferred← citeshttps://doi.org/10.1587/transinf.e92.d.1003openalex-snapshot

Probabilistic Model Checking of the One-Dimensional Ising Model

inferred← citeshttps://doi.org/10.2168/lmcs-4(3:12)2008openalex-snapshot

Model Checking Probabilistic Timed Automata with One or Two Clocks

inferred← citeshttps://doi.org/10.22028/d291-26494openalex-snapshot

Model checking stochastic hybrid systems

inferred← citeshttps://doi.org/10.24425/bpasts.2021.137724openalex-snapshot

A survey of requirements for COVID-19 mitigation strategies

inferred← citeshttps://doi.org/10.25916/sut.26272471openalex-snapshot

Architecture optimisation of embedded systems under uncertainty in probabilistic reliability evaluation model parameters

inferred← citeshttps://doi.org/10.3233/978-1-61499-028-4-126openalex-snapshot

Advances in Probabilistic Model Checking

inferred← citeshttps://doi.org/10.3233/978-1-61499-627-9-1openalex-snapshot

Probabilistic Model Checking

inferred← citeshttps://doi.org/10.3233/fun-2002-50101openalex-snapshot

Markov Decision Processes and Deterministic Büchi Automata

inferred← citeshttps://doi.org/10.3233/jcs-2004-123-403openalex-snapshot

Probabilistic analysis of an anonymity system

inferred← citeshttps://doi.org/10.3233/jcs-2006-14604openalex-snapshot

Analysis of probabilistic contract signing1

inferred← citeshttps://doi.org/10.3390/axioms13120832openalex-snapshot

Fuzzy Computation Tree Temporal Logic with Quality Constraints and Its Model Checking

inferred← citeshttps://doi.org/10.3390/math12193148openalex-snapshot

Fuzzy Linear Temporal Logic with Quality Constraints

inferred← citeshttps://doi.org/10.3390/pr11020371openalex-snapshot

Robustness Evaluation Process for Scheduling under Uncertainties

inferred← citeshttps://doi.org/10.3990/1.9783952285008openalex-snapshot

Extensions of Statecharts with probability, time, and stochastic timing

inferred← citeshttps://doi.org/10.3990/1.9789036528580openalex-snapshot

Diagnosis, synthesis and analysis of probabilistic models

inferred← citeshttps://doi.org/10.3990/1.9789036529754openalex-snapshot

Model checking nondeterministic and randomly timed systems

inferred← citeshttps://doi.org/10.4204/eptcs.387.10openalex-snapshot

Quantifying Masking Fault-Tolerance via Fair Stochastic Games

inferred← citeshttps://doi.org/10.48550/arxiv.1003.2084openalex-snapshot

Asynchronous Bounded Expected Delay Networks

inferred← citeshttps://doi.org/10.48550/arxiv.1703.08956openalex-snapshot

Trace Expressiveness of Timed and Probabilistic Automata

inferred← citeshttps://doi.org/10.48550/arxiv.1901.06900openalex-snapshot

MSO+nabla is undecidable

inferred← citeshttps://doi.org/10.48550/arxiv.2006.02847openalex-snapshot

Quantum Markov Chain Semantics for Quip-E Programs

inferred← citeshttps://doi.org/10.48550/arxiv.2101.09241openalex-snapshot

A Survey of Requirements for COVID-19 Mitigation Strategies. Part II: Elicitation of Requirements

inferred← citeshttps://doi.org/10.48550/arxiv.cs/0002004openalex-snapshot

Stochastic Model Checking for Multimedia

inferred← citeshttps://doi.org/10.48550/arxiv.cs/0403044openalex-snapshot

Scalable Probabilistic Models for 802.11 Protocol Verification

inferred← citeshttps://doi.org/10.5287/ora-yekkzgrwaopenalex-snapshot

On verification and controller synthesis for probabilistic systems at runtime

inferred← citeshttps://doi.org/10.5555/381473.381505openalex-snapshot

Survivability analysis of networked systems

inferred← citeshttps://doi.org/10.5802/roia.89openalex-snapshot

Vérification formelle de propriétés de vivacité pour des systèmes multi-agents probabilistes à l’aide d’arbre à décomposition de buts

inferred← citeshttps://doi.org/10.6100/ir716397openalex-snapshot

Probability and hiding in concurrent processes

inferred← citeshttps://doi.org/10.70675/2991497fzaba1z4569z9c01z4b22b1d8c823openalex-snapshot

Terminaison en temps moyen fini de systèmes de règles probabilistes

Editorial review for independent work. ICSAC — the Institute for Complexity Science and Advanced Computing — runs a structured editorial panel for researchers publishing outside journals, and publishes on CiteStamp rails. Submission is free and goes through ORCID: icsacinstitute.org/submit.