On the public citation graph

Efficient scaling-invariant checking of timed bisimulation

0 signed · 51 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.1007/3-540-52148-8_17openalex-snapshot

Timing assumptions and verification of finite-state concurrent systems

inferredcites →https://doi.org/10.1007/3-540-56496-9_24openalex-snapshot

Decidability of bisimulation equivalences for parallel timer processes

inferredcites →https://doi.org/10.1007/3-540-56922-7_21openalex-snapshot

Timed modal specification — Theory and tools

inferredcites →https://doi.org/10.1007/3-540-61604-7_73openalex-snapshot

A space-efficient on-the-fly algorithm for real-time model checking

inferredcites →https://doi.org/10.1007/978-3-540-48654-1_16openalex-snapshot

The Observational Power of Clocks

inferredcites →https://doi.org/10.1007/bf01178579openalex-snapshot

From ATP to timed graphs and hybrid systems

inferredcites →https://doi.org/10.1007/bfb0020979openalex-snapshot

Fischer's protocol revisited: A simple proof using modal constraints

inferredcites →https://doi.org/10.1007/bfb0032002openalex-snapshot

Forward and backward simulations for timing-based systems

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/lics.1992.185551openalex-snapshot

Symbolic model checking for real-time systems

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

Parametric real-time reasoning

inferredcites →https://doi.org/10.7146/brics.v4i11.18802openalex-snapshot

Timed Modal Specification —Theory and Tools

What points at this work

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

inferred← citeshttps://doi.org/10.1007/11535294_2openalex-snapshot

Timed Equivalences for Timed Event Structures

inferred← citeshttps://doi.org/10.1007/3-540-44669-9_28openalex-snapshot

On the Category of Event Structures with Dense Time

inferred← citeshttps://doi.org/10.1007/3-540-44743-1_12openalex-snapshot

Characterizing Timed Net Processes Categorically

inferred← citeshttps://doi.org/10.1007/3-540-45241-9_17openalex-snapshot

Constraint Database Models Characterizing Timed Bisimilarity

inferred← citeshttps://doi.org/10.1007/3-540-45575-2_21openalex-snapshot

Observational Semantics for Timed Event Structures

inferred← citeshttps://doi.org/10.1007/3-540-65193-4_20openalex-snapshot

Model checking timed automata

inferred← citeshttps://doi.org/10.1007/978-3-030-61470-6_5openalex-snapshot

Parametric Timed Bisimulation

inferred← citeshttps://doi.org/10.1007/978-3-032-35298-9_19openalex-snapshot

Witnesses and Counterexamples for Timed Bisimulation

inferred← citeshttps://doi.org/10.1007/978-3-319-57288-8_4openalex-snapshot

Multi-timed Bisimulation for Distributed Timed Automata

inferred← citeshttps://doi.org/10.1007/978-3-540-39866-0_26openalex-snapshot

Open Maps and Trace Semantics for Timed Partial Order Models

inferred← citeshttps://doi.org/10.1007/978-3-540-40007-3_21openalex-snapshot

Making Timed Automata Communicate

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

A Categorical Observation of Timed Testing Equivalence

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

Efficient on-the-fly Algorithm for Checking Alternating Timed Simulation

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

On Decidability of Prebisimulation for Timed Automata

inferred← citeshttps://doi.org/10.1007/978-3-662-44584-6_36openalex-snapshot

Reducing Clocks in Timed Automata while Preserving Bisimulation

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

Analysis of equivalence relations of event structures with continuous time

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

Weak refinement for modal hybrid systems

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

Timed bisimulation and open maps

inferred← citeshttps://doi.org/10.1007/s00450-014-0257-9openalex-snapshot

Automata-based refinement checking for real-time systems

inferred← citeshttps://doi.org/10.1016/j.jss.2015.08.026openalex-snapshot

Evolution of software in automated production systems: Challenges and research directions

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

Testing timed automata

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

Translation Validation for Model-Based Code-Generators for PLCs

inferred← citeshttps://doi.org/10.1134/s0361768810030023openalex-snapshot

Unifying behavioral equivalences of timed transition systems

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

Reusing dynamic communication protocols in self-adaptive embedded component architectures

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

Correct-by-Construction Evolution of Digital Twins for Real-Time Autonomous Systems

inferred← citeshttps://doi.org/10.25100/iyc.v25isuplemento.13144openalex-snapshot

Applying parallelism to a bisimulation algorithm to improve efficiency in software testing of time-critical systems

inferred← citeshttps://doi.org/10.25673/2294openalex-snapshot

Konstruktion korrekter Codegeneratoren für Speicherprogrammierbare Steuerungen

inferred← citeshttps://doi.org/10.29007/kkdsopenalex-snapshot

Unifying Equivalences for Timed Transition Systems

inferred← citeshttps://doi.org/10.3182/20090916-3-es-3003.00042openalex-snapshot

Playing Games with Timed Games

inferred← citeshttps://doi.org/10.3233/fi-1999-381206openalex-snapshot

Bisimulation and Open Maps for Timed Transition Systems

inferred← citeshttps://doi.org/10.3233/fi-2000-43123401openalex-snapshot

Analysis of Timed Concurrent Models Based on Testing Equivalence

inferred← citeshttps://doi.org/10.3233/fi-2009-0092openalex-snapshot

Timed Delay Bisimulation is an Equivalence Relation for Timed Transition Systems

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

A Unifying Approach to Decide Relations for Timed Automata and their Game Characterization

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

Checking Timed Bisimulation with Bounded Zone-History Graphs -- Technical Report

inferred← citeshttps://doi.org/10.5555/774455.774459openalex-snapshot

Clock difference diagrams

inferred← citeshttps://doi.org/10.7146/brics.v5i4.19277openalex-snapshot

Timed Bisimulation and Open Maps

inferred← citeshttps://doi.org/10.7146/brics.v5i46.19491openalex-snapshot

Clock Difference Diagrams

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.