On the public citation graph

Verification of multiprocess probabilistic protocols

https://doi.org/10.1007/bf01843570
0 signed · 120 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.1007/3-540-15648-8_16openalex-snapshot
The glory of the past
inferredcites →https://doi.org/10.1007/978-1-4757-3472-0_5openalex-snapshot
Hierarchical Ordering of Sequential Processes
inferredcites →https://doi.org/10.1007/bf00288965openalex-snapshot
The choice coordination problem
inferredcites →https://doi.org/10.1007/bfb0025785openalex-snapshot
Verification of concurrent programs: Temporal proof principles
inferredcites →https://doi.org/10.1016/0304-3975(84)90118-xopenalex-snapshot
Symmetric and economical solutions to the mutual exclusion problem in a distributed system
inferredcites →https://doi.org/10.1016/s0019-9958(82)91022-1openalex-snapshot
Reasoning with time and chance
inferredcites →https://doi.org/10.1145/2166.357214openalex-snapshot
Termination of Probabilistic Concurrent Program
inferredcites →https://doi.org/10.1145/357172.357178openalex-snapshot
Proving Liveness Properties of Concurrent Programs
inferredcites →https://doi.org/10.1145/567067.567082openalex-snapshot
How to cook a temporal proof system for your pet language
inferredcites →https://doi.org/10.1145/567532.567547openalex-snapshot
On the andvantages of free choice
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.21236/ada116035openalex-snapshot
Verification of Concurrent Programs. Part II. Temporal Proof Principles.

What points at this work

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

