On the public citation graph

Compositional Performability Evaluation for STATEMATE

0 signed · 47 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.1002/j.2334-5837.2004.tb00493.xopenalex-snapshot
2.2.1 Model‐based Safety Analysis of a Flap Control System
inferredcites →https://doi.org/10.1007/3-540-45614-7_23openalex-snapshot
On Combining Functional Verification and Performance Evaluation Using CADP
inferredcites →https://doi.org/10.1007/3-540-45804-2openalex-snapshot
Interactive Markov Chains
inferredcites →https://doi.org/10.1007/3-540-46029-2_5openalex-snapshot
PhFit: A General Phase-Type Fitting Tool
inferredcites →https://doi.org/10.1007/3-540-61474-5_95openalex-snapshot
VIS: A system for verification and synthesis
inferredcites →https://doi.org/10.1007/978-1-4471-0823-8_10openalex-snapshot
Formal Verification of an Avionics Application using Abstraction and Symbolic Model Checking
inferredcites →https://doi.org/10.1007/978-1-4757-2892-7openalex-snapshot
Binary Decision Diagrams
inferredcites →https://doi.org/10.1007/s100090100072openalex-snapshot
A tool for model-checking Markov chains
inferredcites →https://doi.org/10.1016/j.tcs.2005.07.022openalex-snapshot
Efficient computation of time-bounded reachability probabilities in uniform continuous-time Markov decision processes
inferredcites →https://doi.org/10.1016/s0166-5316(02)00179-7openalex-snapshot
Fitting world-wide web request traces with the EM-algorithm
inferredcites →https://doi.org/10.1016/s0167-6423(99)00019-2openalex-snapshot
Automated compositional Markov chain generation for a plain-old telephone system
inferredcites →https://doi.org/10.1016/s1571-0661(05)80099-4openalex-snapshot
Distributed Branching Bisimulation Reduction of State Spaces
inferredcites →https://doi.org/10.1109/ddecs.2006.1649562openalex-snapshot
Minimization of Large State Spaces using Symbolic Branching Bisimulation
inferredcites →https://doi.org/10.1109/dsn.2002.1028966openalex-snapshot
PhFit: a general phase-type fitting tool
inferredcites →https://doi.org/10.1109/dsn.2005.11openalex-snapshot
A Novel Approach for Fitting Probability Distributions to Real Trace Data with the EM Algorithm
inferredcites →https://doi.org/10.1109/ipdps.2003.1213234openalex-snapshot
A train control system case study in model-based real time system design
inferredcites →https://doi.org/10.1109/memcod.2009.5185377openalex-snapshot
Verification of an industrial SystemC/TLM model using LOTOS and CADP
inferredcites →https://doi.org/10.1109/tse.2003.1205180openalex-snapshot
Model-checking algorithms for continuous-time markov chains
inferredcites →https://doi.org/10.1117/12.434316openalex-snapshot
Fitting World Wide Web request traces with the EM-algorithim
inferredcites →https://doi.org/10.1145/1071021.1071023openalex-snapshot
From StoCharts to MoDeST
inferredcites →https://doi.org/10.1145/233551.233556openalex-snapshot
Branching time and abstraction in bisimulation semantics
inferredcites →https://doi.org/10.2307/2287748openalex-snapshot
Matrix-Geometric Solutions in Stochastic Models. An Algorithmic Approach.

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-00244-2_13openalex-snapshot
Compositional Verification in Action
inferred← citeshttps://doi.org/10.1007/978-3-540-71209-1_13openalex-snapshot
A Symbolic Algorithm for Optimal Markov Chain Lumping
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-73368-3_37openalex-snapshot
Three-Valued Abstraction for Continuous-Time Markov Chains
inferred← citeshttps://doi.org/10.1007/978-3-540-75454-1_1openalex-snapshot
Abstraction of Probabilistic Systems
inferred← citeshttps://doi.org/10.1007/978-3-540-77966-7_9openalex-snapshot
How Fast and Fat Is Your Probabilistic Model Checker? An Experimental Performance Comparison
inferred← citeshttps://doi.org/10.1007/978-3-540-85361-9_25openalex-snapshot
On the Minimisation of Acyclic Models
inferred← citeshttps://doi.org/10.1007/978-3-540-88387-6_27openalex-snapshot
Model Based Importance Analysis for Minimal Cut Sets
inferred← citeshttps://doi.org/10.1007/978-3-642-04368-0_16openalex-snapshot
Compositional Abstraction for Stochastic Systems
inferred← citeshttps://doi.org/10.1007/978-3-642-22110-1_19openalex-snapshot
Model Checking Algorithms for CTMDPs
inferred← citeshttps://doi.org/10.1007/978-3-642-54013-4_6openalex-snapshot
Bisimulations and Logical Characterizations on Continuous-Time Markov Decision Processes
inferred← citeshttps://doi.org/10.1016/j.peva.2009.12.008openalex-snapshot
Symbolic partition refinement with automatic balancing of time and space
inferred← citeshttps://doi.org/10.1016/j.peva.2010.04.001openalex-snapshot
The ins and outs of the probabilistic model checker MRMC
inferred← citeshttps://doi.org/10.1016/j.ress.2014.07.003openalex-snapshot
Spacecraft early design validation using formal methods
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/memcod.2009.5185388openalex-snapshot
Codesign of dependable systems: A component-based modeling language
inferred← citeshttps://doi.org/10.1109/qest.2005.2openalex-snapshot
A Markov reward model checker
inferred← citeshttps://doi.org/10.1109/qest.2008.14openalex-snapshot
Symbolic Partition Refinement with Dynamic Balancing of Time and Space
inferred← citeshttps://doi.org/10.1109/qest.2009.11openalex-snapshot
The Ins and Outs of the Probabilistic Model Checker MRMC
inferred← citeshttps://doi.org/10.1109/qest.2009.25openalex-snapshot
Simulation-Based CTMC Model Checking: An Empirical Evaluation
inferred← citeshttps://doi.org/10.1109/tse.2008.102openalex-snapshot
Compositional Dependability Evaluation for STATEMATE
inferred← citeshttps://doi.org/10.1145/1228784.1228880openalex-snapshot
Optimization techniques for BDD-based bisimulation computation
inferred← citeshttps://doi.org/10.22028/d291-25945openalex-snapshot
Decision algorithms for probabilistic simulations
inferred← citeshttps://doi.org/10.3990/1.9789085702986openalex-snapshot
Model checking Markov Chains: Techniques and Tools
inferred← citeshttps://doi.org/10.4204/eptcs.349.1openalex-snapshot
Is CADP an Applicable Formal Method?
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.