On the public citation graph
Minimum and maximum delay problems in real-time systems
0 signed · 148 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/3-540-52148-8_17openalex-snapshot
Timing assumptions and verification of finite-state concurrent systems
inferredcites →https://doi.org/10.1007/3-540-54233-7_128openalex-snapshot
Model-checking for probabilistic real-time systems
inferredcites →https://doi.org/10.1007/bfb0032042openalex-snapshot
Automata for modeling real-time systems
inferredcites →https://doi.org/10.1016/0376-5075(82)90108-8openalex-snapshot
Protocol specification, testing, and verification
inferredcites →https://doi.org/10.1109/lics.1990.113763openalex-snapshot
A logic of concrete time intervals
inferredcites →https://doi.org/10.1109/lics.1990.113766openalex-snapshot
Model-checking for 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.1002/9780470611012.ch4openalex-snapshot
Model Checking Timed Automata
inferred← citeshttps://doi.org/10.1002/stv.434openalex-snapshot
Timing analysis of scenario-based specifications using linear programming
inferred← citeshttps://doi.org/10.1002/stvr.434openalex-snapshot
Timing analysis of scenario‐based specifications using linear programming
inferred← citeshttps://doi.org/10.1006/inco.1993.1024openalex-snapshot
Model-Checking in Dense Real-Time
inferred← citeshttps://doi.org/10.1006/inco.1996.0086openalex-snapshot
Parametric Timing Analysis for Real-Time Systems
inferred← citeshttps://doi.org/10.1007/11603009_18openalex-snapshot
Quantifying Similarities Between Timed Systems
inferred← citeshttps://doi.org/10.1007/11795490_22openalex-snapshot
Revising UNITY Programs: Possibilities and Limitations
inferred← citeshttps://doi.org/10.1007/11867340_1openalex-snapshot
Timed Alternating-Time Temporal Logic
inferred← citeshttps://doi.org/10.1007/3-540-44585-4_46openalex-snapshot
Job-Shop Scheduling Using Timed Automata?
inferred← citeshttps://doi.org/10.1007/3-540-45351-2_8openalex-snapshot
Optimal Paths in Weighted Timed Automata
inferred← citeshttps://doi.org/10.1007/3-540-45931-6_19openalex-snapshot
On Model Checking Durational Kripke Structures
inferred← citeshttps://doi.org/10.1007/3-540-47764-0_17openalex-snapshot
Parametric Optimization of Open Real-Time Systems
inferred← citeshttps://doi.org/10.1007/3-540-48320-9_18openalex-snapshot
Timed Automata and the Theory of Real Numbers
inferred← citeshttps://doi.org/10.1007/3-540-48340-3_12openalex-snapshot
Is Your Model Checker on Time?
inferred← citeshttps://doi.org/10.1007/3-540-48523-6_13openalex-snapshot
Parametric Temporal Logic for “Model Measuring”
inferred← citeshttps://doi.org/10.1007/3-540-48523-6_18openalex-snapshot
Decomposition and Composition of Timed Automata
inferred← citeshttps://doi.org/10.1007/3-540-56496-9_11openalex-snapshot
Verifying timed behavior automata with nonbinary delay constraints
inferred← citeshttps://doi.org/10.1007/3-540-56922-7_18openalex-snapshot
An efficient algorithm for minimizing real-time transition systems
inferred← citeshttps://doi.org/10.1007/3-540-58179-0_39openalex-snapshot
A determinizable class of timed automata
inferred← citeshttps://doi.org/10.1007/3-540-58468-4_167openalex-snapshot
Predicting logical and temporal properties of real-time systems using Synchronized Elementary Nets
inferred← citeshttps://doi.org/10.1007/3-540-60045-0_67openalex-snapshot
Efficient timing analysis of a class of Petri nets
inferred← citeshttps://doi.org/10.1007/3-540-60922-9_22openalex-snapshot
On the power of non-observable actions in timed automata
inferred← citeshttps://doi.org/10.1007/978-0-387-35608-2_40openalex-snapshot
Optimal-Reachability and Control for Acyclic Weighted Timed Automata
inferred← citeshttps://doi.org/10.1007/978-1-4471-4276-8_9openalex-snapshot
An Introduction to Timed Automata
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-17465-1_12openalex-snapshot
Minimal-Time Synthesis for Parametric Timed Automata
inferred← citeshttps://doi.org/10.1007/978-3-030-29662-9_11openalex-snapshot
The Timestamp of Timed Automata
inferred← citeshttps://doi.org/10.1007/978-3-031-50524-9_6openalex-snapshot
Parameterized Verification of Disjunctive Timed Networks
inferred← citeshttps://doi.org/10.1007/978-3-319-30734-3_8openalex-snapshot
A Compositional Approach to the Verification of Hybrid Systems
inferred← citeshttps://doi.org/10.1007/978-3-319-48989-6_4openalex-snapshot
Compositional Parameter Synthesis
inferred← citeshttps://doi.org/10.1007/978-3-540-27836-8_13openalex-snapshot
Optimal Reachability for Weighted Timed Games
inferred← citeshttps://doi.org/10.1007/978-3-540-28644-8_25openalex-snapshot
Model Checking Timed Automata with One or Two Clocks
inferred← citeshttps://doi.org/10.1007/978-3-540-28644-8_28openalex-snapshot
Model Checking Restricted Sets of Timed Paths
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-30538-5_13openalex-snapshot
Optimal Strategies in Priced Timed Game Automata
inferred← citeshttps://doi.org/10.1007/978-3-540-40903-8_15openalex-snapshot
Folk Theorems on the Determinization and Minimization of Timed Automata
inferred← citeshttps://doi.org/10.1007/978-3-540-48654-1_16openalex-snapshot
The Observational Power of Clocks
inferred← citeshttps://doi.org/10.1007/978-3-540-49382-2_22openalex-snapshot
The Power of Reachability Testing for Timed Automata
inferred← citeshttps://doi.org/10.1007/978-3-540-49823-0_9openalex-snapshot
Incremental Synthesis of Fault-Tolerant Real-Time Programs
inferred← citeshttps://doi.org/10.1007/978-3-540-70952-7_17openalex-snapshot
Automated Incremental Synthesis of Timed Automata
inferred← citeshttps://doi.org/10.1007/978-3-540-73420-8_71openalex-snapshot
Minimum-Time Reachability in Timed Games
inferred← citeshttps://doi.org/10.1007/978-3-540-73420-8_72openalex-snapshot
Reachability-Time Games on Timed Automata
inferred← citeshttps://doi.org/10.1007/978-3-540-77419-8_7openalex-snapshot
Deep Random Search for Efficient Model Checking of Timed Automata
inferred← citeshttps://doi.org/10.1007/978-3-540-85778-5_5openalex-snapshot
Concavely-Priced Timed Automata
inferred← citeshttps://doi.org/10.1007/978-3-642-02658-4_56openalex-snapshot
TASS: Timing Analyzer of Scenario-Based Specifications
inferred← citeshttps://doi.org/10.1007/978-3-642-11623-0_12openalex-snapshot
Modular Schedulability Analysis of Concurrent Objects in Creol
inferred← citeshttps://doi.org/10.1007/978-3-642-11623-0_2openalex-snapshot
Verification, Performance Analysis and Controller Synthesis for Real-Time Systems
inferred← citeshttps://doi.org/10.1007/978-3-642-13089-2_21openalex-snapshot
Parametric Metric Interval Temporal Logic
inferred← citeshttps://doi.org/10.1007/978-3-642-17164-2_20openalex-snapshot
Live Heap Space Bounds for Real-Time Systems
inferred← citeshttps://doi.org/10.1007/978-3-642-21254-3_36openalex-snapshot
On the Interval-Bound Problem for Weighted Timed Automata
inferred← citeshttps://doi.org/10.1007/978-3-642-22110-1_60openalex-snapshot
Model Checking Recursive Programs with Numeric Data Types
inferred← citeshttps://doi.org/10.1007/978-3-642-24933-4_3openalex-snapshot
Ten Years of Analyzing Actors: Rebeca Experience
inferred← citeshttps://doi.org/10.1007/978-3-642-29320-7_7openalex-snapshot
Composing Real-Time Concurrent Objects Refinement, Compatibility and Schedulability
inferred← citeshttps://doi.org/10.1007/978-3-642-33512-9_6openalex-snapshot
On the Relationship between Reachability Problems in Timed and Counter Automata
inferred← citeshttps://doi.org/10.1007/978-3-642-35743-5_11openalex-snapshot
Networks of Real-Time Actors
inferred← citeshttps://doi.org/10.1007/978-3-642-39212-2_21openalex-snapshot
Reachability in Two-Clock Timed Automata Is PSPACE-Complete
inferred← citeshttps://doi.org/10.1007/978-3-642-39721-9_2openalex-snapshot
Model-Based Verification, Optimization, Synthesis and Performance Evaluation of Real-Time Systems
inferred← citeshttps://doi.org/10.1007/978-3-642-39799-8_71openalex-snapshot
Lazy Abstractions for Timed Automata
inferred← citeshttps://doi.org/10.1007/978-3-642-40229-6_5openalex-snapshot
Predictability of Event Occurrences in Timed Systems
inferred← citeshttps://doi.org/10.1007/978-3-642-54862-8_18openalex-snapshot
Compositional Invariant Generation for Timed Systems
inferred← citeshttps://doi.org/10.1007/978-3-662-54577-5_29openalex-snapshot
Fair Termination for Parameterized Probabilistic Concurrent Systems
inferred← citeshttps://doi.org/10.1007/bf01438608openalex-snapshot
On a class of timer hybrid systems reducible to finite state automata
inferred← citeshttps://doi.org/10.1007/bf02948851openalex-snapshot
Verifying time Petri nets by linear programming
inferred← citeshttps://doi.org/10.1007/bfb0000495openalex-snapshot
Parametric analysis of computer systems
inferred← citeshttps://doi.org/10.1007/bfb0023491openalex-snapshot
Removing ε-transitions in timed automata
inferred← citeshttps://doi.org/10.1007/bfb0029958openalex-snapshot
Accepting Zeno words without making time stand still
inferred← citeshttps://doi.org/10.1007/bfb0055349openalex-snapshot
Dynamical properties of timed automata
inferred← citeshttps://doi.org/10.1007/bfb0084802openalex-snapshot
Minimization of timed transition systems
inferred← citeshttps://doi.org/10.1007/s00236-015-0254-xopenalex-snapshot
Compositional schedulability analysis of real-time actor-based systems
inferred← citeshttps://doi.org/10.1007/s10009-019-00532-4openalex-snapshot
Sampling strategies for product lines with unbounded parametric real-time constraints
inferred← citeshttps://doi.org/10.1007/s10703-005-1632-8openalex-snapshot
Checking Timed Büchi Automata Emptiness Efficiently
inferred← citeshttps://doi.org/10.1007/s10703-008-0056-7openalex-snapshot
Robust safety of timed automata
inferred← citeshttps://doi.org/10.1007/s10703-011-0140-2openalex-snapshot
Interrupt Timed Automata: verification and expressiveness
inferred← citeshttps://doi.org/10.1016/0304-3975(94)90010-8openalex-snapshot
A theory of timed automata
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.2004.02.010openalex-snapshot
Model-checking the Secure Release of a Time-locked Secret over a Network
inferred← citeshttps://doi.org/10.1016/j.entcs.2006.04.002openalex-snapshot
Weighted Timed Automata: Model-Checking and Games
inferred← citeshttps://doi.org/10.1016/j.ic.2014.12.004openalex-snapshot
Reachability in two-clock timed automata is PSPACE-complete
inferred← citeshttps://doi.org/10.1016/j.ipl.2006.04.015openalex-snapshot
Folk theorems on the determinization and minimization of timed automata
inferred← citeshttps://doi.org/10.1016/j.jlap.2009.02.009openalex-snapshot
Schedulability of asynchronous real-time concurrent objects
inferred← citeshttps://doi.org/10.1016/j.jss.2018.12.028openalex-snapshot
Minimum/maximum delay testing of product lines with unbounded parametric real-time constraints
inferred← citeshttps://doi.org/10.1016/j.peva.2013.11.002openalex-snapshot
Lower-bound-constrained runs in weighted timed automata
inferred← citeshttps://doi.org/10.1016/j.tcs.2003.10.038openalex-snapshot
Optimal paths in weighted timed automata
inferred← citeshttps://doi.org/10.1016/j.tcs.2005.11.018openalex-snapshot
Scheduling with timed automata
inferred← citeshttps://doi.org/10.1016/j.tcs.2005.11.020openalex-snapshot
Efficient timed model checking for discrete-time systems
inferred← citeshttps://doi.org/10.1016/j.tcs.2006.01.019openalex-snapshot
Model checking restricted sets of timed paths
inferred← citeshttps://doi.org/10.1016/j.tcs.2014.11.019openalex-snapshot
Parametric metric interval temporal logic
inferred← citeshttps://doi.org/10.1016/j.tcs.2016.04.021openalex-snapshot
Expected reachability-time games
inferred← citeshttps://doi.org/10.1016/j.tcs.2016.12.020openalex-snapshot
Finding minimum and maximum termination time of timed automata models with cyclic behaviour
inferred← citeshttps://doi.org/10.1016/s0164-1212(99)00112-0openalex-snapshot
Specifying and verifying real-time systems with timing uncertainty
inferred← citeshttps://doi.org/10.1016/s0304-3975(02)00334-1openalex-snapshot
The power of reachability testing for timed automata
inferred← citeshttps://doi.org/10.1016/s0304-3975(97)00173-4openalex-snapshot
Event-clock automata: a determinizable class of timed automata
inferred← citeshttps://doi.org/10.1016/s1567-8326(02)00022-xopenalex-snapshot
Is your model checker on time? On the complexity of model checking for timed modal logics
inferred← citeshttps://doi.org/10.1023/a:1008387132377openalex-snapshot
Dynamical Properties of Timed Automata
inferred← citeshttps://doi.org/10.1023/a:1008621829508openalex-snapshot
An Efficient Algorithm for Minimizing Real-Time Transition Systems
inferred← citeshttps://doi.org/10.1023/a:1008626013578openalex-snapshot
Computing Accumulated Delays in Real-time Systems
inferred← citeshttps://doi.org/10.1023/a:1008655714875openalex-snapshot
Bounded Delay Timing Analysis of a Class of CSP Programs
inferred← citeshttps://doi.org/10.1023/a:1008782501688openalex-snapshot
Parametric Analysis of Computer Systems
inferred← citeshttps://doi.org/10.1109/32.317429openalex-snapshot
Automated derivation of time bounds in uniprocessor concurrent systems
inferred← citeshttps://doi.org/10.1109/32.940727openalex-snapshot
Static analysis and dynamic steering of time-dependent systems
inferred← citeshttps://doi.org/10.1109/43.845084openalex-snapshot
Model checking on timed-event structures
inferred← citeshttps://doi.org/10.1109/cdc.2002.1184462openalex-snapshot
Submodule construction for timed systems
inferred← citeshttps://doi.org/10.1109/emrts.1999.777458openalex-snapshot
Experiments with parametric verification of real-time systems
inferred← citeshttps://doi.org/10.1109/fskd.2008.410openalex-snapshot
Towards the Complexity of Controls for Timed Automata with a Small Number of Clocks
inferred← citeshttps://doi.org/10.1109/lics.1995.523249openalex-snapshot
Timing behavior analysis for real-time systems
inferred← citeshttps://doi.org/10.1109/qest.2012.28openalex-snapshot
Lower-Bound Constrained Runs in Weighted Timed Automata
inferred← citeshttps://doi.org/10.1109/real.1992.242667openalex-snapshot
An implementation of three algorithms for timing verification based on automata emptiness
inferred← citeshttps://doi.org/10.1109/rtss.2008.28openalex-snapshot
Schedulability and Compatibility of Real Time Asynchronous Objects
inferred← citeshttps://doi.org/10.1109/sc.companion.2012.49openalex-snapshot
Towards Real-Time High Performance Computing for Power Grid Analysis
inferred← citeshttps://doi.org/10.1109/sfcs.1992.267774openalex-snapshot
Back to the future: towards a theory of timed regular languages
inferred← citeshttps://doi.org/10.1109/wift.1995.515482openalex-snapshot
Timing analysis of industrial real-time systems
inferred← citeshttps://doi.org/10.1137/120876435openalex-snapshot
Branching-Time Model Checking of One-Counter Processes and Timed Automata
inferred← citeshttps://doi.org/10.1145/1462187.1462192openalex-snapshot
Complexity results in revising UNITY programs
inferred← citeshttps://doi.org/10.1145/154183.154263openalex-snapshot
A practical technique for bounding the time between events in concurrent real-time systems
inferred← citeshttps://doi.org/10.1145/3559736.3559738openalex-snapshot
Reachability in timed automata
inferred← citeshttps://doi.org/10.1145/377978.377990openalex-snapshot
Parametric temporal logic for “model measuring”
inferred← citeshttps://doi.org/10.21236/ada455709openalex-snapshot
Complexity Issues in Automated Addition of Time-Bounded Liveness Properties
inferred← citeshttps://doi.org/10.22028/d291-26532openalex-snapshot
A uniform approach to the complexity and analysis of succinct systems
inferred← citeshttps://doi.org/10.25596/jalc-2002-167openalex-snapshot
A Kleene/Büchi-Like Theorem for Clock Languages
inferred← citeshttps://doi.org/10.31577/cai_2020_5_1022openalex-snapshot
Formal Verification of UML MARTE Specifications Based on a True Concurrency Real Time Model
inferred← citeshttps://doi.org/10.3233/fi-1998-36233openalex-snapshot
Characterization of the Expressive Power of Silent Transitions in Timed Automata
inferred← citeshttps://doi.org/10.3233/fi-2016-1313openalex-snapshot
Interrupt Timed Automata with Auxiliary Clocks and Parameters*
inferred← citeshttps://doi.org/10.3233/fi-2016-1316openalex-snapshot
Relating Reachability Problems in Timed and Counter Automata
inferred← citeshttps://doi.org/10.3233/fi-2017-1527openalex-snapshot
SMT-based Searching for k -quasi-optimal Runs in Weighted Timed Automata
inferred← citeshttps://doi.org/10.3390/math12244008openalex-snapshot
A Finite Representation of Durational Action Timed Automata Semantics
inferred← citeshttps://doi.org/10.3990/1.9789036547864openalex-snapshot
Strong connectivity and shortest paths for checking models
inferred← citeshttps://doi.org/10.4204/eptcs.105.4openalex-snapshot
A Formal Model For Real-Time Parallel Computation
inferred← citeshttps://doi.org/10.4230/lipics.fsttcs.2011.78openalex-snapshot
Using non-convex approximations for efficient analysis of timed automata
inferred← citeshttps://doi.org/10.48550/arxiv.1409.2408openalex-snapshot
Interrupt Timed Automata with Auxiliary Clocks and Parameters
inferred← citeshttps://doi.org/10.48550/arxiv.1503.04928openalex-snapshot
Hybrid Automata for Formal Modeling and Verification of Cyber-Physical Systems
inferred← citeshttps://doi.org/10.48550/arxiv.1710.10756openalex-snapshot
Fair Termination for Parameterized Probabilistic Concurrent Systems (Technical Report)
inferred← citeshttps://doi.org/10.48550/arxiv.2305.07295openalex-snapshot
Parameterized Verification of Disjunctive Timed Networks
inferred← citeshttps://doi.org/10.5287/ora-gpjjqxr6jopenalex-snapshot
On the complexity of model checking counter automata
inferred← citeshttps://doi.org/10.70675/1b0bfe3bzfe7bz4748za9a1zc38ebd508e3fopenalex-snapshot
Parity games and reachability in infinite-state systems with parameters
inferred← citeshttps://doi.org/10.7146/brics.v11i4.21829openalex-snapshot
Optimal Strategies in Priced Timed Game Automata
inferred← citeshttps://doi.org/10.7146/brics.v6i32.20101openalex-snapshot
Is your Model Checker on Time? On the Complexity of Model Checking for Timed Modal Logics
inferred← citeshttps://doi.org/10.82444/warw.33484750openalex-snapshot
Competitive optimisation on 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.