On the public citation graph
TCTL Inevitability Analysis of Dense-Time Systems: From Theory to Engineering
0 signed · 50 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.1007/0-306-47003-9_15openalex-snapshot
Symbolic Verification of Complex Real-time Systems with Clock-restriction Diagram
inferredcites →https://doi.org/10.1007/10722167_15openalex-snapshot
Counterexample-Guided Abstraction Refinement
inferredcites →https://doi.org/10.1007/3-540-36384-x_17openalex-snapshot
Efficient Verification of Timed Automata with BDD-Like Data-Structures
inferredcites →https://doi.org/10.1007/3-540-46419-0_12openalex-snapshot
Efficient Data Structure for Fully Symbolic Verification of Real-Time Software Systems
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-52148-8_17openalex-snapshot
Timing assumptions and verification of finite-state concurrent 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/978-0-387-35578-8_16openalex-snapshot
User-Friendly Verification
inferredcites →https://doi.org/10.1007/978-3-540-24686-2_16openalex-snapshot
OVL Assertion-Checking of Embedded Software with Dense-Time Semantics
inferredcites →https://doi.org/10.1007/978-3-540-24686-2_37openalex-snapshot
Symbolic Simulation of Real-Time Concurrent Systems
inferredcites →https://doi.org/10.1007/978-3-540-24730-2_25openalex-snapshot
Lower and Upper Bounds in Zone Based Abstractions of Timed Automata
inferredcites →https://doi.org/10.1007/978-3-540-24732-6_9openalex-snapshot
Validation of UML Models via a Mapping to Communicating Extended Timed Automata
inferredcites →https://doi.org/10.1007/bf01585709openalex-snapshot
Dines—Fourier—Motzkin quantifier elimination and an application of corresponding transfer principles over ordered fields
inferredcites →https://doi.org/10.1007/bfb0032042openalex-snapshot
Automata for modeling real-time systems
inferredcites →https://doi.org/10.1007/s100090050009openalex-snapshot
KRONOS: a verification tool for real-time systems
inferredcites →https://doi.org/10.1016/0020-0190(87)90097-4openalex-snapshot
Uniform inevitability is tree automation ineffable
inferredcites →https://doi.org/10.1016/0141-1195(83)90118-3openalex-snapshot
Software engineering: A practitioner's approach
inferredcites →https://doi.org/10.1016/0304-3975(89)90052-2openalex-snapshot
Concurrent systems and inevitability
inferredcites →https://doi.org/10.1016/0743-1066(92)90030-7openalex-snapshot
Abstract interpretation and application to logic programs
inferredcites →https://doi.org/10.1016/s1571-0661(04)80477-8openalex-snapshot
Parking Can Get You There Faster
inferredcites →https://doi.org/10.1109/12.980017openalex-snapshot
Efficient and user-friendly verification
inferredcites →https://doi.org/10.1109/cmpsac.2000.884774openalex-snapshot
Region Encoding Diagram for fully symbolic verification of real-time systems
inferredcites →https://doi.org/10.1109/hase.1998.731605openalex-snapshot
Automatic verification on the large
inferredcites →https://doi.org/10.1109/lics.1990.113766openalex-snapshot
Model-checking for real-time systems
inferredcites →https://doi.org/10.1109/lics.1992.185551openalex-snapshot
Symbolic model checking for real-time systems
inferredcites →https://doi.org/10.1109/real.1996.563700openalex-snapshot
Approximate reachability analysis of timed automata
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/978-3-319-10512-3_9openalex-snapshot
The Power of Proofs: New Algorithms for Timed Automata Model Checking
inferred← citeshttps://doi.org/10.1007/978-3-319-10575-8_29openalex-snapshot
Model Checking Real-Time Systems
inferred← citeshttps://doi.org/10.1007/978-3-540-71209-1_25openalex-snapshot
Model Checking Liveness Properties of Genetic Regulatory Networks
inferred← citeshttps://doi.org/10.1007/978-3-540-75454-1_25openalex-snapshot
Symbolic Simulation-Checking of Dense-Time Automata
inferred← citeshttps://doi.org/10.1007/978-3-540-88387-6_24openalex-snapshot
Time-Progress Evaluation for Dense-Time Automata with Concave Path Conditions
inferred← citeshttps://doi.org/10.1007/s10009-014-0312-7openalex-snapshot
Model-checking fair dense-time systems with propositions and events
inferred← citeshttps://doi.org/10.1007/s11241-011-9122-0openalex-snapshot
Efficient verification of distributed real-time systems with broadcasting behaviors
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.tcs.2012.09.019openalex-snapshot
Efficient model-checking of dense-time systems with time-convexity analysis
inferred← citeshttps://doi.org/10.1109/icess.2009.48openalex-snapshot
A Genetic Algorithm Based Approach for Event Synchronization Analysis in Real-Time Embedded Systems
inferred← citeshttps://doi.org/10.1109/isola.2006.68openalex-snapshot
REDLIB for the Formal Verification of Embedded Systems
inferred← citeshttps://doi.org/10.1109/rtss.2008.53openalex-snapshot
Efficient Model-Checking of Dense-Time Systems with Time-Convexity Analysis
inferred← citeshttps://doi.org/10.1109/sbesc.2011.19openalex-snapshot
Verifying Embedded C Software with Timing Constraints Using an Untimed Bounded Model Checker
inferred← citeshttps://doi.org/10.1109/tac.2007.911330openalex-snapshot
Temporal Logic Analysis of Gene Networks Under Parameter Uncertainty
inferred← citeshttps://doi.org/10.1109/tse.2005.13openalex-snapshot
Symbolic parametric safety analysis of linear hybrid systems with BDD-like data-structures
inferred← citeshttps://doi.org/10.1109/tse.2014.2359893openalex-snapshot
A Systematic Study on Explicit-State Non-Zenoness Checking for Timed Automata
inferred← citeshttps://doi.org/10.1145/2897053.2897060openalex-snapshot
Symbolic performance adaptation
inferred← citeshttps://doi.org/10.48550/arxiv.cs/0610085openalex-snapshot
Symbolic Simulation-Checking of Dense-Time Systems
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.