On the public citation graph
Backward Bisimulation in Markov Chain Model Checking
0 signed · 75 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.1006/inco.1995.1134openalex-snapshot
Forward and Backward Simulations
inferredcites →https://doi.org/10.1007/3-540-45022-x_65openalex-snapshot
On the Logical Characterisation of Performability Properties
inferredcites →https://doi.org/10.1007/3-540-45798-4_12openalex-snapshot
Automated Performance and Dependability Evaluation Using Model Checking
inferredcites →https://doi.org/10.1007/3-540-60045-0_48openalex-snapshot
It usually works: The temporal logic of stochastic systems
inferredcites →https://doi.org/10.1007/bf01211866openalex-snapshot
A logic for reasoning about time and reliability
inferredcites →https://doi.org/10.1007/s100090050046openalex-snapshot
NUSMV: a new symbolic model checker
inferredcites →https://doi.org/10.1007/s100090100072openalex-snapshot
A tool for model-checking Markov chains
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/0890-5401(90)90025-dopenalex-snapshot
CCS expressions, finite state processes, and three problems of equivalence
inferredcites →https://doi.org/10.1016/j.ic.2005.03.001openalex-snapshot
Comparative branching-time semantics for Markov chains
inferredcites →https://doi.org/10.1016/s0020-0190(03)00343-0openalex-snapshot
Optimal state-space lumping in Markov chains
inferredcites →https://doi.org/10.1016/s0169-7552(97)00133-5openalex-snapshot
Stochastic process algebras – between LOTOS and Markov chains
inferredcites →https://doi.org/10.1016/s0304-3975(97)00127-8openalex-snapshot
A tutorial on EMPA: A theory of concurrent processes with nondeterminism, priorities, probabilities and time
inferredcites →https://doi.org/10.1016/s0304-3975(98)00169-8openalex-snapshot
Exact performance equivalence: An equivalence relation for stochastic automata
inferredcites →https://doi.org/10.1016/s1567-8326(02)00068-1openalex-snapshot
Continuous stochastic logic characterizes bisimulation of continuous-time Markov processes
inferredcites →https://doi.org/10.1016/s1571-0661(05)01221-1openalex-snapshot
Exploiting Partial Symmetries for Markov Chain Aggregation
inferredcites →https://doi.org/10.1016/s1571-0661(05)80750-9openalex-snapshot
Exploiting Partial Symmetries for Markov Chain Aggregation
inferredcites →https://doi.org/10.1017/cbo9780511569951openalex-snapshot
A Compositional Approach to Performance Modelling
inferredcites →https://doi.org/10.1017/s0021900200107338openalex-snapshot
Exact and ordinary lumpability in finite Markov chains
inferredcites →https://doi.org/10.1023/a:1026228213080openalex-snapshot
From Pre-Historic to Post-Modern Symbolic Model Checking
inferredcites →https://doi.org/10.1109/12.247838openalex-snapshot
Stochastic well-formed colored nets and symmetric modeling applications
inferredcites →https://doi.org/10.1109/irep.2010.5563254openalex-snapshot
Effects of variable solar irradiance on the reactive power compensation for large solar farm
inferredcites →https://doi.org/10.1109/pnpm.2003.1231543openalex-snapshot
Performance queries on semi-Markov stochastic Petri nets with an extended continuous stochastic logic
inferredcites →https://doi.org/10.1109/qest.2004.1348036openalex-snapshot
Backward stochastic bisimulation in CSL model checking
inferredcites →https://doi.org/10.1109/qest.2004.1348048openalex-snapshot
PRISM 2.0: a tool for probabilistic model checking
inferredcites →https://doi.org/10.1109/sfcs.1985.12openalex-snapshot
Automatic verification of probabilistic concurrent finite state programs
inferredcites →https://doi.org/10.1109/tse.2003.1205180openalex-snapshot
Model-checking algorithms for continuous-time markov chains
inferredcites →https://doi.org/10.1145/210332.210339openalex-snapshot
The complexity of probabilistic verification
inferredcites →https://doi.org/10.1145/288197.581193openalex-snapshot
Modelling with Generalized Stochastic Petri Nets
inferredcites →https://doi.org/10.1145/343369.343402openalex-snapshot
Model-checking continuous-time Markov chains
inferredcites →https://doi.org/10.1145/5397.5399openalex-snapshot
Automatic verification of finite-state concurrent systems using temporal logic specifications
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-91825-5_3openalex-snapshot
State Space Minimization Preserving Embeddings for Continuous-Time Markov Chains
inferred← citeshttps://doi.org/10.1007/978-3-031-16336-4_3openalex-snapshot
An Automated Quantitative Information Flow Analysis for Concurrent Programs
inferred← citeshttps://doi.org/10.1007/978-3-031-30829-1_13openalex-snapshot
Reverse Bisimilarity vs. Forward Bisimilarity
inferred← citeshttps://doi.org/10.1007/978-3-031-57249-4_17openalex-snapshot
Forward and Backward Constrained Bisimulations for Quantum Circuits
inferred← citeshttps://doi.org/10.1007/978-3-032-35298-9_1openalex-snapshot
Stationary and Transient Bounds for Nearly Lumpable or Uncertain Markov Chains
inferred← citeshttps://doi.org/10.1007/978-3-319-22264-6_11openalex-snapshot
Lumping-Based Equivalences in Markovian Automata and Applications to Product-Form Analyses
inferred← citeshttps://doi.org/10.1007/978-3-319-34096-8_7openalex-snapshot
Quantitative Abstractions for Collective Adaptive Systems
inferred← citeshttps://doi.org/10.1007/978-3-540-71209-1_9openalex-snapshot
Bisimulation Minimisation Mostly Speeds Up Probabilistic Model Checking
inferred← citeshttps://doi.org/10.1007/978-3-540-72522-0_5openalex-snapshot
A Survey of Markovian Behavioral Equivalences
inferred← citeshttps://doi.org/10.1007/978-3-540-73368-3_37openalex-snapshot
Three-Valued Abstraction for Continuous-Time Markov Chains
inferred← citeshttps://doi.org/10.1007/978-3-662-54458-7_19openalex-snapshot
On the Relationship Between Bisimulation and Trace Equivalence in an Approximate Probabilistic Context
inferred← citeshttps://doi.org/10.1007/s10817-025-09736-7openalex-snapshot
Computing Expected Visiting Times and Stationary Distributions in Markov Chains: Fast and Accurate
inferred← citeshttps://doi.org/10.1016/j.ic.2018.04.002openalex-snapshot
Lumping-based equivalences in Markovian automata: Algorithms and applications to product-form analyses
inferred← citeshttps://doi.org/10.1016/j.ifacol.2018.08.016openalex-snapshot
Approximate Abstractions of Markov Chains with Interval Decision Processes
inferred← citeshttps://doi.org/10.1016/j.tcs.2019.03.018openalex-snapshot
Symbolic computation of differential equivalences
inferred← citeshttps://doi.org/10.1016/j.tcs.2020.11.001openalex-snapshot
The linear time-branching time spectrum of equivalences for stochastic systems with non-determinism
inferred← citeshttps://doi.org/10.1017/s0021900200004629openalex-snapshot
On the Relationships Between Lumpability and Filtering of Finite Stochastic Systems
inferred← citeshttps://doi.org/10.1063/1.4758074openalex-snapshot
Specification, construction, and exact reduction of state transition system models of biochemical processes
inferred← citeshttps://doi.org/10.1109/cdc.2013.6760281openalex-snapshot
Discrete abstraction for a class of stochastic hybrid systems based on bounded bisimulation
inferred← citeshttps://doi.org/10.1109/iscc.2011.5984034openalex-snapshot
Quantitative verification for response times in composite Web service model
inferred← citeshttps://doi.org/10.1109/lics52264.2021.9470555openalex-snapshot
Efficient Local Computation of Differential Bisimulations via Coupling and Up-to Methods
inferred← citeshttps://doi.org/10.1109/tse.2025.3567423openalex-snapshot
Probabilistic Bisimulation for Parameterized Anonymity and Uniformity Verification
inferred← citeshttps://doi.org/10.1145/2837614.2837649openalex-snapshot
Symbolic computation of differential equivalences
inferred← citeshttps://doi.org/10.1145/2914770.2837649openalex-snapshot
Symbolic computation of differential equivalences
inferred← citeshttps://doi.org/10.1145/3412841.3442048openalex-snapshot
Embeddings between state and action labeled probabilistic systems
inferred← citeshttps://doi.org/10.1145/3605098.3636032openalex-snapshot
A Formal Framework of Model and Logical Embeddings for Verification of Stochastic Systems
inferred← citeshttps://doi.org/10.1145/3696431openalex-snapshot
Embeddings Between State and Action Based Probabilistic Logics
inferred← citeshttps://doi.org/10.1145/3712711openalex-snapshot
Forward and Backward Constrained Bisimulations for Quantum Circuits Using Decision Diagrams
inferred← citeshttps://doi.org/10.1186/s12859-023-05326-9openalex-snapshot
Reducing Boolean networks with backward equivalence
inferred← citeshttps://doi.org/10.1239/jap/1222441821openalex-snapshot
On the Relationships Between Lumpability and Filtering of Finite Stochastic Systems
inferred← citeshttps://doi.org/10.1587/transfun.e97.a.459openalex-snapshot
Discrete Abstraction for a Class of Stochastic Hybrid Systems Based on Bounded Bisimulation
inferred← citeshttps://doi.org/10.3990/1.9789085702986openalex-snapshot
Model checking Markov Chains: Techniques and Tools
inferred← citeshttps://doi.org/10.4230/lipics.concur.2015.226openalex-snapshot
Forward and Backward Bisimulations for Chemical Reaction Networks
inferred← citeshttps://doi.org/10.6084/m9.figshare.26591429openalex-snapshot
Additional file 1 of Reducing Boolean networks with backward equivalence
inferred← citeshttps://doi.org/10.6084/m9.figshare.26591432openalex-snapshot
Additional file 2 of Reducing Boolean networks with backward equivalence
inferred← citeshttps://doi.org/10.6084/m9.figshare.26591435openalex-snapshot
Additional file 3 of Reducing Boolean networks with backward equivalence
inferred← citeshttps://doi.org/10.6084/m9.figshare.26591438openalex-snapshot
Additional file 4 of Reducing Boolean networks with backward equivalence
inferred← citeshttps://doi.org/10.6084/m9.figshare.26591441openalex-snapshot
Additional file 5 of Reducing Boolean networks with backward equivalence
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.