inferred← citeshttps://doi.org/10.1006/jcss.1999.1683openalex-snapshot
Deciding Bisimilarity and Similarity for Probabilistic Processes
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/11599555_33openalex-snapshot
Deductive Probabilistic Verification Methods of Safety, Liveness and Nonzenoness for Distributed Real-Time Systems
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-36576-1_6openalex-snapshot
Parameterized Verification by Probabilistic Abstraction
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-45605-8_16openalex-snapshot
Approximate Verification of Probabilistic Systems
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-47813-2_15openalex-snapshot
Automatic Verification of Probabilistic Free Choice
inferred← citeshttps://doi.org/10.1007/3-540-48778-6_1openalex-snapshot
Fully Abstract Characterization of Probabilistic May Testing
inferred← citeshttps://doi.org/10.1007/3-540-49213-5_20openalex-snapshot
Compositional Verification of Randomized Distributed Algorithms
inferred← citeshttps://doi.org/10.1007/3-540-54233-7_128openalex-snapshot
Model-checking for probabilistic real-time systems
inferred← citeshttps://doi.org/10.1007/3-540-58468-4_176openalex-snapshot
Testing and refinement for nondeterministic and probabilistic processes
inferred← citeshttps://doi.org/10.1007/3-540-61474-5_57openalex-snapshot
Polynomial time algorithms for testing probabilistic bisimulation and simulation
inferred← citeshttps://doi.org/10.1007/3-540-63165-8_199openalex-snapshot
Symbolic model checking for probabilistic processes
inferred← citeshttps://doi.org/10.1007/3-540-63166-6_14openalex-snapshot
Weak bisimulation for fully probabilistic processes
inferred← citeshttps://doi.org/10.1007/978-0-387-35608-2_15openalex-snapshot
Randomized Dining Philosophers without Fairness Assumption
inferred← citeshttps://doi.org/10.1007/978-1-4612-4476-9_34openalex-snapshot
An Exercise in the Verification of Multi-Process Programs
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-17462-0_27openalex-snapshot
Omega-Regular Objectives in Model-Free Reinforcement Learning
inferred← citeshttps://doi.org/10.1007/978-3-030-31784-3_26openalex-snapshot
Generic Emptiness Check for Fun and Profit
inferred← citeshttps://doi.org/10.1007/978-3-319-41540-6_7openalex-snapshot
Liveness of Randomised Parameterised Systems under Arbitrary Schedulers
inferred← citeshttps://doi.org/10.1007/978-3-319-46520-3_9openalex-snapshot
MoChiBA: Probabilistic LTL Model Checking Using Limit-Deterministic Büchi Automata
inferred← citeshttps://doi.org/10.1007/978-3-319-63387-9_7openalex-snapshot
Markov Automata with Multiple Objectives
inferred← citeshttps://doi.org/10.1007/978-3-319-73721-8_16openalex-snapshot
$$P^5$$ : Planner-less Proofs of Probabilistic Parameterized Protocols
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_1openalex-snapshot
Probabilistic Automata: System Types, Parallel Composition and Comparison
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-24622-0_8openalex-snapshot
Approximate Probabilistic Model Checking
inferred← citeshttps://doi.org/10.1007/978-3-540-30121-9_18openalex-snapshot
Deductive Probabilistic Verification Methods for Embedded and Ubiquitous Computing
inferred← citeshttps://doi.org/10.1007/978-3-540-30494-4_16openalex-snapshot
Bounded Probabilistic Model Checking with the Murφ Verifier
inferred← citeshttps://doi.org/10.1007/978-3-540-39724-3_34openalex-snapshot
Finite Horizon Analysis of Markov Chains with the Murϕ Verifier
inferred← citeshttps://doi.org/10.1007/978-3-540-48654-1_35openalex-snapshot
Probabilistic Simulations for Probabilistic Processes
inferred← citeshttps://doi.org/10.1007/978-3-540-49823-0_6openalex-snapshot
All k-Bounded Policies Are Equivalent for Self-stabilization
inferred← citeshttps://doi.org/10.1007/978-3-540-71209-1_9openalex-snapshot
Bisimulation Minimisation Mostly Speeds Up Probabilistic Model Checking
inferred← citeshttps://doi.org/10.1007/978-3-540-77966-7_9openalex-snapshot
How Fast and Fat Is Your Probabilistic Model Checker? An Experimental Performance Comparison
inferred← citeshttps://doi.org/10.1007/978-3-642-02652-2_10openalex-snapshot
Probabilistic Reachability for Parametric Markov Models
inferred← citeshttps://doi.org/10.1007/978-3-642-16901-4_26openalex-snapshot
Model Checking Hierarchical Probabilistic Systems
inferred← citeshttps://doi.org/10.1007/978-3-642-28756-5_37openalex-snapshot
A Platform for High Performance Statistical Model Checking – PLASMA
inferred← citeshttps://doi.org/10.1007/978-3-642-32940-1_26openalex-snapshot
Efficient Modelling and Generation of Markov Automata
inferred← citeshttps://doi.org/10.1007/978-3-642-39799-8_37openalex-snapshot
Automata with Generalized Rabin Pairs for Probabilistic Model Checking and LTL Synthesis
inferred← citeshttps://doi.org/10.1007/978-3-642-46604-5_3openalex-snapshot
Derivation of Distributed Algorithms
inferred← citeshttps://doi.org/10.1007/978-3-662-46081-8_7openalex-snapshot
Distributed Markov Chains
inferred← citeshttps://doi.org/10.1007/978-3-662-54577-5_29openalex-snapshot
Fair Termination for Parameterized Probabilistic Concurrent Systems
inferred← citeshttps://doi.org/10.1007/bf01211866openalex-snapshot
A logic for reasoning about time and reliability
inferred← citeshttps://doi.org/10.1007/bf01293266openalex-snapshot
Finding the closed partition of a planar graph
inferred← citeshttps://doi.org/10.1007/bf01784022openalex-snapshot
Probabilistic verification of communication protocols
inferred← citeshttps://doi.org/10.1007/bfb0015027openalex-snapshot
Probabilistic simulations for probabilistic processes
inferred← citeshttps://doi.org/10.1007/bfb0022433openalex-snapshot
Distributed Algorithms
inferred← citeshttps://doi.org/10.1007/bfb0030673openalex-snapshot
Verification of the randomized consensus algorithm of Aspnes and Herlihy: A case study
inferred← citeshttps://doi.org/10.1007/bfb0084809openalex-snapshot
Compositional verification of probabilistic processes
inferred← citeshttps://doi.org/10.1007/pl00008917openalex-snapshot
Verification of the randomized consensus algorithm of Aspnes and Herlihy: a case study
inferred← citeshttps://doi.org/10.1007/s00446-003-0102-zopenalex-snapshot
Randomized dining philosophers without fairness assumption
inferred← citeshttps://doi.org/10.1007/s00446-007-0034-0openalex-snapshot
Randomized self-stabilizing and space optimal leader election under arbitrary scheduler on rings
inferred← citeshttps://doi.org/10.1007/s004460050046openalex-snapshot
Model checking for a probabilistic branching time logic with fairness
inferred← citeshttps://doi.org/10.1007/s10009-005-0216-7openalex-snapshot
Finite horizon analysis of Markov Chains with the Murϕ verifier
inferred← citeshttps://doi.org/10.1007/s10009-010-0146-xopenalex-snapshot
Probabilistic reachability for parametric Markov models
inferred← citeshttps://doi.org/10.1007/s10009-020-00603-xopenalex-snapshot
Verification of randomized consensus algorithms under round-rigid adversaries
inferred← citeshttps://doi.org/10.1007/s10703-021-00364-6openalex-snapshot
Markov automata with multiple objectives
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.1016/0304-3975(94)90166-xopenalex-snapshot
A compositional framework for fault tolerance by specification transformation
inferred← citeshttps://doi.org/10.1016/0950-5849(89)90159-6openalex-snapshot
Survey of fairness notions
inferred← citeshttps://doi.org/10.1016/b978-0-408-02938-4.50016-4openalex-snapshot
Key references in distributed computer systems 1959–1989
inferred← citeshttps://doi.org/10.1016/b978-044482830-9/50029-1openalex-snapshot
Probabilistic Extensions of Process Algebras**This chapter is dedicated to the fond memory of Linda Christoff.
inferred← citeshttps://doi.org/10.1016/b978-1-55860-348-6.50026-2openalex-snapshot
10.1016/b978-1-55860-348-6.50026-2
inferred← citeshttps://doi.org/10.1016/j.entcs.2005.10.016openalex-snapshot
Distribution, Approximation and Probabilistic Model Checking
inferred← citeshttps://doi.org/10.1016/j.ic.2016.04.002openalex-snapshot
A space-efficient simulation algorithm on probabilistic automata
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)00044-5openalex-snapshot
Testing preorders for probabilistic processes can be characterized by simulations
inferred← citeshttps://doi.org/10.1016/s0304-3975(01)00049-4openalex-snapshot
Quantitative program logic and expected time bounds in probabilistic distributed algorithms
inferred← citeshttps://doi.org/10.1016/s1571-0661(05)80595-xopenalex-snapshot
Computing Probability Bounds for Linear Time Formulas over Concurrent Probabilistic Systems
inferred← citeshttps://doi.org/10.1016/s1571-0661(05)80603-6openalex-snapshot
The Essence of Coin Lemmas
inferred← citeshttps://doi.org/10.1080/00222933208673535openalex-snapshot
LXI.—On the identity of some ants from Ceylon described by F. Walker
inferred← citeshttps://doi.org/10.1080/10637199608915541openalex-snapshot
EVENTUAL DETERMINISM: USING PROBABILISTIC MEANS TO ACHIEVE DETERMINISTIC ENDS
inferred← citeshttps://doi.org/10.1093/logcom/exp001openalex-snapshot
Parallel and Distributed Methods in Verification
inferred← citeshttps://doi.org/10.1109/26.297852openalex-snapshot
Probabilistic testing of OSI protocols
inferred← citeshttps://doi.org/10.1109/32.44368openalex-snapshot
Bidding against competitors
inferred← citeshttps://doi.org/10.1109/hicss.1995.375480openalex-snapshot
Eventual determinism: using probabilistic means to achieve deterministic ends
inferred← citeshttps://doi.org/10.1109/icdcsw.2004.1284097openalex-snapshot
Deductive verification of probabilistic real-time systems
inferred← citeshttps://doi.org/10.1109/icst.2017.42openalex-snapshot
Statistical Model Checking Meets Property-Based Testing
inferred← citeshttps://doi.org/10.1109/lics.1991.151651openalex-snapshot
Specification and refinement of probabilistic processes
inferred← citeshttps://doi.org/10.1109/lics.1995.523277openalex-snapshot
Compositional testing preorders for probabilistic processes
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/pdmc-hibi.2010.12openalex-snapshot
Three High Performance Architectures in the Parallel APMC Boat
inferred← citeshttps://doi.org/10.1109/qest.2004.1348043openalex-snapshot
Axiomatization of trace semantics for stochastic nondeterministic processes
inferred← citeshttps://doi.org/10.1109/qest.2004.9openalex-snapshot
Cover Page
inferred← citeshttps://doi.org/10.1109/qest.2012.22openalex-snapshot
Static Partial Order Reduction for Probabilistic Concurrent Systems
inferred← citeshttps://doi.org/10.1109/risp.1991.130769openalex-snapshot
Toward a mathematical foundation for information flow security
inferred← citeshttps://doi.org/10.1109/tase.2014.20openalex-snapshot
On Statistical Model Checking with PLASMA
inferred← citeshttps://doi.org/10.1145/177492.177724openalex-snapshot
Reasoning about probabilistic parallel programs
inferred← citeshttps://doi.org/10.1145/197917.198117openalex-snapshot
Proving time bounds for randomized distributed algorithms
inferred← citeshttps://doi.org/10.1145/224964.224984openalex-snapshot
Formal verification of timed properties of randomized distributed algorithms
inferred← citeshttps://doi.org/10.1145/3776691openalex-snapshot
Verifying Almost-Sure Termination for Randomized Distributed Algorithms
inferred← citeshttps://doi.org/10.1145/75246.75275openalex-snapshot
Probabilistic testing of protocols
inferred← citeshttps://doi.org/10.1145/75247.75275openalex-snapshot
Probabilistic testing of protocols
inferred← citeshttps://doi.org/10.1145/75277.75307openalex-snapshot
Bisimulation through probabilistic testing (preliminary report)
inferred← citeshttps://doi.org/10.1145/93385.93427openalex-snapshot
Reasoning about probabilistic algorithms
inferred← citeshttps://doi.org/10.1613/jair.1.11595openalex-snapshot
Bridging the Gap Between Probabilistic Model Checking and Probabilistic Planning: Survey, Compilations, and Empirical Comparison
inferred← citeshttps://doi.org/10.21236/ada227320openalex-snapshot
Tools and Rules for the Practicing Verifier
inferred← citeshttps://doi.org/10.2200/s00253ed1v01y201009dct004openalex-snapshot
Principles of Transactional Memory
inferred← citeshttps://doi.org/10.3990/1.9789085702986openalex-snapshot
Model checking Markov Chains: Techniques and Tools
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
inferred← citeshttps://doi.org/10.70675/590e9e70z529ez4330z962ez7e569a799d92openalex-snapshot
Adaptation de l’algorithmique aux architectures parallèles
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.