On the public citation graph

Weak Bisimulation for Probabilistic Systems

https://doi.org/10.1007/3-540-44618-4_25
0 signed · 136 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.1993.1012openalex-snapshot
Probabilistic Verification
inferredcites →https://doi.org/10.1007/3-540-44618-4_25openalex-snapshot
Weak Bisimulation for Probabilistic Systems
inferredcites →https://doi.org/10.1007/3-540-46432-8_1openalex-snapshot
Norm Functions for Probabilistic Bisimulations with Delays
inferredcites →https://doi.org/10.1007/3-540-55179-4_30openalex-snapshot
Efficient algorithms for verification of equivalences for probabilistic processes
inferredcites →https://doi.org/10.1007/3-540-55719-9_116openalex-snapshot
Testing preorders for probabilistic processes
inferredcites →https://doi.org/10.1007/3-540-58468-4_176openalex-snapshot
Testing and refinement for nondeterministic and probabilistic processes
inferredcites →https://doi.org/10.1007/3-540-60692-0_70openalex-snapshot
Model checking of probabilistic and nondeterministic systems
inferredcites →https://doi.org/10.1007/3-540-61474-5_57openalex-snapshot
Polynomial time algorithms for testing probabilistic bisimulation and simulation
inferredcites →https://doi.org/10.1007/3-540-61604-7_63openalex-snapshot
Extended Markovian Process Algebra
inferredcites →https://doi.org/10.1007/3-540-63166-6_14openalex-snapshot
Weak bisimulation for fully probabilistic processes
inferredcites →https://doi.org/10.1007/978-0-8176-4844-2openalex-snapshot
Linear Programming
inferredcites →https://doi.org/10.1007/978-3-540-48654-1_35openalex-snapshot
Probabilistic Simulations for Probabilistic Processes
inferredcites →https://doi.org/10.1007/bfb0015027openalex-snapshot
Probabilistic simulations for probabilistic processes
inferredcites →https://doi.org/10.1007/bfb0032043openalex-snapshot
Markov decision processes and regular events
inferredcites →https://doi.org/10.1007/bfb0039056openalex-snapshot
Testing equivalences and fully abstract models for probabilistic processes
inferredcites →https://doi.org/10.1007/bfb0039071openalex-snapshot
Equivalences, congruences, and complete axiomatizations for probabilistic processes
inferredcites →https://doi.org/10.1007/bfb0055637openalex-snapshot
Probabilistic resource failure in real-time process algebra
inferredcites →https://doi.org/10.1016/0167-6423(90)90076-popenalex-snapshot
Communication and concurrency
inferredcites →https://doi.org/10.1016/0890-5401(90)90025-dopenalex-snapshot
CCS expressions, finite state processes, and three problems of equivalence
inferredcites →https://doi.org/10.1016/0890-5401(91)90030-6openalex-snapshot
Bisimulation through probabilistic testing
inferredcites →https://doi.org/10.1109/5.259433openalex-snapshot
A process algebraic approach to the specification and analysis of resource-bound real-time systems
inferredcites →https://doi.org/10.1109/lics.1990.113740openalex-snapshot
Reactive, generative, and stratified models of probabilistic processes
inferredcites →https://doi.org/10.1109/lics.1991.151651openalex-snapshot
Specification and refinement of probabilistic processes
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.1137/0216062openalex-snapshot
Three Partition Refinement Algorithms
inferredcites →https://doi.org/10.1145/259380.259527openalex-snapshot
Automatic verification of liveness properties of randomized systems
inferredcites →https://doi.org/10.21236/ada461346openalex-snapshot
Model Checking of Probabilistic and Nondeterministic Systems

What points at this work

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

