On the public citation graph

Partition refinement in real-time model checking

https://doi.org/10.1007/bfb0055344
0 signed · 48 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.1994.1045openalex-snapshot
Symbolic Model Checking for Real-Time Systems
inferredcites →https://doi.org/10.1007/3-540-52148-8_17openalex-snapshot
Timing assumptions and verification of finite-state concurrent systems
inferredcites →https://doi.org/10.1007/3-540-56922-7_18openalex-snapshot
An efficient algorithm for minimizing real-time transition systems
inferredcites →https://doi.org/10.1007/3-540-60045-0_52openalex-snapshot
Local model checking for real-time systems
inferredcites →https://doi.org/10.1007/3-540-60249-6_41openalex-snapshot
Model-checking for real-time systems
inferredcites →https://doi.org/10.1007/3-540-61474-5_93openalex-snapshot
Symbolic model checking
inferredcites →https://doi.org/10.1007/978-1-4615-3190-6openalex-snapshot
Symbolic Model Checking
inferredcites →https://doi.org/10.1007/bfb0030626openalex-snapshot
A compositional proof of a real-time mutual exclusion protocol
inferredcites →https://doi.org/10.1007/bfb0031987openalex-snapshot
The theory of timed automata
inferredcites →https://doi.org/10.1007/bfb0084802openalex-snapshot
Minimization of timed transition systems
inferredcites →https://doi.org/10.1016/0304-3975(94)00202-topenalex-snapshot
The algorithmic analysis of hybrid systems
inferredcites →https://doi.org/10.1016/0304-3975(94)90010-8openalex-snapshot
A theory of timed automata
inferredcites →https://doi.org/10.1023/a:1008621829508openalex-snapshot
An Efficient Algorithm for Minimizing Real-Time Transition Systems
inferredcites →https://doi.org/10.1109/32.489079openalex-snapshot
Automatic symbolic verification of embedded systems
inferredcites →https://doi.org/10.1109/lics.1996.561342openalex-snapshot
The theory of hybrid automata
inferredcites →https://doi.org/10.1109/real.1995.495198openalex-snapshot
Compositional and symbolic model-checking of real-time systems
inferredcites →https://doi.org/10.1145/5397.5399openalex-snapshot
Automatic verification of finite-state concurrent systems using temporal logic specifications

What points at this work

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

inferred← citeshttps://doi.org/10.1007/3-540-36577-x_19openalex-snapshot
Moby/DC – A Tool for Model-Checking Parametric Real-Time Specifications
inferred← citeshttps://doi.org/10.1007/3-540-40911-4_22openalex-snapshot
Predicate Diagrams for the Verification of Reactive Systems
inferred← citeshttps://doi.org/10.1007/3-540-44585-4_34openalex-snapshot
TReX: A Tool for Reachability Analysis of Complex Systems
inferred← citeshttps://doi.org/10.1007/3-540-44804-7_3openalex-snapshot
Reachability Analysis of Probabilistic Systems by Successive Refinements
inferred← citeshttps://doi.org/10.1007/3-540-45319-9_14openalex-snapshot
Linear Parametric Model Checking of Timed Automata
inferred← citeshttps://doi.org/10.1007/3-540-45575-2_25openalex-snapshot
Transformation of UML Specification to XTG
inferred← citeshttps://doi.org/10.1007/3-540-48168-0_9openalex-snapshot
Difference Decision Diagrams
inferred← citeshttps://doi.org/10.1007/978-3-319-68690-5_15openalex-snapshot
Classification-Based Parameter Synthesis for Parametric Timed Automata
inferred← citeshttps://doi.org/10.1007/978-3-540-27793-4_4openalex-snapshot
Specification and Model Checking of Temporal Properties in Time Petri Nets and Timed Automata
inferred← citeshttps://doi.org/10.1007/978-3-642-18222-8_5openalex-snapshot
Parametric Model Checking with VerICS
inferred← citeshttps://doi.org/10.1007/bfb0055330openalex-snapshot
Formal Techniques in Real-Time and Fault-Tolerant Systems
inferred← citeshttps://doi.org/10.1007/s00165-007-0030-yopenalex-snapshot
Predicate diagrams for the verification of real-time systems
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.1016/j.entcs.2004.08.057openalex-snapshot
Analysis of Real-Time Systems with CTL Model Checkers
inferred← citeshttps://doi.org/10.1016/j.entcs.2005.10.010openalex-snapshot
Predicate Diagrams for the Verification of Real-Time Systems
inferred← citeshttps://doi.org/10.1016/s1474-6670(17)35446-0openalex-snapshot
Towards Unified Compositional Design of Control Systems
inferred← citeshttps://doi.org/10.1016/s1567-8326(02)00037-1openalex-snapshot
Linear parametric model checking of timed automata
inferred← citeshttps://doi.org/10.1016/s1571-0661(05)80753-4openalex-snapshot
Specification of Real-Time Systems in UML
inferred← citeshttps://doi.org/10.1023/a:1008734703554openalex-snapshot
Analysis of Timed Systems Using Time-Abstracting Bisimulations
inferred← citeshttps://doi.org/10.1023/a:1024480913162openalex-snapshot
Dynamic Partitioning in Linear Relation Analysis: Application to the Verification of Reactive Systems
inferred← citeshttps://doi.org/10.1109/acsd.2013.5openalex-snapshot
Incremental Bisimulation Abstraction Refinement
inferred← citeshttps://doi.org/10.1109/emrts.1999.777458openalex-snapshot
Experiments with parametric verification of real-time systems
inferred← citeshttps://doi.org/10.1109/hicss.2001.927265openalex-snapshot
Application of parametric model checking - the Root Contention protocol
inferred← citeshttps://doi.org/10.1109/hicss.2002.994478openalex-snapshot
Splitting trees and partition refinement in real-time model checking
inferred← citeshttps://doi.org/10.1109/rtcsa.1999.811301openalex-snapshot
An approach towards formal verification of object oriented real-time systems
inferred← citeshttps://doi.org/10.1145/2627352openalex-snapshot
Incremental Bisimulation Abstraction Refinement
inferred← citeshttps://doi.org/10.2498/cit.1001272openalex-snapshot
Verification of Complex Real-time Systems using Rewriting Logic
inferred← citeshttps://doi.org/10.53846/goediss-2570openalex-snapshot
Algorithms and Data Structures for Parametric Analysis of Real-Time Systems
inferred← citeshttps://doi.org/10.6100/ir549628openalex-snapshot
Enhancing state space reduction techniques for model checking
inferred← citeshttps://doi.org/10.7146/brics.v7i38.20204openalex-snapshot
Dynamic Partitioning in Linear Relation Analysis. Application to the Verification of Synchronous Programs
inferred← citeshttps://doi.org/10.7146/brics.v8i5.20459openalex-snapshot
Linear Parametric Model Checking of Timed Automata
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.