On the public citation graph
Verifying automata specifications of probabilistic real-time systems
0 signed · 67 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.1994.1035openalex-snapshot
A Partial Approach to Model Checking
inferredcites →https://doi.org/10.1007/3-540-54233-7_128openalex-snapshot
Model-checking for probabilistic real-time systems
inferredcites →https://doi.org/10.1007/978-1-4612-1050-4openalex-snapshot
Regeneration and Networks of Queues
inferredcites →https://doi.org/10.1007/bf01995674openalex-snapshot
Specifying real-time properties with metric temporal logic
inferredcites →https://doi.org/10.1007/bfb0032042openalex-snapshot
Automata for modeling real-time systems
inferredcites →https://doi.org/10.1016/0167-6423(83)90017-5openalex-snapshot
Using branching time temporal logic to synthesize synchronization skeletons
inferredcites →https://doi.org/10.1016/0890-5401(92)90017-aopenalex-snapshot
Symbolic model checking: 1020 States and beyond
inferredcites →https://doi.org/10.1016/b978-0-444-88074-1.50009-3openalex-snapshot
Automata on Infinite Objects
inferredcites →https://doi.org/10.1016/s0019-9958(82)91022-1openalex-snapshot
Reasoning with time and chance
inferredcites →https://doi.org/10.1109/lics.1990.113763openalex-snapshot
A logic of concrete time intervals
inferredcites →https://doi.org/10.1109/lics.1990.113766openalex-snapshot
Model-checking for real-time systems
inferredcites →https://doi.org/10.1109/lics.1990.113767openalex-snapshot
Symbolic model checking: 10/sup 20/ states and beyond
inferredcites →https://doi.org/10.1109/lics.1991.151664openalex-snapshot
A partial approach to model checking
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.1985.12openalex-snapshot
Automatic verification of probabilistic concurrent finite state programs
inferredcites →https://doi.org/10.1109/sfcs.1988.21950openalex-snapshot
Verifying temporal properties of finite-state probabilistic programs
inferredcites →https://doi.org/10.1287/moor.5.4.494openalex-snapshot
Continuity of Generalized Semi-Markov Processes
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1007/0-387-24098-5_2openalex-snapshot
Information Flow Analysis for Probabilistic Timed Automata
inferred← citeshttps://doi.org/10.1007/11599555_33openalex-snapshot
Deductive Probabilistic Verification Methods of Safety, Liveness and Nonzenoness for Distributed Real-Time Systems
inferred← citeshttps://doi.org/10.1007/3-540-36190-1_8openalex-snapshot
Timed Verification of Asynchronous Circuits
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-56496-9_22openalex-snapshot
Verification with real-time COSPAN
inferred← citeshttps://doi.org/10.1007/3-540-60692-0_70openalex-snapshot
Model checking of probabilistic and nondeterministic systems
inferred← citeshttps://doi.org/10.1007/3-540-61042-1_55openalex-snapshot
Probabilistic duration automata for analyzing real-time systems
inferred← citeshttps://doi.org/10.1007/3-540-61474-5_57openalex-snapshot
Polynomial time algorithms for testing probabilistic bisimulation and simulation
inferred← citeshttps://doi.org/10.1007/3-540-63165-8_199openalex-snapshot
Symbolic model checking for probabilistic processes
inferred← citeshttps://doi.org/10.1007/978-3-319-07650-8_15openalex-snapshot
Communication Security Prognosis Realized as the Parallel Dynamic Auditing Intelligent System
inferred← citeshttps://doi.org/10.1007/978-3-540-24611-4_6openalex-snapshot
Model Checking for Probabilistic Timed Systems
inferred← citeshttps://doi.org/10.1007/978-3-540-30121-9_18openalex-snapshot
Deductive Probabilistic Verification Methods for Embedded and Ubiquitous Computing
inferred← citeshttps://doi.org/10.1007/978-3-540-40965-6_18openalex-snapshot
Probabilistic Timed Simulation Verification and Its Application to Stepwise Refinement of Real-Time Systems
inferred← citeshttps://doi.org/10.1007/978-3-540-74510-5_11openalex-snapshot
Decidability of Parameterized Probabilistic Information Flow
inferred← citeshttps://doi.org/10.1007/978-3-540-77050-3_15openalex-snapshot
Probabilistic and Topological Semantics for Timed Automata
inferred← citeshttps://doi.org/10.1007/978-3-642-15375-4_15openalex-snapshot
Stochastic Real-Time Games with Qualitative Timed Automata Objectives
inferred← citeshttps://doi.org/10.1007/978-3-642-23217-6_10openalex-snapshot
Fixed-Delay Events in Generalized Semi-Markov Processes Revisited
inferred← citeshttps://doi.org/10.1007/978-3-642-40196-1_30openalex-snapshot
Transient Analysis of Networks of Stochastic Timed Automata Using Stochastic State Classes
inferred← citeshttps://doi.org/10.1007/978-3-642-41674-3_176openalex-snapshot
Model Checking Probabilistic Timed Systems against Timed Automata Specification
inferred← citeshttps://doi.org/10.1007/978-3-642-41687-3_15openalex-snapshot
The System Conception of Investigation of the Communication Security Level in Networks
inferred← citeshttps://doi.org/10.1007/978-3-642-59615-5_10openalex-snapshot
Probabilistic Model Checking: Formalisms and Algorithms for Discrete and Real-time Systems
inferred← citeshttps://doi.org/10.1007/978-94-015-9586-5_18openalex-snapshot
Interleaving Model and Verification of Distributed Probabilistic Real-time Systems
inferred← citeshttps://doi.org/10.1007/bf01211866openalex-snapshot
A logic for reasoning about time and reliability
inferred← citeshttps://doi.org/10.1007/bf02946502openalex-snapshot
Verifying automata specification of distributed probabilistic real-time systems
inferred← citeshttps://doi.org/10.1007/s004460050046openalex-snapshot
Model checking for a probabilistic branching time logic with fairness
inferred← citeshttps://doi.org/10.1016/0304-3975(94)90010-8openalex-snapshot
A theory of timed automata
inferred← citeshttps://doi.org/10.1016/j.entcs.2004.01.020openalex-snapshot
Automatic Analysis of a Non-Repudiation Protocol
inferred← citeshttps://doi.org/10.1016/j.entcs.2004.02.011openalex-snapshot
Automatic Analysis of the NRL Pump
inferred← citeshttps://doi.org/10.1016/j.entcs.2005.10.038openalex-snapshot
A Classification of Time and/or Probability Dependent Security Properties
inferred← citeshttps://doi.org/10.1016/j.tcs.2010.09.003openalex-snapshot
Weak bisimulation for Probabilistic Timed Automata
inferred← citeshttps://doi.org/10.1016/s0020-0190(01)00288-5openalex-snapshot
A note on the verification of automata specifications of probabilistic real-time systems
inferred← citeshttps://doi.org/10.1016/s0304-3975(01)00215-8openalex-snapshot
On probabilistic timed automata
inferred← citeshttps://doi.org/10.1016/s1567-8326(02)00023-1openalex-snapshot
Symbolic model checking of timed guarded commands using difference decision diagrams
inferred← citeshttps://doi.org/10.1109/async.1994.656281openalex-snapshot
Bounded delay timing analysis of a class of CSP programs with choice
inferred← citeshttps://doi.org/10.1109/icdcsw.2004.1284097openalex-snapshot
Deductive verification of probabilistic real-time systems
inferred← citeshttps://doi.org/10.1109/lics.2013.41openalex-snapshot
Expressive Completeness for Metric Temporal Logic
inferred← citeshttps://doi.org/10.1109/qest.2012.10openalex-snapshot
Almost-Sure Model-Checking of Reactive Timed Automata
inferred← citeshttps://doi.org/10.1109/tse.2010.4openalex-snapshot
Time and Probability-Based Information Flow Analysis
inferred← citeshttps://doi.org/10.1109/tse.2010.88openalex-snapshot
Guest Editors' Introduction: 2008 Conference on the Foundations of Software Engineering
inferred← citeshttps://doi.org/10.1109/wstfes.2003.1201366openalex-snapshot
Formal probabilistic refinement verification of embedded real-time systems
inferred← citeshttps://doi.org/10.1145/1967701.1967709openalex-snapshot
Measuring performance of continuous-time stochastic processes using timed automata
inferred← citeshttps://doi.org/10.2168/lmcs-3(3:3)2007openalex-snapshot
Probabilistic Interval Temporal Logic and Duration Calculus with Infinite Intervals: Complete Proof Systems
inferred← citeshttps://doi.org/10.3233/fi-2009-171openalex-snapshot
A Decidable Probability Logic for Timed Probabilistic Systems
inferred← citeshttps://doi.org/10.3233/fun-2002-50101openalex-snapshot
Markov Decision Processes and Deterministic Büchi Automata
inferred← citeshttps://doi.org/10.47749/t/unicamp.2003.293010openalex-snapshot
Grau de indecidibilidade da universidade para subclasses de automatos temporizados
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.