On the public citation graph

Robust timed automata

0 signed · 133 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.1007/3-540-57318-6_30openalex-snapshot

Hybrid automata: An algorithmic approach to the specification and verification of hybrid systems

inferredcites →https://doi.org/10.1007/3-540-58179-0_39openalex-snapshot

A determinizable class of timed automata

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.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.495196openalex-snapshot

HYTECH: the next generation

inferredcites →https://doi.org/10.1145/112600.112613openalex-snapshot

The benefits of relaxing punctuality

What points at this work

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

inferred← citeshttps://doi.org/10.1002/9781118602638.ch9openalex-snapshot

Verification of Timed Systems

inferred← citeshttps://doi.org/10.1007/0-8176-4404-0_17openalex-snapshot

From Control Loops to Real-Time Programs

inferred← citeshttps://doi.org/10.1007/0-8176-4404-0_21openalex-snapshot

An Introduction to Hybrid Automata

inferred← citeshttps://doi.org/10.1007/11560647_17openalex-snapshot

A Robust Interpretation of Duration Calculus

inferred← citeshttps://doi.org/10.1007/11603009_18openalex-snapshot

Quantifying Similarities Between Timed Systems

inferred← citeshttps://doi.org/10.1007/11682462_25openalex-snapshot

Robust Model-Checking of Linear-Time Properties in Timed Automata

inferred← citeshttps://doi.org/10.1007/11730637_28openalex-snapshot

Approximation, Sampling and Voting in Hybrid Computing Systems

inferred← citeshttps://doi.org/10.1007/11730637_4openalex-snapshot

Behavioural Approximations for Restricted Linear Differential Hybrid Automata

inferred← citeshttps://doi.org/10.1007/11867340_11openalex-snapshot

Symbolic Robustness Analysis of Timed Automata

inferred← citeshttps://doi.org/10.1007/11901914_21openalex-snapshot

Branching-Time Property Preservation Between Real-Time Systems

inferred← citeshttps://doi.org/10.1007/11940197_12openalex-snapshot

Robustness of Temporal Logic Specifications

inferred← citeshttps://doi.org/10.1007/3-540-36580-x_28openalex-snapshot

Universality and Language Inclusion for Open and Closed Timed Automata

inferred← citeshttps://doi.org/10.1007/3-540-45500-0_17openalex-snapshot

What Will Be Eventually True of Polynomial Hybrid Automata?

inferred← citeshttps://doi.org/10.1007/3-540-45873-5_32openalex-snapshot

Discrete-Time Refinement of Hybrid Automata

inferred← citeshttps://doi.org/10.1007/3-540-46430-1_15openalex-snapshot

Robust Undecidability of Timed and Hybrid Systems

inferred← citeshttps://doi.org/10.1007/3-540-48320-9_19openalex-snapshot

Metrics for Labeled Markov Systems

inferred← citeshttps://doi.org/10.1007/3-540-49163-5_3openalex-snapshot

On Hybrid Systems and the Modal µ-calculus

inferred← citeshttps://doi.org/10.1007/978-0-387-09680-3_36openalex-snapshot

The Surprising Robustness of (Closed) Timed Automata against Clock-Drift

inferred← citeshttps://doi.org/10.1007/978-0-387-68546-5_17openalex-snapshot

A Survey on Continuous Time Computations

inferred← citeshttps://doi.org/10.1007/978-3-030-00151-3_12openalex-snapshot

Distance on Timed Words and Applications

inferred← citeshttps://doi.org/10.1007/978-3-030-29662-9_12openalex-snapshot

On the Distance Between Timed Automata

inferred← citeshttps://doi.org/10.1007/978-3-030-57628-8_7openalex-snapshot

Computing Maximally-Permissive Strategies in Acyclic Timed Automata

inferred← citeshttps://doi.org/10.1007/978-3-031-50974-2_15openalex-snapshot

Timed Alignments with Mixed Moves

inferred← citeshttps://doi.org/10.1007/978-3-031-61433-0_10openalex-snapshot

Languages of Higher-Dimensional Timed Automata

inferred← citeshttps://doi.org/10.1007/978-3-031-68416-6_11openalex-snapshot

Efficiently Computable Distance-Based Robustness for a Practical Fragment of STL

inferred← citeshttps://doi.org/10.1007/978-3-031-68416-6_16openalex-snapshot

Controller Synthesis in Timed Büchi Automata: Robustness and Punctual Guards

inferred← citeshttps://doi.org/10.1007/978-3-031-73751-0_12openalex-snapshot

Reminiscences of a Real-Time Researcher

