On the public citation graph

Reasoning with time and chance

https://doi.org/10.1007/bfb0036928
0 signed · 33 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-10843-2_22openalex-snapshot
Impartiality, justice and fairness: The ethics of concurrent termination
inferredcites →https://doi.org/10.1007/978-1-4684-9455-6openalex-snapshot
Denumerable Markov Chains
inferredcites →https://doi.org/10.1007/bf00288965openalex-snapshot
The choice coordination problem
inferredcites →https://doi.org/10.1007/bfb0025774openalex-snapshot
Design and synthesis of synchronization skeletons using branching time temporal logic
inferredcites →https://doi.org/10.1016/0022-0000(81)90036-2openalex-snapshot
Semantics of probabilistic programs
inferredcites →https://doi.org/10.1016/0022-0000(82)90010-1openalex-snapshot
N-Process mutual exclusion with bounded waiting by 4 · Log2 N-valued shared variable
inferredcites →https://doi.org/10.1016/0304-3975(81)90110-9openalex-snapshot
The temporal semantics of concurrent programs
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.1017/cbo9780511621192openalex-snapshot
Modal Logic
inferredcites →https://doi.org/10.1090/s0002-9947-1969-0246760-1openalex-snapshot
Decidability of second-order theories and automata on infinite trees.
inferredcites →https://doi.org/10.1137/0206006openalex-snapshot
A Fast Monte-Carlo Test for Primality
inferredcites →https://doi.org/10.1137/0211029openalex-snapshot
On Primality Tests
inferredcites →https://doi.org/10.1145/567446.567462openalex-snapshot
On the temporal analysis of fairness
inferredcites →https://doi.org/10.1145/567532.567547openalex-snapshot
On the andvantages of free choice
inferredcites →https://doi.org/10.1145/567532.567551openalex-snapshot
The temporal logic of branching time
inferredcites →https://doi.org/10.1145/582153.582154openalex-snapshot
Termination of probabilistic concurrent programs
inferredcites →https://doi.org/10.1145/800061.808760openalex-snapshot
A logic to reason about likelihood
inferredcites →https://doi.org/10.1145/800070.802189openalex-snapshot
The complexity of propositional linear temporal logics
inferredcites →https://doi.org/10.1145/800070.802190openalex-snapshot
Decision procedures and expressiveness in the temporal logic of branching time
inferredcites →https://doi.org/10.1145/800070.802191openalex-snapshot
A probabilistic dynamic logic
inferredcites →https://doi.org/10.1145/800141.804647openalex-snapshot
Logics for probabilistic programming (Extended Abstract)
inferredcites →https://doi.org/10.2307/2217584openalex-snapshot
An Introduction to Modal Logic.

What points at this work

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

inferred← citeshttps://doi.org/10.1007/978-3-319-47166-2_3openalex-snapshot
Survey of Statistical Verification of Linear Unbounded Properties: Model Checking and Distances
inferred← citeshttps://doi.org/10.1007/bfb0036892openalex-snapshot
Automata, Languages and Programming
inferred← citeshttps://doi.org/10.1016/0022-0000(85)90012-1openalex-snapshot
A probabilistic PDL
inferred← citeshttps://doi.org/10.1109/sfcs.1983.12openalex-snapshot
Decision procedures for time and chance
inferred← citeshttps://doi.org/10.1145/248621.248623openalex-snapshot
Algebraic approaches to nondeterminism—an overview
inferred← citeshttps://doi.org/10.1145/800061.808758openalex-snapshot
A probabilistic PDL
inferred← citeshttps://doi.org/10.1145/800222.806732openalex-snapshot
Verification of multiprocess probabilistic protocols
inferred← citeshttps://doi.org/10.1145/800222.806736openalex-snapshot
Knowledge, common knowledge and related puzzles (Extended Summary)
inferred← citeshttps://doi.org/10.2168/lmcs-3(4:7)2007openalex-snapshot
Decisive Markov Chains
inferred← citeshttps://doi.org/10.4230/lipics.concur.2018.32openalex-snapshot
The Satisfiability Problem for Unbounded Fragments of Probabilistic CTL
inferred← citeshttps://doi.org/10.48550/arxiv.1005.3200openalex-snapshot
Real-time and Probabilistic Temporal Logics: An Overview
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.