On the public citation graph

Verifying hybrid systems modeled as timed automata: A case study

0 signed · 30 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.1007/3-540-54430-5_103openalex-snapshot
Time-constrained automata
inferredcites →https://doi.org/10.1007/3-540-60472-3_14openalex-snapshot
HyTech: The Cornell Hybrid Technology Tool
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/bfb0014724openalex-snapshot
Verifying hybrid systems modeled as timed automata: A case study
inferredcites →https://doi.org/10.1007/bfb0027243openalex-snapshot
Proving safety properties of the steam boiler controller
inferredcites →https://doi.org/10.1007/bfb0027249openalex-snapshot
Assertional specification and verification using PVS of the steam boiler control system
inferredcites →https://doi.org/10.1007/bfb0032002openalex-snapshot
Forward and backward simulations for timing-based systems
inferredcites →https://doi.org/10.1016/0898-1221(95)90267-8openalex-snapshot
Computer-aided verification of coordinating processes: The automata-theoretic approach
inferredcites →https://doi.org/10.1109/32.345827openalex-snapshot
Formal verification for fault-tolerant architectures: prolegomena to the design of PVS
inferredcites →https://doi.org/10.1109/real.1994.342724openalex-snapshot
The generalized railroad crossing: a case study in formal verification of real-time systems
inferredcites →https://doi.org/10.1109/rttas.1996.509536openalex-snapshot
Mechanical verification of timed automata: a case study
inferredcites →https://doi.org/10.1515/9781400864041openalex-snapshot
Computer-Aided Verification of Coordinating Processes

What points at this work

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

inferred← citeshttps://doi.org/10.1002/rnc.592openalex-snapshot
Zeno hybrid systems
inferred← citeshttps://doi.org/10.1007/3-540-45654-6_8openalex-snapshot
Assertion-Based Analysis of Hybrid Systems with PVS
inferred← citeshttps://doi.org/10.1007/3-540-64358-3_47openalex-snapshot
Deductive verification of hybrid systems using step
inferred← citeshttps://doi.org/10.1007/978-1-4615-5613-8_3openalex-snapshot
CREWS-SAVRE: Scenarios for Acquiring and Validating Requirements
inferred← citeshttps://doi.org/10.1007/bfb0000476openalex-snapshot
Verification of distributed real-time and fault-tolerant protocols
inferred← citeshttps://doi.org/10.1007/bfb0027280openalex-snapshot
Formal methods: A panacea or academic poppycock?
inferred← citeshttps://doi.org/10.1007/bfb0028384openalex-snapshot
Human-style theorem proving using PVS
inferred← citeshttps://doi.org/10.1007/bfb0055652openalex-snapshot
Checking verifications of protocols and distributed systems by computer
inferred← citeshttps://doi.org/10.1023/a:1008605412971openalex-snapshot
CREWS-SAVRE: Scenarios for Acquiring and Validating Requirements
inferred← citeshttps://doi.org/10.1023/a:1016320523091openalex-snapshot
Proving Invariants of I/O Automata with TAME
inferred← citeshttps://doi.org/10.1023/a:1018913028597openalex-snapshot
TAME: Using PVS strategies for special-purpose theorem proving
inferred← citeshttps://doi.org/10.1049/ip-sen:20000460openalex-snapshot
Qualitative formal method for requirements specification and validation of hybrid real-time safety systems
inferred← citeshttps://doi.org/10.1109/iceccs.2001.930163openalex-snapshot
Verification of hybrid systems: formalization and proof rules in PVS
inferred← citeshttps://doi.org/10.1145/349360.351127openalex-snapshot
Using TAME to prove invariants of automata models
inferred← citeshttps://doi.org/10.1145/383876.383877openalex-snapshot
Automated deductive requirements analysis of critical systems
inferred← citeshttps://doi.org/10.2514/6.2000-4499openalex-snapshot
Simulating aircraft subsystems using non-homogeneous automata networks
showing the first 16 of 17 · page through all 17
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.