On the public citation graph
Refinement-oriented probability for CSP
0 signed · 93 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.
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.
What this work says
Outgoing claims: the papers this work cites, builds on, or argues with.
inferredcites →https://doi.org/10.1007/978-3-540-48654-1_34openalex-snapshot
Process Algebra with Partial Choice
inferredcites →https://doi.org/10.1007/bfb0015026openalex-snapshot
Process algebra with partial choice
inferredcites →https://doi.org/10.1007/bfb0015727openalex-snapshot
Linear and branching structures in the semantics and logics of reactive systems
inferredcites →https://doi.org/10.1007/bfb0036946openalex-snapshot
Power domains and predicate transformers: A topological view
inferredcites →https://doi.org/10.1007/bfb0084810openalex-snapshot
Axiomatizing probabilistic processes: ACP with generative probabilities
inferredcites →https://doi.org/10.1016/0304-3975(84)90113-0openalex-snapshot
Testing equivalences for processes
inferredcites →https://doi.org/10.1016/0304-3975(94)00286-0openalex-snapshot
Probabilistic communicating processes
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.1109/lics.1989.39173openalex-snapshot
A probabilistic powerdomain of evaluations
inferredcites →https://doi.org/10.1109/lics.1990.113740openalex-snapshot
Reactive, generative, and stratified models of probabilistic processes
inferredcites →https://doi.org/10.1145/75277.75307openalex-snapshot
Bisimulation through probabilistic testing (preliminary report)
inferredcites →https://doi.org/10.5287/ora-rbq8vyqjnopenalex-snapshot
Probabilities and Priorities in Timed CSP
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1007/11423348_12openalex-snapshot
Of Probabilistic wp and CSP—and Compositionality
inferred← citeshttps://doi.org/10.1007/11523468_81openalex-snapshot
Discrete Random Variables over Domains
inferred← citeshttps://doi.org/10.1007/11863908_15openalex-snapshot
A Formal Framework for Confidentiality-Preserving Refinement
inferred← citeshttps://doi.org/10.1007/11875567_11openalex-snapshot
Stepwise Development of Secure Systems
inferred← citeshttps://doi.org/10.1007/3-540-44618-4_26openalex-snapshot
Nondeterminism and Probabilistic Choice: Obeying the Laws
inferred← citeshttps://doi.org/10.1007/3-540-45309-1_24openalex-snapshot
Backwards Abstract Interpretation of Probabilistic Programs
inferred← citeshttps://doi.org/10.1007/3-540-45591-4_136openalex-snapshot
Models Supporting Nondeterminism and Probabilistic Choice
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-45608-2_1openalex-snapshot
Mathematical Models of Computer Security
inferred← citeshttps://doi.org/10.1007/3-540-45853-0_12openalex-snapshot
Confidentiality-Preserving Refinement is Compositional — Sometimes
inferred← citeshttps://doi.org/10.1007/978-3-030-38800-3_9openalex-snapshot
Origins and Development of Formal Methods
inferred← citeshttps://doi.org/10.1007/978-3-031-40436-8_15openalex-snapshot
A Coq Implementation of the Program Algebra in Jifeng He’s New Roadmap for Linking Theories of Programming
inferred← citeshttps://doi.org/10.1007/978-3-031-67114-2_11openalex-snapshot
A Tour Through the Programming Choices: Semantics and Applications
inferred← citeshttps://doi.org/10.1007/978-3-031-67114-2_4openalex-snapshot
PCSP# Denotational Semantics with an Application in Sports Analytics
inferred← citeshttps://doi.org/10.1007/978-3-032-30693-7_20openalex-snapshot
PAT2PRISM: Bridging Qualitative Correctness and Quantitative Resilience for IoT Protocols
inferred← citeshttps://doi.org/10.1007/978-3-319-25942-0_6openalex-snapshot
Extending Hybrid CSP with Probability and Stochasticity
inferred← citeshttps://doi.org/10.1007/978-3-319-51046-0_10openalex-snapshot
Discrete Random Variables Over Domains, Revisited
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_12openalex-snapshot
An Abstraction Framework for Mixed Non-deterministic and Probabilistic Systems
inferred← citeshttps://doi.org/10.1007/978-3-540-30482-1_17openalex-snapshot
Deriving Probabilistic Semantics Via the ‘Weakest Completion’
inferred← citeshttps://doi.org/10.1007/978-3-540-45099-3_17openalex-snapshot
Abstract Interpretation of Probabilistic Semantics
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-12032-9_7openalex-snapshot
Retaining the Probabilities in Probabilistic Testing Theory
inferred← citeshttps://doi.org/10.1007/978-3-642-15784-4_18openalex-snapshot
Composing Systems While Preserving Probabilities
inferred← citeshttps://doi.org/10.1007/978-3-642-16164-3_15openalex-snapshot
Time-Bounded Reachability in Distributed Input/Output Interactive Probabilistic Chains
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-28540-0_10openalex-snapshot
Probabilistic CSP: Preserving the Laws via Restricted Schedulers
inferred← citeshttps://doi.org/10.1007/978-3-642-30729-4_14openalex-snapshot
A UTP Semantics of pGCL as a Homogeneous Relation
inferred← citeshttps://doi.org/10.1007/978-3-642-35705-3_2openalex-snapshot
Unifying Theories of Programming with Monads
inferred← citeshttps://doi.org/10.1007/978-3-642-35722-0_11openalex-snapshot
Stuttering for Abstract Probabilistic Automata
inferred← citeshttps://doi.org/10.1007/978-3-642-39718-9_6openalex-snapshot
From Distributions to Probabilistic Reactive Programs
inferred← citeshttps://doi.org/10.1007/978-3-662-45198-4_4openalex-snapshot
Probabilistic Testing Semantics
inferred← citeshttps://doi.org/10.1007/978-3-662-45198-4_5openalex-snapshot
Testing Finite Probabilistic Processes
inferred← citeshttps://doi.org/10.1007/978-981-99-9640-7_29openalex-snapshot
Smart Contract Generation Supporting Multi-instance for Inter-Organizational Process Collaboration
inferred← citeshttps://doi.org/10.1007/s00165-012-0230-yopenalex-snapshot
Reconciling real and stochastic time: the need for probabilistic refinement
inferred← citeshttps://doi.org/10.1007/s00165-012-0236-5openalex-snapshot
Probabilistic may/must testing: retaining probabilities by restricted schedulers
inferred← citeshttps://doi.org/10.1007/s00165-012-0242-7openalex-snapshot
Exploring probabilistic bisimulations, part I
inferred← citeshttps://doi.org/10.1007/s00165-012-0244-5openalex-snapshot
Using schedulers to test probabilistic distributed systems
inferred← citeshttps://doi.org/10.1007/s00165-013-0274-7openalex-snapshot
Cryptographic protocols with everyday objects
inferred← citeshttps://doi.org/10.1007/s00165-017-0421-7openalex-snapshot
A Compositional Modelling and Verification Framework for Stochastic Hybrid Systems
inferred← citeshttps://doi.org/10.1016/j.entcs.2004.04.019openalex-snapshot
Axioms for Probability and Nondeterminism
inferred← citeshttps://doi.org/10.1016/j.entcs.2005.04.033openalex-snapshot
Breaking the Model: Finalisation and a Taxonomy of Security Attacks
inferred← citeshttps://doi.org/10.1016/j.entcs.2005.12.113openalex-snapshot
On Combining Probability and Nondeterminism
inferred← citeshttps://doi.org/10.1016/j.entcs.2007.02.013openalex-snapshot
Remarks on Testing Probabilistic Processes
inferred← citeshttps://doi.org/10.1016/j.ic.2007.07.008openalex-snapshot
Preservation of probabilistic information flow under refinement
inferred← citeshttps://doi.org/10.1016/j.ic.2013.02.002openalex-snapshot
Testing probabilistic equivalence through Reinforcement Learning
inferred← citeshttps://doi.org/10.1016/j.ic.2013.02.004openalex-snapshot
A uniform framework for modeling nondeterministic, probabilistic, stochastic, or mixed processes and their behavioral equivalences
inferred← citeshttps://doi.org/10.1016/j.jlap.2013.05.006openalex-snapshot
Stuttering for Abstract Probabilistic Automata
inferred← citeshttps://doi.org/10.1016/j.tcs.2003.11.019openalex-snapshot
Semantic models for information flow
inferred← citeshttps://doi.org/10.1016/j.tcs.2024.114876openalex-snapshot
Probabilistic unifying relations for modelling epistemic and aleatoric uncertainty: Semantics and automated reasoning with theorem proving
inferred← citeshttps://doi.org/10.1016/s0020-0190(01)00213-7openalex-snapshot
A process algebra for probabilistic and nondeterministic processes
inferred← citeshttps://doi.org/10.1016/s0167-6423(96)00019-6openalex-snapshot
Probabilistic models for the guarded command language
inferred← citeshttps://doi.org/10.1016/s1567-8326(02)00040-1openalex-snapshot
Algebraic theory of probabilistic and nondeterministic processes
inferred← citeshttps://doi.org/10.1016/s1571-0661(04)00121-5openalex-snapshot
A Testing Equivalence for Reactive Probabilistic Processes
inferred← citeshttps://doi.org/10.1016/s1571-0661(05)80222-1openalex-snapshot
A Fully Abstract Metric-Space Denotational Semantics for Reactive Probabilistic Processes
inferred← citeshttps://doi.org/10.1017/s0960129505005074openalex-snapshot
Distributing probability over non-determinism
inferred← citeshttps://doi.org/10.1037/0000114-016openalex-snapshot
Where are we now, and where do we go from here?
inferred← citeshttps://doi.org/10.1109/csfw.1999.779775openalex-snapshot
Process algebra and non-interference
inferred← citeshttps://doi.org/10.1109/lics.2007.15openalex-snapshot
Characterising Testing Preorders for Finite Probabilistic Processes
inferred← citeshttps://doi.org/10.1145/360204.360211openalex-snapshot
An abstract Monte-Carlo method for the analysis of probabilistic programs
inferred← citeshttps://doi.org/10.1145/3704855openalex-snapshot
A Demonic Outcome Logic for Randomized Nondeterminism
inferred← citeshttps://doi.org/10.1145/373243.360211openalex-snapshot
An abstract Monte-Carlo method for the analysis of probabilistic programs
inferred← citeshttps://doi.org/10.1145/3743131openalex-snapshot
Outcome Logic: A Unified Approach to the Metatheory of Program Logics with Branching Effects
inferred← citeshttps://doi.org/10.1201/b20053-4openalex-snapshot
Mandatory and Potential Choice: Comparing Event-B and STAIRS
inferred← citeshttps://doi.org/10.14236/ewic/rw1996.10openalex-snapshot
Proof rules for probabilistic loops
inferred← citeshttps://doi.org/10.14257/ijgdc.2015.8.1.17openalex-snapshot
Verification Method of Real-time System Based on Refinement Relation
inferred← citeshttps://doi.org/10.1587/transinf.2013edp7339openalex-snapshot
Investigating System Survivability from a Probabilistic Perspective
inferred← citeshttps://doi.org/10.2168/lmcs-4(4:4)2008openalex-snapshot
Characterising Testing Preorders for Finite Probabilistic Processes
inferred← citeshttps://doi.org/10.4204/eptcs.28.7openalex-snapshot
Testing Reactive Probabilistic Processes
inferred← citeshttps://doi.org/10.48550/arxiv.0907.1540openalex-snapshot
Testing Probabilistic Processes: Can Random Choices Be Unobservable?
inferred← citeshttps://doi.org/10.5555/774455.774461openalex-snapshot
Reliability assessment through probabilistic refinement
inferred← citeshttps://doi.org/10.6100/ir716397openalex-snapshot
Probability and hiding in concurrent processes
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.