On the public citation graph

Model-Checking for Hybrid Systems by Quotienting and Constraints Solving

0 signed · 43 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.1993.1024openalex-snapshot
Model-Checking in Dense Real-Time
inferredcites →https://doi.org/10.1006/inco.1994.1045openalex-snapshot
Symbolic Model Checking for Real-Time Systems
inferredcites →https://doi.org/10.1006/jcss.1998.1581openalex-snapshot
What's Decidable about Hybrid Automata?
inferredcites →https://doi.org/10.1007/3-540-48320-9_14openalex-snapshot
Reachability Analysis of (Timed) Petri Nets Using Real Arithmetic
inferredcites →https://doi.org/10.1007/3-540-48340-3_12openalex-snapshot
Is Your Model Checker on Time?
inferredcites →https://doi.org/10.1007/3-540-48683-6_11openalex-snapshot
Automated Verification of a Parametric Real-Time Program: The ABR Conformance Protocol
inferredcites →https://doi.org/10.1007/3-540-48683-6_30openalex-snapshot
Efficient Timed Reachability Analysis Using Clock Difference Diagrams
inferredcites →https://doi.org/10.1007/3-540-49213-5_14openalex-snapshot
Modular Model Checking
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-60218-6_3openalex-snapshot
Compositional model checking of real time systems
inferredcites →https://doi.org/10.1007/3-540-61474-5_73openalex-snapshot
Verification of an Audio Protocol with bus collision using Uppaal
inferredcites →https://doi.org/10.1007/3-540-63166-6_48openalex-snapshot
HyTech: A model checker for hybrid systems
inferredcites →https://doi.org/10.1007/978-0-387-35394-4_27openalex-snapshot
CMC: A Tool for Compositional Model-Checking of Real-Time Systems
inferredcites →https://doi.org/10.1007/s100090050009openalex-snapshot
KRONOS: a verification tool for real-time systems
inferredcites →https://doi.org/10.1007/s100090050010openalex-snapshot
Uppaal in a nutshell
inferredcites →https://doi.org/10.1016/0304-3975(94)00202-topenalex-snapshot
The algorithmic analysis of hybrid systems
inferredcites →https://doi.org/10.1109/32.489079openalex-snapshot
Automatic symbolic verification of embedded systems
inferredcites →https://doi.org/10.1109/lics.1995.523274openalex-snapshot
Partial model checking
inferredcites →https://doi.org/10.1109/lics.1996.561342openalex-snapshot
The theory of hybrid automata
inferredcites →https://doi.org/10.1109/real.1997.641266openalex-snapshot
On-the-fly symbolic model checking for real-time systems
inferredcites →https://doi.org/10.1145/333979.333987openalex-snapshot
An automata-theoretic approach to branching-time model checking
inferredcites →https://doi.org/10.7146/brics.v3i59.18770openalex-snapshot
Compositional and Symbolic Model-Checking of Real-Time Systems

What points at this work

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

inferred← citeshttps://doi.org/10.1007/11596042_123openalex-snapshot
Automata-Theoretic Performance Analysis Method of Soft Real-Time Systems
inferred← citeshttps://doi.org/10.1007/3-540-36577-x_16openalex-snapshot
Schedulability Analysis Using Two Clocks
inferred← citeshttps://doi.org/10.1007/3-540-46002-0_6openalex-snapshot
Timed Automata with Asynchronous Processes: Schedulability and Decidability
inferred← citeshttps://doi.org/10.1007/978-3-540-24730-2_20openalex-snapshot
Decidable and Undecidable Problems in Schedulability Analysis Using Timed Automata
inferred← citeshttps://doi.org/10.1007/978-3-642-11486-1_3openalex-snapshot
Compositional and Quantitative Model Checking (Extended Abstract)
inferred← citeshttps://doi.org/10.1007/978-3-642-28756-5_11openalex-snapshot
Partial Model Checking Using Networks of Labelled Transition Systems and Boolean Equation Systems
inferred← citeshttps://doi.org/10.1007/978-3-642-29320-7_3openalex-snapshot
Decompositional Reasoning about the History of Parallel Processes
inferred← citeshttps://doi.org/10.1007/s00236-015-0226-1openalex-snapshot
Compositional verification of asynchronous concurrent systems using CADP
inferred← citeshttps://doi.org/10.1007/s10817-020-09568-7openalex-snapshot
Natural Projection as Partial Model Checking
inferred← citeshttps://doi.org/10.1007/s10849-010-9127-4openalex-snapshot
Timed Modal Logics for Real-Time Systems
inferred← citeshttps://doi.org/10.1016/j.ic.2007.01.009openalex-snapshot
Task automata: Schedulability, decidability and undecidability
inferred← citeshttps://doi.org/10.1016/j.tcs.2005.11.019openalex-snapshot
Schedulability analysis of fixed-priority systems using timed automata
inferred← citeshttps://doi.org/10.1109/euc.2008.115openalex-snapshot
UCaS: A Schedulability Analysis Tool for AADL Models
inferred← citeshttps://doi.org/10.1109/ispa.2011.29openalex-snapshot
Schedulability Analysis for Distributed Systems Using Network of Action Automata and Environment Automata
inferred← citeshttps://doi.org/10.1109/jas.2021.1003964openalex-snapshot
Control of Non-Deterministic Systems With $\mu$-Calculus Specifications Using Quotienting
inferred← citeshttps://doi.org/10.1109/jproc.2004.831197openalex-snapshot
Formal verification of timed systems: a survey and perspective
inferred← citeshttps://doi.org/10.1109/rtss.2008.36openalex-snapshot
Symbolic Computation of Schedulability Regions Using Parametric Timed Automata
inferred← citeshttps://doi.org/10.15168/11572_368709openalex-snapshot
Parametric Real-Time System Feasibility Analysis Using Parametric Timed Automata
inferred← citeshttps://doi.org/10.2168/lmcs-9(4:1)2013openalex-snapshot
Partial Model Checking using Networks of Labelled Transition Systems and Boole an Equation Systems
inferred← citeshttps://doi.org/10.29007/rb2popenalex-snapshot
A Quantitative Partial Model-Checking Function and Its Optimisation
inferred← citeshttps://doi.org/10.4204/eptcs.326.14openalex-snapshot
The Quotient in Preorder Theories
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.