On the public citation graph

Probabilistic lossy channel systems

https://doi.org/10.1007/bfb0030633
0 signed · 64 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.1996.0003openalex-snapshot
Unreliable Channels Are Easier to Verify Than Perfect Channels
inferredcites →https://doi.org/10.1006/inco.1996.0053openalex-snapshot
Verifying Programs with Unreliable Channels
inferredcites →https://doi.org/10.1007/3-540-58201-0_78openalex-snapshot
Undecidable verification problems for programs with unreliable channels
inferredcites →https://doi.org/10.1007/978-1-4684-9455-6openalex-snapshot
Denumerable Markov Chains
inferredcites →https://doi.org/10.1007/bf02277857openalex-snapshot
Decidability of the termination problem for completely specified protocols
inferredcites →https://doi.org/10.1016/0167-6423(90)90049-jopenalex-snapshot
The formal description technique Estelle
inferredcites →https://doi.org/10.1016/0304-3975(88)90098-9openalex-snapshot
Characterizing finite Kripke structures in propositional temporal logic
inferredcites →https://doi.org/10.1016/0376-5075(78)90015-6openalex-snapshot
Finite state description of communication protocols
inferredcites →https://doi.org/10.1109/lics.1993.287591openalex-snapshot
Verifying programs with unreliable channels
inferredcites →https://doi.org/10.1109/sfcs.1983.51openalex-snapshot
Reasoning about infinite computation paths
inferredcites →https://doi.org/10.1109/sfcs.1985.12openalex-snapshot
Automatic verification of probabilistic concurrent finite state programs
inferredcites →https://doi.org/10.1109/sfcs.1988.21950openalex-snapshot
Verifying temporal properties of finite-state probabilistic programs
inferredcites →https://doi.org/10.1145/117009.117015openalex-snapshot
Data flow analysis of communicating finite state machines
inferredcites →https://doi.org/10.1145/2166.357214openalex-snapshot
Termination of Probabilistic Concurrent Program
inferredcites →https://doi.org/10.1145/322374.322380openalex-snapshot
On Communicating Finite-State Machines
inferredcites →https://doi.org/10.1145/362946.362970openalex-snapshot
A note on reliable full-duplex transmission over half-duplex links
inferredcites →https://doi.org/10.1145/4904.4999openalex-snapshot
“Sometimes” and “not never” revisited

What points at this work

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