inferred← citeshttps://doi.org/10.1007/978-3-032-16855-9_4openalex-snapshot

Higher-Dimensional Timed Automata for Real-Time Concurrency

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-319-25150-9_24openalex-snapshot

Undecidability Results for Multi-Lane Spatial Logic

inferred← citeshttps://doi.org/10.1007/978-3-540-24743-2_1openalex-snapshot

Lazy Rectangular Hybrid Automata

inferred← citeshttps://doi.org/10.1007/978-3-540-28644-8_22openalex-snapshot

Timed vs. Time-Triggered Automata

inferred← citeshttps://doi.org/10.1007/978-3-540-30080-9_1openalex-snapshot

Decision Problems for Timed Automata: A Survey

inferred← citeshttps://doi.org/10.1007/978-3-540-30206-3_10openalex-snapshot

Robustness and Implementability of Timed Automata

inferred← citeshttps://doi.org/10.1007/978-3-540-30206-3_4openalex-snapshot

Mixed Delay and Threshold Voters in Critical Real-Time Systems

inferred← citeshttps://doi.org/10.1007/978-3-540-31954-2_4openalex-snapshot

The Discrete Time Behavior of Lazy Linear Hybrid Automata

inferred← citeshttps://doi.org/10.1007/978-3-540-31954-2_5openalex-snapshot

Perturbed Timed Automata

inferred← citeshttps://doi.org/10.1007/978-3-540-75454-1_4openalex-snapshot

Undecidability of Universality for Timed Automata with Minimal Resources

inferred← citeshttps://doi.org/10.1007/978-3-540-77050-3_15openalex-snapshot

Probabilistic and Topological Semantics for Timed Automata

inferred← citeshttps://doi.org/10.1007/978-3-540-78499-9_12openalex-snapshot

Robust Analysis of Timed Automata Via Channel Machines

inferred← citeshttps://doi.org/10.1007/978-3-540-85778-5_10openalex-snapshot

Timed Parity Games: Complexity and Robustness

inferred← citeshttps://doi.org/10.1007/978-3-642-02930-1_9openalex-snapshot

Reachability in Stochastic Timed Games

inferred← citeshttps://doi.org/10.1007/978-3-642-04081-8_33openalex-snapshot

Time-Bounded Verification

inferred← citeshttps://doi.org/10.1007/978-3-642-04368-0_10openalex-snapshot

Safe Runtime Verification of Real-Time Properties

inferred← citeshttps://doi.org/10.1007/978-3-642-14162-1_3openalex-snapshot

Towards a Theory of Time-Bounded Verification

inferred← citeshttps://doi.org/10.1007/978-3-642-19805-2_16openalex-snapshot

Quantitative Robustness Analysis of Flat Timed Automata

inferred← citeshttps://doi.org/10.1007/978-3-642-22993-0_50openalex-snapshot

Untimed Language Preservation in Timed Systems

inferred← citeshttps://doi.org/10.1007/978-3-642-23217-6_6openalex-snapshot

Timed Automata Can Always Be Made Implementable

inferred← citeshttps://doi.org/10.1007/978-3-642-24310-3_8openalex-snapshot

Robust Model-Checking of Timed Automata via Pumping in Channel Machines

inferred← citeshttps://doi.org/10.1007/978-3-642-24310-3_9openalex-snapshot

Thin and Thick Timed Regular Languages

inferred← citeshttps://doi.org/10.1007/978-3-642-28891-3_33openalex-snapshot

CLSE: Closed-Loop Symbolic Execution

inferred← citeshttps://doi.org/10.1007/978-3-642-31113-0_7openalex-snapshot

Deriving Real-Time Action Systems Controllers from Multiscale System Specifications

inferred← citeshttps://doi.org/10.1007/978-3-642-31585-5_15openalex-snapshot

Robust Reachability in Timed Automata: A Game-Based Approach

inferred← citeshttps://doi.org/10.1007/978-3-642-40184-8_38openalex-snapshot

Robust Controller Synthesis in Timed Automata

inferred← citeshttps://doi.org/10.1007/978-3-642-40229-6_3openalex-snapshot

Robust Weighted Timed Automata and Games

inferred← citeshttps://doi.org/10.1007/978-3-642-41036-9_1openalex-snapshot

Robustness in Timed Automata

inferred← citeshttps://doi.org/10.1007/978-3-642-59615-5_13openalex-snapshot

The Theory of Hybrid Automata

inferred← citeshttps://doi.org/10.1007/978-3-662-46681-0_48openalex-snapshot

Symbolic Quantitative Robustness Analysis of Timed Automata

inferred← citeshttps://doi.org/10.1007/978-3-662-49122-5_12openalex-snapshot

