On the public citation graph

Compositional Reasoning for Probabilistic Finite-State Behaviors

https://doi.org/10.1007/11601548_17
0 signed · 61 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.1995.1135openalex-snapshot
Axiomatizing Probabilistic Processes: ACP with Generative Probabilities
inferredcites →https://doi.org/10.1007/11539452_21openalex-snapshot
A Ground-Complete Axiomatization of Finite State Processes in Process Algebra
inferredcites →https://doi.org/10.1007/11539452_31openalex-snapshot
Transactions in RCCS
inferredcites →https://doi.org/10.1007/3-540-10003-2_79openalex-snapshot
On observing nondeterminism and concurrency
inferredcites →https://doi.org/10.1007/3-540-16444-8openalex-snapshot
Mathematical Methods of Specification and Synthesis of Software Systems '85
inferredcites →https://doi.org/10.1007/3-540-16444-8_1openalex-snapshot
Verification of an alternating bit protocol by means of process algebra protocol
inferredcites →https://doi.org/10.1007/3-540-48224-5_31openalex-snapshot
Axiomatizations for Probabilistic Bisimulation
inferredcites →https://doi.org/10.1007/3-540-48778-6_13openalex-snapshot
Specifying Performance Measures for PEPA
inferredcites →https://doi.org/10.1007/3-540-48778-6_4openalex-snapshot
Root Contention in IEEE 1394
inferredcites →https://doi.org/10.1007/3-540-57182-5_39openalex-snapshot
A complete axiomatization for branching bisimulation congruence of finite-state behaviours
inferredcites →https://doi.org/10.1007/3-540-57182-5_7openalex-snapshot
Action calculi, or syntactic action structures
inferredcites →https://doi.org/10.1007/978-3-540-24611-4_1openalex-snapshot
Probabilistic Automata: System Types, Parallel Composition and Comparison
inferredcites →https://doi.org/10.1007/978-3-540-27815-3_15openalex-snapshot
Verifying a Sliding Window Protocol in μCRL
inferredcites →https://doi.org/10.1007/978-3-540-31982-5_7openalex-snapshot
Axiomatizations for Probabilistic Finite-State Behaviors
inferredcites →https://doi.org/10.1007/978-3-540-48654-1openalex-snapshot
CONCUR '94: Concurrency Theory
inferredcites →https://doi.org/10.1007/b98484openalex-snapshot
Validation of Stochastic Systems
inferredcites →https://doi.org/10.1007/bfb0015027openalex-snapshot
Probabilistic simulations for probabilistic processes
inferredcites →https://doi.org/10.1007/bfb0084809openalex-snapshot
Compositional verification of probabilistic processes
inferredcites →https://doi.org/10.1007/pl00008917openalex-snapshot
Verification of the randomized consensus algorithm of Aspnes and Herlihy: a case study
inferredcites →https://doi.org/10.1016/0011-684x(85)90108-xopenalex-snapshot
Communicating sequential processes
inferredcites →https://doi.org/10.1016/0022-0000(84)90023-0openalex-snapshot
A complete inference system for a class of regular behaviours
inferredcites →https://doi.org/10.1016/0167-6423(90)90076-popenalex-snapshot
Communication and concurrency
inferredcites →https://doi.org/10.1016/0304-3975(83)90114-7openalex-snapshot
Calculi for synchrony and asynchrony
inferredcites →https://doi.org/10.1016/0890-5401(89)90070-9openalex-snapshot
A complete axiomatisation for observational congruence of finite-state behaviours
inferredcites →https://doi.org/10.1016/0890-5401(91)90030-6openalex-snapshot
Bisimulation through probabilistic testing
inferredcites →https://doi.org/10.1016/j.entcs.2005.12.076openalex-snapshot
The Quest for Equational Axiomatizations of Parallel Composition: Status and Open Problems
inferredcites →https://doi.org/10.1016/s0019-9958(84)80025-xopenalex-snapshot
Process algebra for synchronous communication
inferredcites →https://doi.org/10.1016/s0049-237x(09)70651-2openalex-snapshot
A Complete Inference System for Regular Processes with Silent Moves
inferredcites →https://doi.org/10.1016/s1567-8326(01)00005-4openalex-snapshot
Linearization in parallel pCRL
inferredcites →https://doi.org/10.1016/s1571-0661(05)80596-1openalex-snapshot
On Generative Parallel Composition
inferredcites →https://doi.org/10.1017/cbo9780511608841openalex-snapshot
Applications of Process Algebra
inferredcites →https://doi.org/10.1093/comjnl/37.4.233openalex-snapshot
Decidable Subsets of CCS
inferredcites →https://doi.org/10.1145/197917.198117openalex-snapshot
Proving time bounds for randomized distributed algorithms
inferredcites →https://doi.org/10.1145/2455.2460openalex-snapshot
Algebraic laws for nondeterminism and concurrency
inferredcites →https://doi.org/10.1145/566385.566386openalex-snapshot
Deciding and axiomatizing weak ST bisimulation for a process algebra with recursion and action refinement
inferredcites →https://doi.org/10.1515/9783112733417-002openalex-snapshot
Verification of an alternating bit protocol by means of process algebra
inferredcites →https://doi.org/10.6100/ir561343openalex-snapshot
Probabilistic process algebra
inferredcites →https://doi.org/10.7146/brics.v9i6.21724openalex-snapshot
Equational Axioms for Probabilistic Bisimilarity (Preliminary Report)
inferredcites →https://doi.org/10.7551/mitpress/5641.003.0027openalex-snapshot
A Complete Axiom System for Finite-State Probabilistic Processes

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-30985-5_26openalex-snapshot
An Axiomatization of Strong Distribution Bisimulation for a Language with a Parallel Operator and Probabilistic Choice
inferred← citeshttps://doi.org/10.1007/978-3-030-31175-9_9openalex-snapshot
A Complete Axiomatization of Branching Bisimilarity for a Simple Process Language with Probabilistic Choice
inferred← citeshttps://doi.org/10.1007/978-3-540-31982-5_7openalex-snapshot
Axiomatizations for Probabilistic Finite-State Behaviors
inferred← citeshttps://doi.org/10.1007/978-3-540-74407-8_4openalex-snapshot
Making Random Choices Invisible to the Scheduler
inferred← citeshttps://doi.org/10.1007/978-3-540-78499-9_31openalex-snapshot
Compositional Methods for Information-Hiding
inferred← citeshttps://doi.org/10.1007/978-3-540-79980-1_27openalex-snapshot
Non Expansive ε-Bisimulations
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-04081-8_11openalex-snapshot
Deriving Syntax and Axioms for Quantitative Regular Behaviours
inferred← citeshttps://doi.org/10.1007/978-3-642-33386-6_31openalex-snapshot
A Probabilistic Kleene Theorem
inferred← citeshttps://doi.org/10.1007/978-3-662-45198-4_5openalex-snapshot
Testing Finite Probabilistic Processes
inferred← citeshttps://doi.org/10.1007/s11390-016-1628-4openalex-snapshot
Complete Proof Systems for Amortised Probabilistic Bisimulations
inferred← citeshttps://doi.org/10.1016/j.entcs.2006.09.016openalex-snapshot
Notes on Generative Probabilistic Bisimulation
inferred← citeshttps://doi.org/10.1016/j.entcs.2007.02.013openalex-snapshot
Remarks on Testing Probabilistic Processes
inferred← citeshttps://doi.org/10.1016/j.entcs.2007.07.011openalex-snapshot
Probabilistic Barbed Congruence
inferred← citeshttps://doi.org/10.1016/j.ic.2009.06.006openalex-snapshot
Making random choices invisible to the scheduler
inferred← citeshttps://doi.org/10.1016/j.ic.2010.09.007openalex-snapshot
Quantitative Kleene coalgebras
inferred← citeshttps://doi.org/10.1016/j.tcs.2006.12.008openalex-snapshot
Axiomatizations for probabilistic finite-state behaviors
inferred← citeshttps://doi.org/10.1016/j.tcs.2010.01.027openalex-snapshot
Non-expansive ϵ -bisimulations for probabilistic processes
inferred← citeshttps://doi.org/10.1016/j.tcs.2011.07.020openalex-snapshot
Branching bisimulation congruence for probabilistic systems
inferred← citeshttps://doi.org/10.1017/s0960129514000292openalex-snapshot
Compositional methods for information-hiding
inferred← citeshttps://doi.org/10.1145/2400676.2400680openalex-snapshot
Bisimulation for Quantum Processes
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.