On the public citation graph

Stochastic transition systems

https://doi.org/10.1007/bfb0055639
0 signed · 45 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/3-540-61604-7_63openalex-snapshot
Extended Markovian Process Algebra
inferredcites →https://doi.org/10.1007/3-540-63165-8_192openalex-snapshot
An algebra-based method to associate rewards with EMPA terms
inferredcites →https://doi.org/10.1007/978-1-4684-9455-6openalex-snapshot
Denumerable Markov Chains
inferredcites →https://doi.org/10.1007/978-3-540-48654-1_35openalex-snapshot
Probabilistic Simulations for Probabilistic Processes
inferredcites →https://doi.org/10.1007/bfb0013851openalex-snapshot
Multiprocessor and distributed system design: The integration of functional specification and performance analysis using Stochastic Process Algebras
inferredcites →https://doi.org/10.1007/bfb0023457openalex-snapshot
Temporal logics for the specification of performance and reliability
inferredcites →https://doi.org/10.1007/bfb0031986openalex-snapshot
Verifying automata specifications of probabilistic real-time systems
inferredcites →https://doi.org/10.1007/s004460050046openalex-snapshot
Model checking for a probabilistic branching time logic with fairness
inferredcites →https://doi.org/10.1016/0166-5316(91)90003-lopenalex-snapshot
On the solution of GSPN reward models
inferredcites →https://doi.org/10.1017/cbo9780511569951openalex-snapshot
A Compositional Approach to Performance Modelling
inferredcites →https://doi.org/10.1109/lics.1998.705679openalex-snapshot
How to specify and verify the long-run average behaviour of probabilistic systems
inferredcites →https://doi.org/10.1109/sfcs.1985.12openalex-snapshot
Automatic verification of probabilistic concurrent finite state programs
inferredcites →https://doi.org/10.1145/190.191openalex-snapshot
A class of generalized stochastic Petri nets for the performance evaluation of multiprocessor systems
inferredcites →https://doi.org/10.1145/2166.357214openalex-snapshot
Termination of Probabilistic Concurrent Program

What points at this work

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

inferred← citeshttps://doi.org/10.1002/9781119131151.ch1openalex-snapshot
Modeling and Verification of Distributed Systems Using Markov Decision Processes
inferred← citeshttps://doi.org/10.1007/11804192_19openalex-snapshot
Partial Order Reduction for Markov Decision Processes: A Survey
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-44685-0_24openalex-snapshot
Compositional Methods for Probabilistic Systems
inferred← citeshttps://doi.org/10.1007/3-540-44881-0_6openalex-snapshot
Rewriting Logic and Probabilities
inferred← citeshttps://doi.org/10.1007/3-540-45061-0_79openalex-snapshot
Discounting the Future in Systems Theory
inferred← citeshttps://doi.org/10.1007/3-540-45605-8_7openalex-snapshot
Probabilistic Unfoldings and Partial Order Fairness in Petri Nets
inferred← citeshttps://doi.org/10.1007/3-540-48320-9_12openalex-snapshot
Approximative Symbolic Model Checking of Continuous-Time Markov Chains
inferred← citeshttps://doi.org/10.1007/3-540-48320-9_7openalex-snapshot
Computing Minimum and Maximum Reachability Times in Probabilistic Systems
inferred← citeshttps://doi.org/10.1007/978-3-319-23267-6_12openalex-snapshot
Markov Decision Petri Nets with Uncertainty
inferred← citeshttps://doi.org/10.1007/978-3-319-66335-7_12openalex-snapshot
Mean-Payoff Optimization in Continuous-Time Markov Chains with Parametric Alarms
inferred← citeshttps://doi.org/10.1007/978-3-540-24611-4_1openalex-snapshot
Probabilistic Automata: System Types, Parallel Composition and Comparison
inferred← citeshttps://doi.org/10.1007/978-3-540-73094-1_6openalex-snapshot
Markov Decision Petri Net and Markov Decision Well-Formed Net Formalisms
inferred← citeshttps://doi.org/10.1007/978-3-540-85194-3_7openalex-snapshot
From Gene Regulation to Stochastic Fusion
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-04761-9_12openalex-snapshot
Quantitative Analysis under Fairness Constraints
inferred← citeshttps://doi.org/10.1007/978-3-642-14295-6_34openalex-snapshot
Measuring and Synthesizing Systems in Probabilistic Environments
inferred← citeshttps://doi.org/10.1007/978-3-642-32332-4openalex-snapshot
Modeling Time in Computing
inferred← citeshttps://doi.org/10.1016/j.entcs.2005.10.034openalex-snapshot
Partial Order Reduction for Probabilistic Branching Time
inferred← citeshttps://doi.org/10.1016/s1567-8326(02)00066-8openalex-snapshot
On the use of MTBDDs for performability analysis and verification of stochastic systems
inferred← citeshttps://doi.org/10.1109/32.962559openalex-snapshot
Performance evaluation of mobile processes via abstract machines
inferred← citeshttps://doi.org/10.1109/access.2023.3272672openalex-snapshot
stohMCharts: A Modeling Framework for Quantitative Performance Evaluation of Cyber-Physical-Social Systems
inferred← citeshttps://doi.org/10.1109/dsn.2007.96openalex-snapshot
Uniformity by Construction in the Analysis of Nondeterministic Stochastic Systems
inferred← citeshttps://doi.org/10.1109/lics.2005.41openalex-snapshot
Recognizing ?-regular Languages with Probabilistic Automata
inferred← citeshttps://doi.org/10.1109/qest.2004.1348037openalex-snapshot
Partial order reduction for probabilistic systems
inferred← citeshttps://doi.org/10.1109/qest.2004.30openalex-snapshot
Partial order reduction for probabilistic systems
inferred← citeshttps://doi.org/10.1145/2699430openalex-snapshot
Measuring and Synthesizing Systems in Probabilistic Environments
inferred← citeshttps://doi.org/10.4204/eptcs.50.2openalex-snapshot
Synthesizing Systems with Optimal Average-Case Behavior for Ratio Objectives
inferred← citeshttps://doi.org/10.4236/jsea.2011.41002openalex-snapshot
An Extension to Pi-Calculus for Performance Evaluation
inferred← citeshttps://doi.org/10.70675/0e81790azc9bez4d63zac70ze4932217ec61openalex-snapshot
Automate sur les structures temporisée
inferred← citeshttps://doi.org/10.70675/7863a139z5be3z4d9fzb137za42437f16d63openalex-snapshot
Modeling and simulation of hybrid systems and cell factory applications
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.