inferred← citeshttps://doi.org/10.2139/ssrn.4201825openalex-extracted
On Probabilistic Weak Bisimilarity
inferred← citeshttps://doi.org/10.1007/0-306-47003-9_27openalex-snapshot
A Family of Resource-Bound Real-Time Process Algebras
inferred← citeshttps://doi.org/10.1007/11817949_22openalex-snapshot
A Complete Axiomatisation of Branching Bisimulation for Probabilistic Systems with an Application in Protocol Verification
inferred← citeshttps://doi.org/10.1007/11817949_5openalex-snapshot
Probability and Nondeterminism in Operational Models of Concurrency
inferred← citeshttps://doi.org/10.1007/11881070_118openalex-snapshot
Simulation for Interactive Markov Chains
inferred← citeshttps://doi.org/10.1007/3-540-44618-4openalex-snapshot
CONCUR 2000 — Concurrency Theory
inferred← citeshttps://doi.org/10.1007/3-540-44667-2_6openalex-snapshot
Verification of Randomized Distributed Algorithms
inferred← citeshttps://doi.org/10.1007/3-540-45694-5_23openalex-snapshot
Simulation for Continuous-Time Markov Chains
inferred← citeshttps://doi.org/10.1007/3-540-45694-5_24openalex-snapshot
Weak Bisimulation is Sound and Complete for PCTL*
inferred← citeshttps://doi.org/10.1007/3-540-45694-5_25openalex-snapshot
Decision Algorithms for Probabilistic Bisimulation*
inferred← citeshttps://doi.org/10.1007/3-540-48224-5_31openalex-snapshot
Axiomatizations for Probabilistic Bisimulation
inferred← citeshttps://doi.org/10.1007/978-3-030-34175-6_20openalex-snapshot
Uniform Random Process Model Revisited
inferred← citeshttps://doi.org/10.1007/978-3-031-62645-6_3openalex-snapshot
Noninterference Analysis of Reversible Probabilistic Systems
inferred← citeshttps://doi.org/10.1007/978-3-031-77019-7_15openalex-snapshot
Reversibility in Process Calculi with Nondeterminism and Probabilities
inferred← citeshttps://doi.org/10.1007/978-3-031-95497-9_5openalex-snapshot
Noninterference Analysis of Stochastically Timed Reversible Systems
inferred← citeshttps://doi.org/10.1007/978-3-319-05119-2_18openalex-snapshot
Group-by-Group Probabilistic Bisimilarities and Their Logical Characterizations
inferred← citeshttps://doi.org/10.1007/978-3-319-19249-9_16openalex-snapshot
Probabilistic Bisimulation for Realistic Schedulers
inferred← citeshttps://doi.org/10.1007/978-3-319-47677-3_5openalex-snapshot
Behavioural Pseudometrics for Nondeterministic Probabilistic Systems
inferred← citeshttps://doi.org/10.1007/978-3-319-67729-3_12openalex-snapshot
Trace Relations and Logical Preservation for Continuous-Time Markov Decision Processes
inferred← citeshttps://doi.org/10.1007/978-3-319-98938-9_17openalex-snapshot
Towards a Formal Notion of Impact Metric for Cyber-Physical Attacks
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-24611-4_3openalex-snapshot
An Overview of Probabilistic Process Algebras and Their Equivalences
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-31982-5_8openalex-snapshot
Stochastic Transition Systems for Continuous State Spaces and Non-determinism
inferred← citeshttps://doi.org/10.1007/978-3-540-45187-7_32openalex-snapshot
Comparative Branching-Time Semantics for Markov Chains
inferred← citeshttps://doi.org/10.1007/978-3-540-71316-6_25openalex-snapshot
Scalar Outcomes Suffice for Finitary Probabilistic Testing
inferred← citeshttps://doi.org/10.1007/978-3-540-71389-0_21openalex-snapshot
Logical Characterizations of Bisimulations for Discrete Probabilistic Systems
inferred← citeshttps://doi.org/10.1007/978-3-540-73368-3_38openalex-snapshot
Magnifying-Lens Abstraction for Markov Decision Processes
inferred← citeshttps://doi.org/10.1007/978-3-540-73420-8_66openalex-snapshot
Continuous Capacities on Continuous State Spaces
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-01492-5_13openalex-snapshot
Model Checking Linear-Time Properties of Probabilistic Systems
inferred← citeshttps://doi.org/10.1007/978-3-642-15240-5_7openalex-snapshot
Probabilistic Mobility Models for Mobile and Wireless Networks
inferred← citeshttps://doi.org/10.1007/978-3-642-22012-8_24openalex-snapshot
On the Semantics of Markov Automata
inferred← citeshttps://doi.org/10.1007/978-3-642-23217-6_8openalex-snapshot
Bisimulations Meet PCTL Equivalences for Probabilistic Automata
inferred← citeshttps://doi.org/10.1007/978-3-642-28729-9_13openalex-snapshot
Revisiting Trace and Testing Equivalences for Nondeterministic and Probabilistic Processes
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-40196-1_6openalex-snapshot
Deciding Bisimilarities on Distributions
inferred← citeshttps://doi.org/10.1007/978-3-662-45198-4_5openalex-snapshot
Testing Finite Probabilistic Processes
inferred← citeshttps://doi.org/10.1007/978-3-662-45489-3openalex-snapshot
Stochastic Model Checking. Rigorous Dependability Analysis Using Model Checking Techniques for Stochastic Systems
inferred← citeshttps://doi.org/10.1007/978-3-662-45489-3_5openalex-snapshot
Computing Behavioral Relations for Probabilistic Concurrent Systems
inferred← citeshttps://doi.org/10.1007/s00165-012-0242-7openalex-snapshot
Exploring probabilistic bisimulations, part I
inferred← citeshttps://doi.org/10.1007/s00165-016-0356-4openalex-snapshot
Deciding probabilistic automata weak bisimulation: theory and practice
inferred← citeshttps://doi.org/10.1007/s00236-014-0210-1openalex-snapshot
Revisiting bisimilarity and its modal logic for nondeterministic and probabilistic processes
inferred← citeshttps://doi.org/10.1007/s00236-018-0313-1openalex-snapshot
Probabilistic bisimulation for realistic schedulers
inferred← citeshttps://doi.org/10.1007/s10515-022-00327-zopenalex-snapshot
A three-valued model abstraction framework for PCTL* stochastic model checking
inferred← citeshttps://doi.org/10.1007/s12204-009-0536-yopenalex-snapshot
Finite axiomatization for symbolic probabilistic π-calculus
inferred← citeshttps://doi.org/10.1016/j.camwa.2008.10.041openalex-snapshot
On metrics for probabilistic systems: Definitions and algorithms
inferred← citeshttps://doi.org/10.1016/j.entcs.2004.06.050openalex-snapshot
Weak Bisimulation for Action-Type Coalgebras
inferred← citeshttps://doi.org/10.1016/j.entcs.2004.11.028openalex-snapshot
Equivalences for Silent Transitions in Probabilistic Systems
inferred← citeshttps://doi.org/10.1016/j.entcs.2005.10.033openalex-snapshot
Metrics for Action-labelled Quantitative Transition Systems
inferred← citeshttps://doi.org/10.1016/j.entcs.2005.12.085openalex-snapshot
A Family of Resource-Bound Real-Time Process Algebras
inferred← citeshttps://doi.org/10.1016/j.entcs.2006.07.019openalex-snapshot
Trace Semantics for Stochastic Systems with 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.entcs.2008.11.023openalex-snapshot
Branching Bisimulation Congruence for Probabilistic Systems
inferred← citeshttps://doi.org/10.1016/j.entcs.2011.09.015openalex-snapshot
Formal Verification of Differential Privacy for Interactive Systems (Extended Abstract)
inferred← citeshttps://doi.org/10.1016/j.entcs.2013.12.002openalex-snapshot
Approximation Metrics Based on Probabilistic Bisimulations for General State-Space Markov Processes: A Survey
inferred← citeshttps://doi.org/10.1016/j.ic.2005.03.001openalex-snapshot
Comparative branching-time semantics for Markov chains
inferred← citeshttps://doi.org/10.1016/j.ic.2010.11.024openalex-snapshot
Probabilistic Logical Characterization
inferred← citeshttps://doi.org/10.1016/j.ic.2012.10.010openalex-snapshot
On the semantics of Markov automata
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.ic.2015.07.004openalex-snapshot
Polynomial time decision algorithms for probabilistic automata
inferred← citeshttps://doi.org/10.1016/j.ic.2020.104618openalex-snapshot
A probabilistic calculus of cyber-physical systems
inferred← citeshttps://doi.org/10.1016/j.ipl.2003.10.001openalex-snapshot
Probabilistic weak simulation is decidable in polynomial time
inferred← citeshttps://doi.org/10.1016/j.ipl.2020.105947openalex-snapshot
Raiders of the lost equivalence: Probabilistic branching bisimilarity
inferred← citeshttps://doi.org/10.1016/j.jlap.2007.02.005openalex-snapshot
Resources in process algebra
inferred← citeshttps://doi.org/10.1016/j.jlap.2013.05.006openalex-snapshot
Stuttering for Abstract Probabilistic Automata
inferred← citeshttps://doi.org/10.1016/j.scico.2013.02.009openalex-snapshot
Compositional reasoning for weighted Markov decision processes
inferred← citeshttps://doi.org/10.1016/j.tcs.2005.03.002openalex-snapshot
Measuring the confinement of probabilistic systems
inferred← citeshttps://doi.org/10.1016/j.tcs.2006.02.010openalex-snapshot
Branching bisimulation for probabilistic systems: Characteristics and decidability
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.09.003openalex-snapshot
Weak bisimulation for Probabilistic Timed Automata
inferred← citeshttps://doi.org/10.1016/j.tcs.2011.07.020openalex-snapshot
Branching bisimulation congruence for probabilistic systems
inferred← citeshttps://doi.org/10.1016/j.tcs.2014.03.001openalex-snapshot
Relating strong behavioral equivalences for processes with nondeterminism and probabilities
inferred← citeshttps://doi.org/10.1016/j.tcs.2019.09.037openalex-snapshot
Probabilistic divide & congruence: Branching bisimilarity
inferred← citeshttps://doi.org/10.1016/j.tcs.2020.12.045openalex-snapshot
A weak semantic approach to bisimulation metrics in models with nondeterminism and continuous state spaces
inferred← citeshttps://doi.org/10.1016/j.tcs.2021.04.001openalex-snapshot
Model independent approach to probabilistic models
inferred← citeshttps://doi.org/10.1017/cbo9780511792588.008openalex-snapshot
Probabilistic bisimulation
inferred← citeshttps://doi.org/10.1049/cce:20020404openalex-snapshot
Process algebraic modelling and analysis of power-aware real-time systems
inferred← citeshttps://doi.org/10.1109/csf61375.2024.00041openalex-snapshot
Probability from Possibility: Probabilistic Confidentiality for Storage Systems Under Nondeterminism
inferred← citeshttps://doi.org/10.1109/lics.2002.1029849openalex-snapshot
The metric analogue of weak bisimulation for probabilistic processes
inferred← citeshttps://doi.org/10.1109/qest.2004.1348037openalex-snapshot
Partial order reduction for probabilistic systems
inferred← citeshttps://doi.org/10.1109/qest.2004.1348043openalex-snapshot
Axiomatization of trace semantics for stochastic nondeterministic processes
inferred← citeshttps://doi.org/10.1109/qest.2004.1348044openalex-snapshot
Approximate reasoning for real-time probabilistic processes
inferred← citeshttps://doi.org/10.1109/qest.2004.30openalex-snapshot
Partial order reduction for probabilistic systems
inferred← citeshttps://doi.org/10.1109/qest.2004.7openalex-snapshot
Conservative Extensions of Regular Languages
inferred← citeshttps://doi.org/10.1109/qest.2004.9openalex-snapshot
Cover Page
inferred← citeshttps://doi.org/10.1109/qest.2005.9openalex-snapshot
Comparative analysis of bisimulation relations on alternating and non-alternating probabilistic models
inferred← citeshttps://doi.org/10.1109/qest.2007.10openalex-snapshot
Probabilistic Model Checking Modulo Theories
inferred← citeshttps://doi.org/10.1109/qest.2007.11openalex-snapshot
Symbolic Bisimulations for Probabilistic Systems
inferred← citeshttps://doi.org/10.1109/qest.2007.19openalex-snapshot
Basic Observables for Probabilistic May Testing
inferred← citeshttps://doi.org/10.1109/qest.2007.46openalex-snapshot
Fourth International Conference on the Quantitative Evaluation of Systems-Title
inferred← citeshttps://doi.org/10.1109/tse.2016.2527000openalex-snapshot
Probabilistic Interface Automata
inferred← citeshttps://doi.org/10.1109/tse.2025.3567423openalex-snapshot
Probabilistic Bisimulation for Parameterized Anonymity and Uniformity Verification
inferred← citeshttps://doi.org/10.14279/tuj.eceasst.66.895openalex-snapshot
On the Efficiency of Deciding Probabilistic Automata Weak Bisimulation
inferred← citeshttps://doi.org/10.2168/lmcs-10(1:16)2014openalex-snapshot
Revisiting Trace and Testing Equivalences for Nondeterministic and Probabilistic Processes
inferred← citeshttps://doi.org/10.2168/lmcs-2(1:4)2006openalex-snapshot
Approximate reasoning for real-time probabilistic processes
inferred← citeshttps://doi.org/10.2168/lmcs-9(2:7)2013openalex-snapshot
Bisimulations Meet PCTL Equivalences for Probabilistic Automata
inferred← citeshttps://doi.org/10.22028/d291-25945openalex-snapshot
Decision algorithms for probabilistic simulations
inferred← citeshttps://doi.org/10.23638/lmcs-14(4:13)2018openalex-snapshot
Game Characterization of Probabilistic Bisimilarity, and Applications to Pushdown Automata
inferred← citeshttps://doi.org/10.3990/1.9789036505925openalex-snapshot
Efficient modelling, generation and analysis of Markov Automata
inferred← citeshttps://doi.org/10.4204/eptcs.117.6openalex-snapshot
The Spectrum of Strong Behavioral Equivalences for Nondeterministic and Probabilistic Processes
inferred← citeshttps://doi.org/10.4230/lipics.fsttcs.2012.435openalex-snapshot
Deciding Probabilistic Automata Weak Bisimulation in Polynomial Time
inferred← citeshttps://doi.org/10.48550/arxiv.1305.0538openalex-snapshot
A Companion of "Relating Strong Behavioral Equivalences for Processes with Nondeterminism and Probabilities"
inferred← citeshttps://doi.org/10.48550/arxiv.1509.03391openalex-snapshot
Modal Characterisations of Behavioural Pseudometrics
inferred← citeshttps://doi.org/10.48550/arxiv.1806.10463openalex-snapshot
Towards a formal notion of impact metric for cyber-physical attacks (full version)
inferred← citeshttps://doi.org/10.6100/ir716397openalex-snapshot
Probability and hiding in concurrent processes
inferred← citeshttps://doi.org/10.7561/sacs.2022.2.211openalex-snapshot
Behavioural Pseudometrics for Nondeterministic Probabilistic Systems
showing the first 107 of 108
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.