Lipschitz Robustness of Timed I/O Systems

inferred← citeshttps://doi.org/10.1007/bfb0055641openalex-snapshot

Controlled timed automata

inferred← citeshttps://doi.org/10.1007/s00236-003-0135-6openalex-snapshot

Timed automata with urgent transitions

inferred← citeshttps://doi.org/10.1007/s00236-014-0196-8openalex-snapshot

General quantitative specification theories with modal transition systems

inferred← citeshttps://doi.org/10.1007/s00236-015-0243-0openalex-snapshot

Metric temporal logic revisited

inferred← citeshttps://doi.org/10.1007/s00450-013-0251-7openalex-snapshot

Quantitative reactive modeling and verification

inferred← citeshttps://doi.org/10.1007/s10009-026-00852-2openalex-snapshot

Efficiently computable temporal robustness for a practical STL fragment

inferred← citeshttps://doi.org/10.1007/s10703-008-0056-7openalex-snapshot

Robust safety of timed automata

inferred← citeshttps://doi.org/10.1007/s11241-007-9013-6openalex-snapshot

Predictable real-time software synthesis

inferred← citeshttps://doi.org/10.1016/j.cosrev.2013.05.001openalex-snapshot

A survey of timed automata for the development of real-time systems

inferred← citeshttps://doi.org/10.1016/j.entcs.2005.03.027openalex-snapshot

Closed, Open, and Robust Timed Networks

inferred← citeshttps://doi.org/10.1016/j.ic.2014.01.002openalex-snapshot

Shrinking timed automata

inferred← citeshttps://doi.org/10.1016/j.ic.2015.03.003openalex-snapshot

Entropy of regular timed languages

inferred← citeshttps://doi.org/10.1016/j.jlap.2010.07.010openalex-snapshot

Quantitative analysis of weighted transition systems

inferred← citeshttps://doi.org/10.1016/j.scico.2013.08.009openalex-snapshot

Deriving real-time action systems with multiple time bands using algebraic reasoning

inferred← citeshttps://doi.org/10.1016/j.scico.2015.05.005openalex-snapshot

Interval-based data refinement: A uniform approach to true concurrency in discrete and real-time systems

inferred← citeshttps://doi.org/10.1016/j.tcs.2003.09.013openalex-snapshot

Metrics for labelled Markov processes

inferred← citeshttps://doi.org/10.1016/j.tcs.2009.06.021openalex-snapshot

Robustness of temporal logic specifications for continuous-time signals

inferred← citeshttps://doi.org/10.1016/j.tcs.2009.12.019openalex-snapshot

Detecting synchronisation of biological oscillators by model checking

inferred← citeshttps://doi.org/10.1016/j.tcs.2014.08.014openalex-snapshot

Robust reachability in timed automata and games: A game-based approach

inferred← citeshttps://doi.org/10.1016/s0020-0190(97)00217-2openalex-snapshot

Timed automata and recognizability

inferred← citeshttps://doi.org/10.1016/s0167-6911(02)00185-8openalex-snapshot

Continuous selections of trajectories of hybrid systems

inferred← citeshttps://doi.org/10.1016/s0304-3975(99)00134-6openalex-snapshot

Testing timed automata

inferred← citeshttps://doi.org/10.1016/s1574-6526(05)80022-7openalex-snapshot

Time in Qualitative Simulation

inferred← citeshttps://doi.org/10.1023/a:1008387132377openalex-snapshot

Dynamical Properties of Timed Automata

inferred← citeshttps://doi.org/10.1109/5.871305openalex-snapshot

Logics for hybrid systems

inferred← citeshttps://doi.org/10.1109/acsd.2010.26openalex-snapshot

Robustness of Sequential Circuits

inferred← citeshttps://doi.org/10.1109/cacsd-cca-isic.2006.4776876openalex-snapshot

On the implementation of control loops by software

inferred← citeshttps://doi.org/10.1109/ds-rt.2010.31openalex-snapshot

From DEVS to RTA-DEVS

inferred← citeshttps://doi.org/10.1109/ecbs.2001.922417openalex-snapshot

Using 'parallel automaton' as a single notation to specify, design and control small computer based systems

inferred← citeshttps://doi.org/10.1109/iwrsp.2003.1207033openalex-snapshot

Prototype-based tests for hybrid reactive systems

inferred← citeshttps://doi.org/10.1109/lics.1996.561342openalex-snapshot

The theory of hybrid automata

inferred← citeshttps://doi.org/10.1109/lics.2002.1029849openalex-snapshot

The metric analogue of weak bisimulation for probabilistic processes

