On the public citation graph

Probabilistic Model Checking of Deadline Properties in the IEEE 1394 FireWire Root Contention Protocol

https://doi.org/10.1007/s001650300007
0 signed · 123 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.1006/inco.1995.1059openalex-snapshot
Timing Verification by Successive Approximation
inferredcites →https://doi.org/10.1007/3-540-44804-7_3openalex-snapshot
Reachability Analysis of Probabilistic Systems by Successive Refinements
inferredcites →https://doi.org/10.1007/3-540-45251-6_18openalex-snapshot
Improvements in BDD-Based Reachability Analysis of Timed Automata
inferredcites →https://doi.org/10.1007/3-540-45319-9_14openalex-snapshot
Linear Parametric Model Checking of Timed Automata
inferredcites →https://doi.org/10.1007/3-540-45605-8_11openalex-snapshot
Probabilistic Model Checking of the IEEE 802.11 Wireless Local Area Network Protocol
inferredcites →https://doi.org/10.1007/3-540-46029-2_13openalex-snapshot
PRISM: Probabilistic Symbolic Model Checker
inferredcites →https://doi.org/10.1007/3-540-46419-0_27openalex-snapshot
Symbolic Model Checking of Probabilistic Processes Using MTBDDs and the Kronecker Representation
inferredcites →https://doi.org/10.1007/3-540-48153-2_11openalex-snapshot
Efficient Verification of Timed Automata Using Dense and Discrete Time Semantics
inferredcites →https://doi.org/10.1007/3-540-48778-6_4openalex-snapshot
Root Contention in IEEE 1394
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/3-540-55719-9_103openalex-snapshot
What good are digital clocks?
inferredcites →https://doi.org/10.1007/3-540-60630-0_3openalex-snapshot
A user guide to HyTech
inferredcites →https://doi.org/10.1007/978-0-387-34878-0_18openalex-snapshot
Automatic Verification of Real-Time Communicating Systems by Constraint-Solving
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/978-3-540-69850-0_12openalex-snapshot
DESIGN AND SYNTHESIS OF SYNCHRONIZATION SKELETONS USING BRANCHING TIME TEMPORAL LOGIC
inferredcites →https://doi.org/10.1007/bf01211866openalex-snapshot
A logic for reasoning about time and reliability
inferredcites →https://doi.org/10.1007/bfb0015027openalex-snapshot
Probabilistic simulations for probabilistic processes
inferredcites →https://doi.org/10.1007/bfb0020947openalex-snapshot
The tool Kronos
inferredcites →https://doi.org/10.1007/bfb0054180openalex-snapshot
Model checking of real-time reachability properties using abstractions
inferredcites →https://doi.org/10.1007/bfb0055642openalex-snapshot
On discretization of delays in timed automata and digital circuits
inferredcites →https://doi.org/10.1007/bfb0070486openalex-snapshot
Proof of Theorem 2
inferredcites →https://doi.org/10.1007/s001650300006openalex-snapshot
But What if I Don't Want to Wait Forever?
inferredcites →https://doi.org/10.1007/s004460050046openalex-snapshot
Model checking for a probabilistic branching time logic with fairness
inferredcites →https://doi.org/10.1007/s10009-003-0118-5openalex-snapshot
Automatic verification of the IEEE 1394 root contention protocol with KRONOS and PRISM
inferredcites →https://doi.org/10.1007/s100090050008openalex-snapshot
HYTECH: a model checker for hybrid systems
inferredcites →https://doi.org/10.1007/s100090050010openalex-snapshot
Uppaal in a nutshell
inferredcites →https://doi.org/10.1007/s100090100059openalex-snapshot
Mechanical verification of the IEEE 1394a root contention protocol using Uppaal2k
inferredcites →https://doi.org/10.1016/0022-0000(81)90036-2openalex-snapshot
Semantics of probabilistic programs
inferredcites →https://doi.org/10.1016/0304-3975(94)90010-8openalex-snapshot
A theory of timed automata
inferredcites →https://doi.org/10.1016/s0304-3975(01)00046-9openalex-snapshot
Automatic verification of real-time systems with discrete probability distributions
inferredcites →https://doi.org/10.1023/a:1008647823331openalex-snapshot
Multi-Terminal Binary Decision Diagrams: An Efficient Data Structure for Matrix Representation
inferredcites →https://doi.org/10.1109/real.1995.495197openalex-snapshot
Two examples of verification of multirate timed automata with Kronos
inferredcites →https://doi.org/10.1109/rtcsa.2000.896393openalex-snapshot
Parametric verification of the IEEE 1394a Root Contention protocol using LPMC
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.2003.1238173openalex-snapshot
Proceedings 44th IEEE Symposium on Foundations of Computer Science - FOCS 2003
inferredcites →https://doi.org/10.1145/2166.357214openalex-snapshot
Termination of Probabilistic Concurrent Program
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.ch8openalex-snapshot
Verification of Real‐Time Probabilistic Systems
inferred← citeshttps://doi.org/10.1002/9781118459898.ch7openalex-snapshot
Practical Applications of Probabilistic Model Checking to Communication Protocols
inferred← citeshttps://doi.org/10.1002/9781118569351.biblioopenalex-snapshot
Bibliography
inferred← citeshttps://doi.org/10.1002/9781118569351.ch4openalex-snapshot
Behavioral Cartography of Timed Automata
inferred← citeshttps://doi.org/10.1007/11562948_29openalex-snapshot
An MTBDD-Based Implementation of Forward Reachability for Probabilistic Timed Automata
inferred← citeshttps://doi.org/10.1007/11563228_3openalex-snapshot
Combining Extended UML Models and Formal Methods to Analyze Real-Time Systems
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-36135-9_13openalex-snapshot
Verifying Randomized Byzantine Agreement_
inferred← citeshttps://doi.org/10.1007/3-540-45605-8_11openalex-snapshot
Probabilistic Model Checking of the IEEE 802.11 Wireless Local Area Network Protocol
inferred← citeshttps://doi.org/10.1007/978-3-030-30923-7_7openalex-snapshot
Statistical Model Checking of Complex Robotic Systems
inferred← citeshttps://doi.org/10.1007/978-3-030-59152-6_28openalex-snapshot
Minimal Witnesses for Probabilistic Timed Automata
inferred← citeshttps://doi.org/10.1007/978-3-031-13188-2_21openalex-snapshot
MoGym: Using Formal Models for Training and Verifying Decision-making Agents
inferred← citeshttps://doi.org/10.1007/978-3-031-62697-5_2openalex-snapshot
A Probabilistic Choreography Language for PRISM
inferred← citeshttps://doi.org/10.1007/978-3-319-11900-7_12openalex-snapshot
Optimizing Robotic Team Performance with Probabilistic Model Checking
inferred← citeshttps://doi.org/10.1007/978-3-319-39086-4_16openalex-snapshot
Probabilistic Time Petri Nets
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_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-30206-3_21openalex-snapshot
Symbolic Model Checking for Probabilistic Timed Automata
inferred← citeshttps://doi.org/10.1007/978-3-540-40903-8_9openalex-snapshot
Performance Analysis of Probabilistic Timed Automata Using Digital Clocks
inferred← citeshttps://doi.org/10.1007/978-3-540-69209-6_18openalex-snapshot
Modeling and Validation of Aviation Security
inferred← citeshttps://doi.org/10.1007/978-3-642-15297-9_17openalex-snapshot
Simulation and Bisimulation for Probabilistic Timed Automata
inferred← citeshttps://doi.org/10.1007/978-3-642-15349-5_5openalex-snapshot
Behavioral Cartography of Timed Automata
inferred← citeshttps://doi.org/10.1007/978-3-642-16242-8openalex-snapshot
Logic for Programming, Artificial Intelligence, and Reasoning
inferred← citeshttps://doi.org/10.1007/978-3-642-16242-8_22openalex-snapshot
Superposition-Based Analysis of First-Order Probabilistic Timed Automata
inferred← citeshttps://doi.org/10.1007/978-3-642-35632-2_30openalex-snapshot
Incremental Runtime Verification of Probabilistic Systems
inferred← citeshttps://doi.org/10.1007/978-3-642-39176-7_9openalex-snapshot
Probabilistic Verification of Coordinated Multi-robot Missions
inferred← citeshttps://doi.org/10.1007/s001650300001openalex-snapshot
IEEE 1394 Tree Identify Protocol: Introduction to the Case Study
inferred← citeshttps://doi.org/10.1007/s001650300006openalex-snapshot
But What if I Don't Want to Wait Forever?
inferred← citeshttps://doi.org/10.1007/s001650300009openalex-snapshot
Fun with FireWire: A Comparative Study of Formal Verification Methods Applied to the IEEE 1394 Root Contention Protocol
inferred← citeshttps://doi.org/10.1007/s10009-003-0118-5openalex-snapshot
Automatic verification of the IEEE 1394 root contention protocol with KRONOS and PRISM
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.1007/s10009-006-0014-xopenalex-snapshot
A formal analysis of bluetooth device discovery
inferred← citeshttps://doi.org/10.1007/s10703-006-0005-2openalex-snapshot
Performance analysis of probabilistic timed automata using digital clocks
inferred← citeshttps://doi.org/10.1007/s10703-012-0169-xopenalex-snapshot
An extension of the inverse method to probabilistic timed automata
inferred← citeshttps://doi.org/10.1007/s10703-012-0177-xopenalex-snapshot
Model checking for probabilistic timed automata
inferred← citeshttps://doi.org/10.1007/s10703-020-00348-yopenalex-snapshot
Exact quantitative probabilistic model checking through rational search
inferred← citeshttps://doi.org/10.1007/s11042-014-2095-yopenalex-snapshot
Advanced verification on WBAN and cloud computing for u-health environment
inferred← citeshttps://doi.org/10.1016/j.conengprac.2006.07.003openalex-snapshot
Controller dependability analysis by probabilistic model checking
inferred← citeshttps://doi.org/10.1016/j.entcs.2005.04.012openalex-snapshot
Probabilistic Model Checking of the CSMA/CD Protocol Using PRISM and APMC
inferred← citeshttps://doi.org/10.1016/j.entcs.2005.10.030openalex-snapshot
Quantitative Analysis With the Probabilistic Model Checker PRISM
inferred← citeshttps://doi.org/10.1016/j.entcs.2007.05.027openalex-snapshot
Evaluating Complex MAC Protocols for Sensor Networks with APMC
inferred← citeshttps://doi.org/10.1016/j.ic.2007.01.004openalex-snapshot
Symbolic model checking for probabilistic timed automata
inferred← citeshttps://doi.org/10.1016/j.ic.2022.104886openalex-snapshot
Value iteration for simple stochastic games: Stopping criterion and learning algorithm
inferred← citeshttps://doi.org/10.1016/j.ifacol.2016.10.332openalex-snapshot
Verifying Collision Avoidance Behaviours for Unmanned Surface Vehicles using Probabilistic Model Checking
inferred← citeshttps://doi.org/10.1016/j.jlamp.2019.04.007openalex-snapshot
Consistency in Parametric Interval Probabilistic Timed Automata
inferred← citeshttps://doi.org/10.1016/j.peva.2024.102446openalex-snapshot
Probabilistic performance evaluation of the class-A device in LoRaWAN protocol on the MAC layer
inferred← citeshttps://doi.org/10.1016/j.peva.2025.102482openalex-snapshot
Certificates and witnesses for multi-objective queries in Markov decision processes
inferred← citeshttps://doi.org/10.1016/j.scico.2015.08.009openalex-snapshot
In the quantitative automata zoo
inferred← citeshttps://doi.org/10.1016/s1571-0661(04)80406-7openalex-snapshot
Automatic Verification of the IEEE-1394 Root Contention Protocol with KRONOS and PRISM
inferred← citeshttps://doi.org/10.1109/bibm.2014.6999149openalex-snapshot
Probabilistic verification of ER stress-induced signaling pathways
inferred← citeshttps://doi.org/10.1109/cimca.2006.144openalex-snapshot
Methodology for UML Modeling and Formal Verification of Real-Time Systems
inferred← citeshttps://doi.org/10.1109/csse.2008.371openalex-snapshot
Counterexample Generation for Probabilistic Timed Automata Model Checking
inferred← citeshttps://doi.org/10.1109/dsn.2011.5958249openalex-snapshot
Incremental quantitative verification for Markov decision processes
inferred← citeshttps://doi.org/10.1109/icdcsw.2004.1284097openalex-snapshot
Deductive verification of probabilistic real-time systems
inferred← citeshttps://doi.org/10.1109/iceccs.2016.022openalex-snapshot
An Experiment on Decision Diagrams for Model Checking Probabilistic Timed Automata
inferred← citeshttps://doi.org/10.1109/icphm.2016.7542823openalex-snapshot
Uncertainty analysis of phased mission systems with probabilistic timed automata
inferred← citeshttps://doi.org/10.1109/lics.2003.1210075openalex-snapshot
Model checking for probability and time: from theory to practice
inferred← citeshttps://doi.org/10.1109/qest.2008.34openalex-snapshot
Computing Expected Absorption Times for Parametric Determinate Probabilistic Timed Automata
inferred← citeshttps://doi.org/10.1109/tcad.2005.852033openalex-snapshot
Evaluating the reliability of NAND multiplexing with PRISM
inferred← citeshttps://doi.org/10.1109/trustcom.2016.0084openalex-snapshot
Model Checking Probabilistic Network Propagation Protection Strategies
inferred← citeshttps://doi.org/10.1109/tse.2023.3250835openalex-snapshot
Modelling Second-Order Uncertainty in State Machines
inferred← citeshttps://doi.org/10.1145/1059816.1059820openalex-snapshot
Probabilistic model checking in practice
inferred← citeshttps://doi.org/10.1145/2907943openalex-snapshot
Learning Weighted Assumptions for Compositional Verification of Markov Decision Processes
inferred← citeshttps://doi.org/10.1145/3689731openalex-snapshot
Quantum Probabilistic Model Checking for Time-Bounded Properties
inferred← citeshttps://doi.org/10.1504/ijdmb.2016.074683openalex-snapshot
Statistical analysis and probabilistic verification of stress-induced signalling pathways
inferred← citeshttps://doi.org/10.1504/ijwmc.2014.064818openalex-snapshot
Probabilistic model checking of IEEE 802.11 IBSS power save mode
inferred← citeshttps://doi.org/10.1609/aaai.v36i9.21222openalex-snapshot
Risk-Aware Stochastic Shortest Path
inferred← citeshttps://doi.org/10.21236/ada613893openalex-snapshot
Semantic Importance Sampling for Statistical Model Checking
inferred← citeshttps://doi.org/10.23919/fmcad.2017.8102246openalex-snapshot
Exact quantitative probabilistic model checking through rational search
inferred← citeshttps://doi.org/10.2514/6.2015-1866openalex-snapshot
Verification of Real-Time Systems using Statistical Model Checking
inferred← citeshttps://doi.org/10.29007/bmcfopenalex-snapshot
On Incremental Quantitative Verification for Probabilistic Systems
inferred← citeshttps://doi.org/10.3233/fi-2009-171openalex-snapshot
A Decidable Probability Logic for Timed Probabilistic Systems
inferred← citeshttps://doi.org/10.3990/1.9789036505925openalex-snapshot
Efficient modelling, generation and analysis of Markov Automata
inferred← citeshttps://doi.org/10.4204/eptcs.39.7openalex-snapshot
IMITATOR II: A Tool for Solving the Good Parameters Problem in Timed Automata
inferred← citeshttps://doi.org/10.4204/eptcs.399.5openalex-snapshot
Four Formal Models of IEEE 1394 Link Layer
inferred← citeshttps://doi.org/10.4204/eptcs.85.1openalex-snapshot
UPPAAL-SMC: Statistical Model Checking for Priced Timed Automata
inferred← citeshttps://doi.org/10.48550/arxiv.1903.09354openalex-snapshot
A Model Counter's Guide to Probabilistic Systems
inferred← citeshttps://doi.org/10.5287/ora-y0bamqrpdopenalex-snapshot
Automated quantitative software verification
inferred← citeshttps://doi.org/10.5287/ora-yekkzgrwaopenalex-snapshot
On verification and controller synthesis for probabilistic systems at runtime
inferred← citeshttps://doi.org/10.70675/2991497fzaba1z4569z9c01z4b22b1d8c823openalex-snapshot
Terminaison en temps moyen fini de systèmes de règles probabilistes
inferred← citeshttps://doi.org/10.70675/66ea0809z2a39z4e5az8053z7bc2546457f9openalex-snapshot
An inverse method for the synthesis of timing parameters in concurrent systems
inferred← citeshttps://doi.org/10.70675/95fd2fd4z2f06z426ez9456z7e9af006e0feopenalex-snapshot
Safety System Architecture for the Design of Dependable and Adaptable Autonomous Vehicles
inferred← citeshttps://doi.org/10.7494/csci.2022.23.4.4588openalex-snapshot
Modeling and Analysis of Probabilistic Real-time Systems through Integrating Event-B and Probabilistic Model Checking
inferred← citeshttps://doi.org/10.9790/0661-16293542openalex-snapshot
Identifying Threats Associated With Man-In-The-Middle Attacks during Communication between a Mobile Device and the Back End Server in Mobile Banking 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.