On the public citation graph

Temporal logics for the specification of performance and reliability

https://doi.org/10.1007/bfb0023457
0 signed · 81 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/9780470316887openalex-snapshot
Markov Decision Processes
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/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/bf01191722openalex-snapshot
Models for reactivity
inferredcites →https://doi.org/10.1007/bfb0020933openalex-snapshot
Verifying clocked transition systems
inferredcites →https://doi.org/10.1007/bfb0031987openalex-snapshot
The theory of timed automata
inferredcites →https://doi.org/10.1007/bfb0032043openalex-snapshot
Markov decision processes and regular events
inferredcites →https://doi.org/10.1007/s002360050136openalex-snapshot
Polytime model checking for timed probabilistic computation tree logic
inferredcites →https://doi.org/10.1007/s004460050046openalex-snapshot
Model checking for a probabilistic branching time logic with fairness
inferredcites →https://doi.org/10.1016/b978-0-444-88074-1.50021-4openalex-snapshot
Temporal and Modal Logic
inferredcites →https://doi.org/10.1016/j.jcss.2011.08.006openalex-snapshot
Once and for all
inferredcites →https://doi.org/10.1109/real.1989.63561openalex-snapshot
A framework for reasoning about time and reliability
inferredcites →https://doi.org/10.1109/sfcs.1988.21948openalex-snapshot
On the complexity of omega -automata
inferredcites →https://doi.org/10.1126/science.153.3731.34openalex-snapshot
Dynamic Programming
inferredcites →https://doi.org/10.1145/129712.129739openalex-snapshot
Exponential determinization for ω-automata with strong-fairness acceptance condition (extended abstract)
inferredcites →https://doi.org/10.1145/318593.318620openalex-snapshot
Modalities for model checking (extended abstract)
inferredcites →https://doi.org/10.1287/opre.18.2.279openalex-snapshot
Computing a Bias-Optimal Policy in a Discrete-Time Markov Decision Problem
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.1002/9780470611012.ch9openalex-snapshot
Verification of Probabilistic Systems Methods and Tools
inferred← citeshttps://doi.org/10.1007/0-387-32520-4_23openalex-snapshot
Model Checking: Algorithms
inferred← citeshttps://doi.org/10.1007/11944836_29openalex-snapshot
On Reduction Criteria for Probabilistic Reward Models
inferred← citeshttps://doi.org/10.1007/3-540-36078-6_20openalex-snapshot
Games, Probability, and the Quantitative μ-Calculus qMμ
inferred← citeshttps://doi.org/10.1007/3-540-48778-6_2openalex-snapshot
Quantitative Program Logic and Performance in Probabilistic Distributed Algorithms
inferred← citeshttps://doi.org/10.1007/3-540-48778-6_3openalex-snapshot
Establishing Qualitative Properties for Probabilistic Lossy Channel Systems
inferred← citeshttps://doi.org/10.1007/978-3-030-45190-5_18openalex-snapshot
Farkas Certificates and Minimal Witnesses for Probabilistic Reachability Constraints
inferred← citeshttps://doi.org/10.1007/978-3-031-15629-8_2openalex-snapshot
Operational Causality – Necessarily Sufficient and Sufficiently Necessary
inferred← citeshttps://doi.org/10.1007/978-3-540-24611-4_11openalex-snapshot
Analysing Randomized Distributed Algorithms
inferred← citeshttps://doi.org/10.1007/978-3-540-24611-4_5openalex-snapshot
On Probabilistic Computation Tree Logic
inferred← citeshttps://doi.org/10.1007/978-3-540-24727-2_33openalex-snapshot
Probabilistic Bisimulation and Equivalence for Security Analysis of Network Protocols
inferred← citeshttps://doi.org/10.1007/978-3-540-31982-5_9openalex-snapshot
Model Checking Durational Probabilistic Systems
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-71209-1_15openalex-snapshot
Model Checking Probabilistic Timed Automata with One or Two Clocks
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-642-01702-5_15openalex-snapshot
Significant Diagnostic Counterexamples in Probabilistic Model Checking
inferred← citeshttps://doi.org/10.1007/978-3-642-04081-8_39openalex-snapshot
Counterexamples in Probabilistic LTL Model Checking for Markov Chains
inferred← citeshttps://doi.org/10.1007/978-3-642-13568-2_10openalex-snapshot
A Formal Language toward the Unification of Model Checking and Performance Evaluation
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-35861-6_4openalex-snapshot
The Tale of SOLOIST: A Specification Language for Service Compositions Interactions
inferred← citeshttps://doi.org/10.1007/978-3-642-37064-9_13openalex-snapshot
Maximizing Entropy over Markov Processes
inferred← citeshttps://doi.org/10.1007/978-3-642-37075-5_23openalex-snapshot
Computing Quantiles in Markov Reward Models
inferred← citeshttps://doi.org/10.1007/978-3-662-54577-5_29openalex-snapshot
Fair Termination for Parameterized Probabilistic Concurrent Systems
inferred← citeshttps://doi.org/10.1007/bfb0055639openalex-snapshot
Stochastic transition systems
inferred← citeshttps://doi.org/10.1007/s00165-018-0457-3openalex-snapshot
Computation tree measurement language (CTML)
inferred← citeshttps://doi.org/10.1007/s004460050046openalex-snapshot
Model checking for a probabilistic branching time logic with fairness
inferred← citeshttps://doi.org/10.1007/s10009-004-0140-2openalex-snapshot
Probabilistic symbolic model checking with PRISM: a hybrid approach
inferred← citeshttps://doi.org/10.1016/b978-044482830-9/50029-1openalex-snapshot
Probabilistic Extensions of Process Algebras**This chapter is dedicated to the fond memory of Linda Christoff.
inferred← citeshttps://doi.org/10.1016/j.artint.2010.04.016openalex-snapshot
The well-designed logical robot: Learning and experience from observations to the Situation Calculus
inferred← citeshttps://doi.org/10.1016/j.entcs.2009.05.031openalex-snapshot
Branching-Time Model-Checking of Probabilistic Pushdown Automata
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.2019.02.003openalex-snapshot
Sublogics of a branching time logic of robustness
inferred← citeshttps://doi.org/10.1016/j.jlamp.2014.05.001openalex-snapshot
Maximizing entropy over Markov processes
inferred← citeshttps://doi.org/10.1016/j.tcs.2005.10.044openalex-snapshot
A probabilistic polynomial-time process calculus for the analysis of cryptographic protocols
inferred← citeshttps://doi.org/10.1016/j.tcs.2007.05.008openalex-snapshot
Model checking mobile stochastic logic
inferred← citeshttps://doi.org/10.1016/s0304-3975(01)00049-4openalex-snapshot
Quantitative program logic and expected time bounds in probabilistic distributed algorithms
inferred← citeshttps://doi.org/10.1016/s1571-0661(04)80967-8openalex-snapshot
A Generalisation of Stationary Distributions, and Probabilistic Program Algebra
inferred← citeshttps://doi.org/10.1016/s1571-0661(04)80968-xopenalex-snapshot
A Probabilistic Polynomial-time Calculus For Analysis of Cryptographic Protocols
inferred← citeshttps://doi.org/10.1016/s1571-0661(05)80597-3openalex-snapshot
From Fairness to Chance
inferred← citeshttps://doi.org/10.1016/s1571-0661(05)80600-0openalex-snapshot
Reasoning about efficiency within a probabilistic μ-calculus
inferred← citeshttps://doi.org/10.1109/ecbs.2009.44openalex-snapshot
Modeling and Analysis of Probabilistic Timed Systems
inferred← citeshttps://doi.org/10.1109/lics.1998.705679openalex-snapshot
How to specify and verify the long-run average behaviour of probabilistic systems
inferred← citeshttps://doi.org/10.1109/memcod.2003.1210081openalex-snapshot
Executable computational logics: combining formal methods and programming language based system design
inferred← citeshttps://doi.org/10.1109/qest.2004.1348035openalex-snapshot
Trading memory for randomness
inferred← citeshttps://doi.org/10.1109/qest.2004.1348038openalex-snapshot
Partial order reduction on concurrent probabilistic programs
inferred← citeshttps://doi.org/10.1109/qest.2004.31openalex-snapshot
Partial order reduction on concurrent probabilistic programs
inferred← citeshttps://doi.org/10.1109/qest.2007.38openalex-snapshot
Stochastic Game Logic
inferred← citeshttps://doi.org/10.1109/qest.2008.45openalex-snapshot
Reduction Techniques for Model Checking Markov Decision Processes
inferred← citeshttps://doi.org/10.1109/sfcs.2005.19openalex-snapshot
Analysis and Prediction of the Long-Run Behavior of Probabilistic Sequential Programs with Recursion (Extended Abstract)
inferred← citeshttps://doi.org/10.1109/soca.2014.14openalex-snapshot
Offline Trace Checking of Quantitative Properties of Service-Based Applications
inferred← citeshttps://doi.org/10.1109/tse.2003.1205180openalex-snapshot
Model-checking algorithms for continuous-time markov chains
inferred← citeshttps://doi.org/10.1145/1081180.1081182openalex-snapshot
Quantitative analysis of distributed randomized protocols
inferred← citeshttps://doi.org/10.1145/1182613.1182616openalex-snapshot
Results on the quantitative μ-calculus qM μ
inferred← citeshttps://doi.org/10.1145/2699430openalex-snapshot
Measuring and Synthesizing Systems in Probabilistic Environments
inferred← citeshttps://doi.org/10.1145/288090.288117openalex-snapshot
A probabilistic poly-time framework for protocol analysis
inferred← citeshttps://doi.org/10.2168/lmcs-4(3:12)2008openalex-snapshot
Model Checking Probabilistic Timed Automata with One or Two Clocks
inferred← citeshttps://doi.org/10.2168/lmcs-5(2:7)2009openalex-snapshot
Qualitative Logics and Equivalences for Probabilistic Systems
inferred← citeshttps://doi.org/10.26226/morressier.604907f51a80aac83ca25d85openalex-snapshot
Farkas certificates and minimal witnesses for probabilistic reachability constraints
inferred← citeshttps://doi.org/10.48550/arxiv.1004.0739openalex-snapshot
Measuring and Synthesizing Systems in Probabilistic Environments
inferred← citeshttps://doi.org/10.48550/arxiv.1710.10756openalex-snapshot
Fair Termination for Parameterized Probabilistic Concurrent Systems (Technical Report)
inferred← citeshttps://doi.org/10.48550/arxiv.cs/0309024openalex-snapshot
Results on the quantitative mu-calculus qMu
inferred← citeshttps://doi.org/10.7907/reb5-bb43openalex-snapshot
Inference in Hybrid Systems with Applications in Neural Prosthetics
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.