On the public citation graph

Approximate Verification of the Symbolic Dynamics of Markov Chains

0 signed · 58 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.1007/0-387-32792-4openalex-snapshot
Non-negative Matrices and Markov Chains
inferredcites →https://doi.org/10.1007/3-540-45793-3_21openalex-snapshot
A Logic of Probability with Decidable Model-Checking
inferredcites →https://doi.org/10.1007/3-540-48778-6_16openalex-snapshot
Probabilistic Linear-Time Model Checking: An Overview of the Automata-Theoretic Approach
inferredcites →https://doi.org/10.1007/3-540-63165-8_199openalex-snapshot
Symbolic model checking for probabilistic processes
inferredcites →https://doi.org/10.1007/978-1-4471-3267-7openalex-snapshot
Markov Chains and Stochastic Stability
inferredcites →https://doi.org/10.1007/978-1-4613-8928-6_23openalex-snapshot
On a Decision Method in Restricted Second Order Arithmetic
inferredcites →https://doi.org/10.1007/978-3-540-30482-1_21openalex-snapshot
Linear Inequality LTL (iLTL): A Model Checker for Discrete Time Markov Chains
inferredcites →https://doi.org/10.1007/978-3-540-45187-7_32openalex-snapshot
Comparative Branching-Time Semantics for Markov Chains
inferredcites →https://doi.org/10.1007/978-3-540-78499-9_22openalex-snapshot
Model-Checking ω-Regular Properties of Interval Markov Chains
inferredcites →https://doi.org/10.1007/978-3-642-21254-3_21openalex-snapshot
Decision Problems for Interval Markov Chains
inferredcites →https://doi.org/10.1007/978-3-642-21455-4_3openalex-snapshot
Automated Verification Techniques for Probabilistic Systems
inferredcites →https://doi.org/10.1007/978-3-642-22110-1_47openalex-snapshot
PRISM 4.0: Verification of Probabilistic Real-Time Systems
inferredcites →https://doi.org/10.1007/978-3-642-33512-9_3openalex-snapshot
Decision Problems for Linear Recurrence Sequences
inferredcites →https://doi.org/10.1007/978-3-642-36742-7_3openalex-snapshot
LTL Model Checking of Interval Markov Chains
inferredcites →https://doi.org/10.1007/978-3-7091-9459-1_3openalex-snapshot
A Decision Method for Elementary Algebra and Geometry
inferredcites →https://doi.org/10.1007/bf01211866openalex-snapshot
A logic for reasoning about time and reliability
inferredcites →https://doi.org/10.1007/bf02230720openalex-snapshot
Unzerlegbare, nicht negative Matrizen
inferredcites →https://doi.org/10.1016/0016-0032(60)90676-1openalex-snapshot
An introduction to the theory of numbers
inferredcites →https://doi.org/10.1016/0304-3975(94)90010-8openalex-snapshot
A theory of timed automata
inferredcites →https://doi.org/10.1016/j.ijar.2009.06.007openalex-snapshot
Discrete time Markov chains with interval probabilities
inferredcites →https://doi.org/10.1016/j.tcs.2011.05.010openalex-snapshot
Constraint Markov Chains
inferredcites →https://doi.org/10.1016/s0024-3795(02)00414-7openalex-snapshot
Wielandt's proof of the exponent inequality for primitive nonnegative matrices
inferredcites →https://doi.org/10.1016/s0888-613x(00)00032-3openalex-snapshot
The theory of interval-probability as a unifying concept for uncertainty
inferredcites →https://doi.org/10.1017/9781108899727openalex-snapshot
An Introduction to Symbolic Dynamics and Coding
inferredcites →https://doi.org/10.1017/cbo9780511616488openalex-snapshot
Performance Analysis of Communications Networks and Systems
inferredcites →https://doi.org/10.1017/cbo9780511623639openalex-snapshot
Theory of Algebraic Integers
inferredcites →https://doi.org/10.1017/cbo9780511810633openalex-snapshot
Markov Chains
inferredcites →https://doi.org/10.1017/s0025557200071461openalex-snapshot
An Introduction to the Theory of Numbers. By G. H. Hardy and E. M. Wright. 2nd edition. Pp. xvi, 407 25s. 1945. (Oxford)
inferredcites →https://doi.org/10.1023/a:1014745904458openalex-snapshot
Interval-Valued Finite Markov Chains
inferredcites →https://doi.org/10.1109/lics.1991.151651openalex-snapshot
Specification and refinement of probabilistic processes
inferredcites →https://doi.org/10.1109/lics.1996.561342openalex-snapshot
The theory of hybrid automata
inferredcites →https://doi.org/10.1109/lics.1997.614940openalex-snapshot
Quantitative analysis and model checking
inferredcites →https://doi.org/10.1109/lics.2012.17openalex-snapshot
Approximate Verification of the Symbolic Dynamics of Markov Chains
inferredcites →https://doi.org/10.1109/memcod.2004.1459815openalex-snapshot
PROBMELA: a modeling language for communicating probabilistic processes
inferredcites →https://doi.org/10.1109/qest.2009.42openalex-snapshot
Using Stochastic Comparison for Efficient Model Checking of Uncertain Markov Chains
inferredcites →https://doi.org/10.1109/qest.2010.35openalex-snapshot
Reasoning about MDPs as Transformers of Probability Distributions
inferredcites →https://doi.org/10.1109/qest.2011.22openalex-snapshot
Model Checking MDPs with a Unique Compact Invariant Set of Distributions
inferredcites →https://doi.org/10.1109/tse.2010.80openalex-snapshot
Verifying the Evolution of Probability Distributions Governed by a DTMC
inferredcites →https://doi.org/10.1145/1059816.1059819openalex-snapshot
Model checking meets performance evaluation
inferredcites →https://doi.org/10.1186/1752-0509-4-42openalex-snapshot
Solving the chemical master equation using sliding windows
inferredcites →https://doi.org/10.1525/9780520348097openalex-snapshot
A Decision Method for Elementary Algebra and Geometry
inferredcites →https://doi.org/10.2307/2309264openalex-snapshot
Finite Markov Chains.
inferredcites →https://doi.org/10.2307/2371264openalex-snapshot
Symbolic Dynamics

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-319-10696-0_26openalex-snapshot
Decidable Problems for Unary PFAs
inferred← citeshttps://doi.org/10.1007/978-3-319-11936-6_26openalex-snapshot
Nested Reachability Approximation for Discrete-Time Markov Chains with Univariate Parameters
inferred← citeshttps://doi.org/10.1007/978-3-642-54830-7_4openalex-snapshot
Limit Synchronization in Markov Decision Processes
inferred← citeshttps://doi.org/10.1007/978-3-662-44584-6_17openalex-snapshot
Robust Synchronization in Markov Decision Processes
inferred← citeshttps://doi.org/10.1007/978-3-662-44584-6_18openalex-snapshot
Probabilistic Bisimulation: Naturally on Distributions
inferred← citeshttps://doi.org/10.1016/j.cie.2019.106092openalex-snapshot
Research of an integrated decision model for production scheduling and maintenance planning with economic objective
inferred← citeshttps://doi.org/10.1016/j.jlamp.2018.03.004openalex-snapshot
When are stochastic transition systems tameable?
inferred← citeshttps://doi.org/10.1145/2629417openalex-snapshot
Approximate Verification of the Symbolic Dynamics of Markov Chains
inferred← citeshttps://doi.org/10.1145/2666772openalex-snapshot
Decidability of Approximate Skolem Problem and Applications to Logical Verification of Dynamical Properties of Markov Chains
inferred← citeshttps://doi.org/10.1145/3209108.3209185openalex-snapshot
Distribution-based objectives for Markov Decision Processes
inferred← citeshttps://doi.org/10.1145/3531130.3532439openalex-snapshot
Stochastic Games with Synchronizing Objectives
inferred← citeshttps://doi.org/10.1145/3588866openalex-snapshot
Stochastic Games with Synchronization Objectives
inferred← citeshttps://doi.org/10.46298/lmcs-17(3:10)2021openalex-snapshot
Distribution Bisimilarity via the Power of Convex Algebras
inferred← citeshttps://doi.org/10.5555/2634074.2634101openalex-snapshot
Positivity problems for low-order linear recurrence sequences
showing the first 14 of 15 · page through all 15
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.