inferred← citeshttps://doi.org/10.1007/11590156_30openalex-snapshot
Computing the Expected Accumulated Reward and Gain for a Subclass of Infinite Markov Chains
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_5openalex-snapshot
Eager Markov Chains
inferred← citeshttps://doi.org/10.1007/3-540-36576-1_8openalex-snapshot
Model Checking Lossy Channels Systems Is Probably Decidable
inferred← citeshttps://doi.org/10.1007/3-540-44618-4_24openalex-snapshot
Reasoning about Probabilistic Lossy Channel Systems
inferred← citeshttps://doi.org/10.1007/3-540-44685-0_12openalex-snapshot
Symbolic Computation of Maximal Probabilisti Reachability
inferred← citeshttps://doi.org/10.1007/3-540-45061-0_78openalex-snapshot
Quantitative Analysis of Probabilistic Lossy Channel Systems
inferred← citeshttps://doi.org/10.1007/3-540-48778-6_3openalex-snapshot
Establishing Qualitative Properties for Probabilistic Lossy Channel Systems
inferred← citeshttps://doi.org/10.1007/978-3-031-45286-4_10openalex-snapshot
Introducing Divergence for Infinite Probabilistic Models
inferred← citeshttps://doi.org/10.1007/978-3-031-97439-7_3openalex-snapshot
Decisiveness for Countable MDPs and Insights for NPLCSs and POMDPs
inferred← citeshttps://doi.org/10.1007/978-3-032-05792-1_13openalex-snapshot
Tightening the Frontier of Decidability for Decisiveness
inferred← citeshttps://doi.org/10.1007/978-3-319-10575-8_28openalex-snapshot
Model Checking Probabilistic Systems
inferred← citeshttps://doi.org/10.1007/978-3-540-24611-4_13openalex-snapshot
The Verification of Probabilistic Lossy Channel Systems
inferred← citeshttps://doi.org/10.1007/978-3-540-28644-8_13openalex-snapshot
Deciding Probabilistic Bisimilarity Over Infinite-State Probabilistic Systems
inferred← citeshttps://doi.org/10.1007/978-3-540-31856-9_12openalex-snapshot
On the Decidability of Temporal Properties of Probabilistic Pushdown Automata
inferred← citeshttps://doi.org/10.1007/978-3-540-78499-9_4openalex-snapshot
Stochastic Games with Lossy Channels
inferred← citeshttps://doi.org/10.1007/s00236-005-0168-0openalex-snapshot
π-calculus with noisy channels
inferred← citeshttps://doi.org/10.1007/s00236-007-0066-8openalex-snapshot
Deciding probabilistic bisimilarity over infinite-state probabilistic systems
inferred← citeshttps://doi.org/10.1007/s10009-021-00625-zopenalex-snapshot
What can we monitor over unreliable channels?
inferred← citeshttps://doi.org/10.1016/j.entcs.2009.05.031openalex-snapshot
Branching-Time Model-Checking of Probabilistic Pushdown Automata
inferred← citeshttps://doi.org/10.1016/j.ic.2004.12.001openalex-snapshot
Simulating perfect channels with probabilistic lossy channels
inferred← citeshttps://doi.org/10.1016/j.ic.2005.05.008openalex-snapshot
Verification of probabilistic systems with faulty communication
inferred← citeshttps://doi.org/10.1016/j.ic.2005.11.004openalex-snapshot
Quantitative analysis of probabilistic lossy channel systems
inferred← citeshttps://doi.org/10.1016/j.jcss.2013.07.001openalex-snapshot
Branching-time model-checking of probabilistic pushdown automata
inferred← citeshttps://doi.org/10.1016/j.jlamp.2018.03.004openalex-snapshot
When are stochastic transition systems tameable?
inferred← citeshttps://doi.org/10.1016/j.peva.2009.07.002openalex-snapshot
PCTL model checking of Markov chains: Truth and falsity as winning strategies in games
inferred← citeshttps://doi.org/10.1016/j.tcs.2007.05.007openalex-snapshot
CSL model checking algorithms for QBDs
inferred← citeshttps://doi.org/10.1016/j.tcs.2012.03.002openalex-snapshot
Value-passing CCS with noisy channels
inferred← citeshttps://doi.org/10.1093/comjnl/bxn006openalex-snapshot
A Hierarchy of Behavioral Equivalences in the -calculus with Noisy Channels
inferred← citeshttps://doi.org/10.1109/apsec53868.2021.00058openalex-snapshot
Probabilistic testing of asynchronously communicating systems
inferred← citeshttps://doi.org/10.1109/lics.2004.1319596openalex-snapshot
Model checking probabilistic pushdown automata
inferred← citeshttps://doi.org/10.1109/lics.2004.23openalex-snapshot
Model checking probabilistic pushdown automata
inferred← citeshttps://doi.org/10.1109/lics.2005.54openalex-snapshot
Verifying infinite Markov chains with a finite attractor or the global coarseness property
inferred← citeshttps://doi.org/10.1109/qest.2006.24openalex-snapshot
Limiting Behavior of Markov Chains with Eager Attractors
inferred← citeshttps://doi.org/10.1109/qest.2009.16openalex-snapshot
Infinite-State Verification: From Transition Systems to Markov Chains
inferred← citeshttps://doi.org/10.1109/sfcs.2005.19openalex-snapshot
Analysis and Prediction of the Long-Run Behavior of Probabilistic Sequential Programs with Recursion (Extended Abstract)
inferred← citeshttps://doi.org/10.1109/tc.2011.147openalex-snapshot
Reliability of Mobile Processes with Noisy Channels
inferred← citeshttps://doi.org/10.1145/1297658.1297663openalex-snapshot
Verifying nondeterministic probabilistic channel systems against ω-regular linear-time properties
inferred← citeshttps://doi.org/10.1145/2603088.2603161openalex-snapshot
Zero-reachability in probabilistic multi-counter automata
inferred← citeshttps://doi.org/10.17656/jzs.10151openalex-snapshot
Verification of Infinite-State Systems with Probabilistic Behaviour
inferred← citeshttps://doi.org/10.2168/lmcs-2(1:2)2006openalex-snapshot
Model Checking Probabilistic Pushdown Automata
inferred← citeshttps://doi.org/10.2168/lmcs-3(4:7)2007openalex-snapshot
Decisive Markov Chains
inferred← citeshttps://doi.org/10.3217/jucs-011-10-1718openalex-snapshot
Probabilistic Models for Reo Connector Circuits
inferred← citeshttps://doi.org/10.3233/978-1-61499-627-9-1openalex-snapshot
Probabilistic Model Checking
inferred← citeshttps://doi.org/10.3990/1.9789085703044openalex-snapshot
Model checking structured infinite markov chains
inferred← citeshttps://doi.org/10.4204/eptcs.117.8openalex-snapshot
Solving Stochastic Büchi Games on Infinite Arenas with a Finite Attractor
inferred← citeshttps://doi.org/10.70675/9151003bzfc8ez4b81z9661z4a717e0eef2eopenalex-snapshot
Parameterized verification of networks of many identical processesVérification paramétrée de réseaux composés d'une multitude de processus identiques
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.