inferred← citeshttps://doi.org/10.1109/lics.2003.1210059openalex-snapshot

Revisiting digitization, robustness, and decidability for timed automata

inferred← citeshttps://doi.org/10.1109/lics.2008.25openalex-snapshot

Almost-Sure Model Checking of Infinite Paths in One-Clock Timed Automata

inferred← citeshttps://doi.org/10.1109/memcod.2003.1210101openalex-snapshot

Real-time property preservation in approximations of timed systems

inferred← citeshttps://doi.org/10.1109/qest.2008.19openalex-snapshot

Quantitative Model-Checking of One-Clock Timed Automata under Probabilistic Semantics

inferred← citeshttps://doi.org/10.1109/rtss.2009.17openalex-snapshot

Symbolic Robustness Analysis

inferred← citeshttps://doi.org/10.1109/sies.2011.5953652openalex-snapshot

Robustness in real-time systems

inferred← citeshttps://doi.org/10.1109/time.2007.39openalex-snapshot

A Symbolic Decision Procedure for Robust Safety of Timed Systems

inferred← citeshttps://doi.org/10.1109/time.2013.17openalex-snapshot

A New Metric Temporal Logic for Hybrid Systems

inferred← citeshttps://doi.org/10.1145/1450058.1450089openalex-snapshot

Quantitative testing

inferred← citeshttps://doi.org/10.1145/3049797.3049821openalex-snapshot

Robust Model Checking of Timed Automata under Clock Drifts

inferred← citeshttps://doi.org/10.1145/3501710.3519504openalex-snapshot

Temporal Robustness of Stochastic Signals

inferred← citeshttps://doi.org/10.1145/3550072openalex-snapshot

Temporal Robustness of Temporal Logic Specifications: Analysis and Control Design

inferred← citeshttps://doi.org/10.1177/0037549711424424openalex-snapshot

Principles of Discrete Event System Specification model verification

inferred← citeshttps://doi.org/10.14279/tuj.eceasst.46.684openalex-snapshot

Approximating Idealised Real-Time Specifications Using Time Bands

inferred← citeshttps://doi.org/10.14279/tuj.eceasst.72.1015.1013openalex-snapshot

Permissive strategies in timed automata and games

inferred← citeshttps://doi.org/10.1613/jair.1129openalex-snapshot

PDDL2.1: An Extension to PDDL for Expressing Temporal Planning Domains

inferred← citeshttps://doi.org/10.1613/jair.2044openalex-snapshot

Modelling Mixed Discrete-Continuous Domains for Planning

inferred← citeshttps://doi.org/10.2168/lmcs-7(4:8)2011openalex-snapshot

Timed Parity Games: Complexity and Robustness

inferred← citeshttps://doi.org/10.22215/etd/2016-11231openalex-snapshot

Improved Time Representation in Discrete-Event Simulation

inferred← citeshttps://doi.org/10.25596/jalc-2000-371openalex-snapshot

Timed Automata with Periodic Clock Constraints

inferred← citeshttps://doi.org/10.4204/eptcs.257.6openalex-snapshot

Monitoring of Traffic Manoeuvres with Imprecise Information

inferred← citeshttps://doi.org/10.4204/eptcs.87.2openalex-snapshot

A Robust Specification Theory for Modal Event-Clock Automata

inferred← citeshttps://doi.org/10.4230/lipics.time.2019.20openalex-snapshot

On Verifying Timed Hyperproperties

inferred← citeshttps://doi.org/10.48550/arxiv.1806.08810openalex-snapshot

Self-Driving Vehicle Verification Towards a Benchmark

inferred← citeshttps://doi.org/10.48550/arxiv.1909.10489openalex-snapshot

On the Distance between Timed Automata

inferred← citeshttps://doi.org/10.5840/wcp151975594openalex-snapshot

Probabilistic Semantics

inferred← citeshttps://doi.org/10.6100/ir594545openalex-snapshot

Predictability in real-time software design

inferred← citeshttps://doi.org/10.70675/3b17a406zc9dbz4a47z853czb9ebaaa90425openalex-snapshot

Verification of timed automata : reachability, liveness and modelling

inferred← citeshttps://doi.org/10.70675/5de92b0aza63dz4168za9b0zec36396c88ffopenalex-snapshot

Weighted timed games : decidability, randomness and robustness

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/7583e15fz7b20z4b4eza7bcze3449157b227openalex-snapshot

Volumetry of timed languages and applications

inferred← citeshttps://doi.org/10.70675/da111d0fz1197z4a45zae8czae96f6191281openalex-snapshot

Improved time representation in discrete-event simulation

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.