On the public citation graph

Proving Positive Almost Sure Termination Under Strategies

0 signed · 40 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.1002/9781118150504.scardopenalex-snapshot
Wiley Series in Probability and Mathematical Statistics
inferredcites →https://doi.org/10.1002/9781118165485.scardopenalex-snapshot
Wiley Series in Probability and Mathematical Statistics
inferredcites →https://doi.org/10.1006/inco.1993.1012openalex-snapshot
Probabilistic Verification
inferredcites →https://doi.org/10.1007/3-540-44667-2_3openalex-snapshot
Introduction to Stochastic Petri Nets
inferredcites →https://doi.org/10.1007/3-540-44667-2_9openalex-snapshot
Stochastic Activity Networks: Formal Definitions and Concepts⋆
inferredcites →https://doi.org/10.1007/3-540-44881-0_6openalex-snapshot
Rewriting Logic and Probabilities
inferredcites →https://doi.org/10.1007/3-540-45610-4_18openalex-snapshot
Probabilistic Rewrite Strategies. Applications to ELAN
inferredcites →https://doi.org/10.1007/3-540-46029-2_13openalex-snapshot
PRISM: Probabilistic Symbolic Model Checker
inferredcites →https://doi.org/10.1007/978-3-540-24622-0_8openalex-snapshot
Approximate Probabilistic Model Checking
inferredcites →https://doi.org/10.1007/978-3-540-31862-0_26openalex-snapshot
A Proof of Weak Termination Providing the Right Way to Terminate
inferredcites →https://doi.org/10.1007/978-3-540-32033-3_24openalex-snapshot
Proving Positive Almost-Sure Termination
inferredcites →https://doi.org/10.1007/978-3-540-39958-2_3openalex-snapshot
A Rewriting Based Model for Probabilistic Distributed Object Systems
inferredcites →https://doi.org/10.1016/s1571-0661(04)00039-8openalex-snapshot
Controlling Rewriting by Rewriting
inferredcites →https://doi.org/10.1017/cbo9780511984020openalex-snapshot
Topics in the Constructive Theory of Countable Markov Chains
inferredcites →https://doi.org/10.1017/cbo9780511984020.006openalex-snapshot
Ideology of induced chains
inferredcites →https://doi.org/10.1017/cbo9781139172752openalex-snapshot
Term Rewriting and All That
inferredcites →https://doi.org/10.1080/00401706.2000.10485734openalex-snapshot
Markov Chains: Gibbs Fields, Monte Carlo Simulation, and Queues
inferredcites →https://doi.org/10.1109/lics.2003.1210075openalex-snapshot
Model checking for probability and time: from theory to practice
inferredcites →https://doi.org/10.1109/sfcs.1985.12openalex-snapshot
Automatic verification of probabilistic concurrent finite state programs
inferredcites →https://doi.org/10.1137/0214070openalex-snapshot
Concurrent Probabilistic Programs, Or: How to Schedule If You Must
inferredcites →https://doi.org/10.1145/2166.357214openalex-snapshot
Termination of Probabilistic Concurrent Program
inferredcites →https://doi.org/10.1145/800061.808757openalex-snapshot
On the extremely fair treatment of probabilistic algorithms
inferredcites →https://doi.org/10.1145/888251.888264openalex-snapshot
Simplification and termination of strategies in rule-based languages
inferredcites →https://doi.org/10.1214/aoms/1177728976openalex-snapshot
On the Stochastic Matrices Associated with Certain Queuing Processes
inferredcites →https://doi.org/10.21236/ada314817openalex-snapshot
Rewriting Logic and its Applications First International Workshop, Asilomar Conference Center, Pacific Grove, California, 3-6 September 1996. Volume 4 Electronic Notes in Theoretical Computer Science.
inferredcites →https://doi.org/10.2307/2291177openalex-snapshot
Markov Decision Processes: Discrete Stochastic Dynamic Programming.
inferredcites →https://doi.org/10.2307/2669802openalex-snapshot
Markov Chains: Gibbs Fields, Monte Carlo Simulation, and Queues

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-030-72016-2_14openalex-snapshot
Inferring Expected Runtimes of Probabilistic Integer Programs Using Expected Sizes
inferred← citeshttps://doi.org/10.1007/978-3-319-90686-7_9openalex-snapshot
On Probabilistic Term Rewriting
inferred← citeshttps://doi.org/10.1007/978-3-319-94460-9_10openalex-snapshot
Confluence and Convergence in Probabilistically Terminating Reduction Systems
inferred← citeshttps://doi.org/10.1007/978-3-642-32211-2_15openalex-snapshot
Probabilistic Termination of CHRiSM Programs
inferred← citeshttps://doi.org/10.1016/j.ijar.2018.11.018openalex-snapshot
Confluence and convergence modulo equivalence in probabilistically terminating reduction systems
inferred← citeshttps://doi.org/10.1016/j.jlamp.2025.101070openalex-snapshot
A distribution semantics for probabilistic term rewriting
inferred← citeshttps://doi.org/10.1016/j.scico.2019.102338openalex-snapshot
On probabilistic term rewriting
inferred← citeshttps://doi.org/10.1145/1273920.1273943openalex-snapshot
Induction for positive almost sure termination
inferred← citeshttps://doi.org/10.1145/3434313openalex-snapshot
Intersection types and (positive) almost-sure termination
inferred← citeshttps://doi.org/10.26226/morressier.604907f41a80aac83ca25cf4openalex-snapshot
Inferring Expected Runtimes of Probabilistic Integer Programs Using Expected Sizes
inferred← citeshttps://doi.org/10.4204/eptcs.298.7openalex-snapshot
Proceedings Third Joint Workshop on Developments in Implicit Computational complExity and Foundational & Practical Aspects of Resource Analysis
inferred← citeshttps://doi.org/10.46298/lmcs-18(2:5)2022openalex-snapshot
Probabilistic Rewriting and Asymptotic Behaviour: on Termination and Unique Normal Forms
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.