On the public citation graph
From ATP to timed graphs and hybrid systems
0 signed · 90 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.1006/inco.1994.1083openalex-snapshot
The Algebra of Timed Processes, ATP: Theory and Application
inferredcites →https://doi.org/10.1007/3-540-15670-4_19openalex-snapshot
The ESTEREL synchronous programming language and its mathematical semantics
inferredcites →https://doi.org/10.1007/3-540-54233-7_136openalex-snapshot
CCS + time = an interleaving model for real time systems
inferredcites →https://doi.org/10.1007/bfb0039073openalex-snapshot
A temporal calculus of communicating systems
inferredcites →https://doi.org/10.1007/bfb0039080openalex-snapshot
Real-time behaviour of asynchronous agents
inferredcites →https://doi.org/10.1016/0167-6423(90)90076-popenalex-snapshot
Communication and concurrency
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.1006/inco.1996.0060openalex-snapshot
Forward and Backward Simulations
inferred← citeshttps://doi.org/10.1006/inco.1997.2623openalex-snapshot
Time-Abstracted Bisimulation: Implicit Specifications and Decidability
inferred← citeshttps://doi.org/10.1007/3-540-45828-x_1openalex-snapshot
Embedded Systems: Challenges in Specification and Verification
inferred← citeshttps://doi.org/10.1007/3-540-48068-4_11openalex-snapshot
Computing a Finite Prefix of a Time Petri Net
inferred← citeshttps://doi.org/10.1007/3-540-56922-7_17openalex-snapshot
Reachability analysis of planar multi-linear systems
inferred← citeshttps://doi.org/10.1007/3-540-56922-7_35openalex-snapshot
Verifying timed behavior automata with input/output critical races
inferred← citeshttps://doi.org/10.1007/3-540-57182-5_61openalex-snapshot
Deciding testing equivalence for real-time processes with dense time
inferred← citeshttps://doi.org/10.1007/3-540-57318-6_23openalex-snapshot
An extended duration calculus for hybrid real-time systems
inferred← citeshttps://doi.org/10.1007/3-540-57318-6_24openalex-snapshot
Towards refining temporal specifications into hybrid systems
inferred← citeshttps://doi.org/10.1007/3-540-57318-6_30openalex-snapshot
Hybrid automata: An algorithmic approach to the specification and verification of hybrid systems
inferred← citeshttps://doi.org/10.1007/3-540-57880-3_4openalex-snapshot
An asynchronous process algebra with multiple clocks
inferred← citeshttps://doi.org/10.1007/3-540-58468-4_157openalex-snapshot
Hybrid verification by exploiting the environment
inferred← citeshttps://doi.org/10.1007/3-540-58468-4_160openalex-snapshot
Development of hybrid systems
inferred← citeshttps://doi.org/10.1007/3-540-58468-4_166openalex-snapshot
Verifying invariance properties of timed systems with duration variables
inferred← citeshttps://doi.org/10.1007/3-540-58468-4_177openalex-snapshot
Proving safety properties of hybrid systems
inferred← citeshttps://doi.org/10.1007/3-540-58468-4_180openalex-snapshot
Reasoning about durations in Metric Temporal Logic
inferred← citeshttps://doi.org/10.1007/3-540-60472-3_4openalex-snapshot
On the automatic verification of systems with continuous variables and unbounded discrete data structures
inferred← citeshttps://doi.org/10.1007/3-540-61474-5_74openalex-snapshot
Selective quantitative analysis and interval model checking: Verifying different facets of a system
inferred← citeshttps://doi.org/10.1007/3-540-61604-7_48openalex-snapshot
Models for concurrent constraint programming
inferred← citeshttps://doi.org/10.1007/3-540-61648-9_37openalex-snapshot
A calculus for timed automata
inferred← citeshttps://doi.org/10.1007/3-540-63010-4_10openalex-snapshot
Regular processes and timed automata
inferred← citeshttps://doi.org/10.1007/3-540-65193-4_18openalex-snapshot
Verification of clocked and hybrid systems
inferred← citeshttps://doi.org/10.1007/978-0-387-34878-0_17openalex-snapshot
Verifying ET-LOTOS programs with KRONOS
inferred← citeshttps://doi.org/10.1007/978-0-387-34945-9_9openalex-snapshot
A Reachability Analysis of RT-LOTOS Specifications
inferred← citeshttps://doi.org/10.1007/978-1-4471-3078-9_3openalex-snapshot
Design of Real-Time Systems: Interface between Duration Calculus and Program Specifications
inferred← citeshttps://doi.org/10.1007/978-3-540-69927-9_5openalex-snapshot
Transforming Process Algebra Models into UML State Machines: Bridging a Semantic Gap?
inferred← citeshttps://doi.org/10.1007/978-3-642-40229-6_13openalex-snapshot
On Fixed Points of Strictly Causal Functions
inferred← citeshttps://doi.org/10.1007/978-3-642-85165-0_20openalex-snapshot
The Tick-Tock Case Study for the Assessment of Timed FDTs
inferred← citeshttps://doi.org/10.1007/bf01211907openalex-snapshot
Action transducers and timed automata
inferred← citeshttps://doi.org/10.1007/bf01213605openalex-snapshot
Model-checking discrete duration calculus
inferred← citeshttps://doi.org/10.1007/bfb0014337openalex-snapshot
Coalgebraic specifications and models of deterministic hybrid systems
inferred← citeshttps://doi.org/10.1007/bfb0020933openalex-snapshot
Verifying clocked transition systems
inferred← citeshttps://doi.org/10.1007/bfb0020973openalex-snapshot
Logics vs. automata: The hybrid case
inferred← citeshttps://doi.org/10.1007/bfb0023458openalex-snapshot
Efficient scaling-invariant checking of timed bisimulation
inferred← citeshttps://doi.org/10.1007/bfb0032002openalex-snapshot
Forward and backward simulations for timing-based systems
inferred← citeshttps://doi.org/10.1007/bfb0055346openalex-snapshot
Synchronizing clocked transition systems
inferred← citeshttps://doi.org/10.1007/bfb0084802openalex-snapshot
Minimization of timed transition systems
inferred← citeshttps://doi.org/10.1007/bfb0084803openalex-snapshot
Using CSP to verify a timed protocol over a fair medium
inferred← citeshttps://doi.org/10.1007/bfb0084808openalex-snapshot
Action transducers and timed automata
inferred← citeshttps://doi.org/10.1007/s001650050015openalex-snapshot
A Formal Definition of Time in LOTOS
inferred← citeshttps://doi.org/10.1007/s00236-002-0094-3openalex-snapshot
Comparing the worst-case efficiency of asynchronous systems with PAFAS
inferred← citeshttps://doi.org/10.1007/s002360050154openalex-snapshot
Transformational design of real-time systems. Part II: From program specifications to programs
inferred← citeshttps://doi.org/10.1007/s100090050006openalex-snapshot
Continuous modeling of real-time and hybrid systems: from concepts to tools
inferred← citeshttps://doi.org/10.1007/s100090050007openalex-snapshot
Real-time system = discrete system + clock variables
inferred← citeshttps://doi.org/10.1007/s100090050033openalex-snapshot
Analysis and verification of real-time systems using quantitative symbolic algorithms
inferred← citeshttps://doi.org/10.1016/0005-1098(94)00115-yopenalex-snapshot
Trajectory encoding for systems with irregular observations
inferred← citeshttps://doi.org/10.1016/0304-3975(94)00151-8openalex-snapshot
Metric temporal logic with durations
inferred← citeshttps://doi.org/10.1016/0304-3975(94)00202-topenalex-snapshot
The algorithmic analysis of hybrid systems
inferred← citeshttps://doi.org/10.1016/j.jlap.2005.10.003openalex-snapshot
Linearization of hybrid processes
inferred← citeshttps://doi.org/10.1016/j.tcs.2010.09.003openalex-snapshot
Weak bisimulation for Probabilistic Timed Automata
inferred← citeshttps://doi.org/10.1016/j.tcs.2015.01.036openalex-snapshot
The fixed-point theory of strictly causal functions
inferred← citeshttps://doi.org/10.1016/s0167-6423(97)00006-3openalex-snapshot
Computing with continuous change
inferred← citeshttps://doi.org/10.1016/s0303-2647(99)00087-8openalex-snapshot
A logic for biological systems
inferred← citeshttps://doi.org/10.1016/s0304-3975(96)00086-2openalex-snapshot
On the computational power of dynamical systems and hybrid systems
inferred← citeshttps://doi.org/10.1016/s0304-3975(97)00074-1openalex-snapshot
On the rational behaviors of concurrent timers
inferred← citeshttps://doi.org/10.1016/s0304-3975(99)00213-3openalex-snapshot
Object-oriented hybrid systems of coalgebras plus monoid actions
inferred← citeshttps://doi.org/10.1109/32.159837openalex-snapshot
Compiling real-time specifications into extended automata
inferred← citeshttps://doi.org/10.1109/32.489079openalex-snapshot
Automatic symbolic verification of embedded systems
inferred← citeshttps://doi.org/10.1109/apsec.2001.991460openalex-snapshot
Automatic translation of a timed process algebra into dynamic state graphs
inferred← citeshttps://doi.org/10.1109/cca.2007.4389334openalex-snapshot
Implementation of Hybrid Automata in Scicos
inferred← citeshttps://doi.org/10.1109/emwrt.1993.638859openalex-snapshot
Continuous Real Time Models in Practice
inferred← citeshttps://doi.org/10.1109/hicss.1998.656139openalex-snapshot
Automatic analysis of embedded systems specified in Astral
inferred← citeshttps://doi.org/10.1109/iceccs.1996.558488openalex-snapshot
Modeling and analysis of complex computer systems-the MTCCS approach
inferred← citeshttps://doi.org/10.1109/real.1993.393520openalex-snapshot
Automatic symbolic verification of embedded systems
inferred← citeshttps://doi.org/10.1109/real.1996.563702openalex-snapshot
Reducing the number of clock variables of timed automata
inferred← citeshttps://doi.org/10.1109/rtcsa.1997.629191openalex-snapshot
Experiences with analysis of formal specifications in Astral
inferred← citeshttps://doi.org/10.1109/wift.1995.515482openalex-snapshot
Timing analysis of industrial real-time systems
inferred← citeshttps://doi.org/10.1145/123041.123051openalex-snapshot
Specifying and verifying requirements of real-time systems
inferred← citeshttps://doi.org/10.1145/1368088.1368126openalex-snapshot
A verification system for timed interval calculus
inferred← citeshttps://doi.org/10.14279/depositonce-743openalex-snapshot
Time Partition Testing | Systematischer Test des kontinuierlichen Verhaltens von eingebetteten Systemen
inferred← citeshttps://doi.org/10.22028/d291-26494openalex-snapshot
Model checking stochastic hybrid systems
inferred← citeshttps://doi.org/10.26190/unsworks/22938openalex-snapshot
Modelling and programming embedded controllers with timed automata and synchronous languages
inferred← citeshttps://doi.org/10.3233/fi-1999-381206openalex-snapshot
Bisimulation and Open Maps for Timed Transition Systems
inferred← citeshttps://doi.org/10.6100/ir524751openalex-snapshot
A language and simulator for hybrid 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.