On the public citation graph

Timed bisimulation and open maps

https://doi.org/10.1007/bfb0055787
0 signed · 36 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.1996.0057openalex-snapshot
Bisimulation from Open Maps
inferredcites →https://doi.org/10.1007/10705424_16openalex-snapshot
An Extensional Characterization of Lambda-Lifting and Lambda-Dropping
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-57880-3_4openalex-snapshot
An asynchronous process algebra with multiple clocks
inferredcites →https://doi.org/10.1007/3-540-60084-1_103openalex-snapshot
Automatic synthesis of real time systems
inferredcites →https://doi.org/10.1007/bf01178579openalex-snapshot
From ATP to timed graphs and hybrid systems
inferredcites →https://doi.org/10.1007/bfb0023458openalex-snapshot
Efficient scaling-invariant checking of timed bisimulation
inferredcites →https://doi.org/10.1007/bfb0031988openalex-snapshot
Logics and models of real time: A survey
inferredcites →https://doi.org/10.1007/bfb0032042openalex-snapshot
Automata for modeling real-time systems
inferredcites →https://doi.org/10.1007/bfb0039080openalex-snapshot
Real-time behaviour of asynchronous agents
inferredcites →https://doi.org/10.1007/bfb0055101openalex-snapshot
Sequential iteration of interactive arguments and an efficient zero-knowledge argument for NP
inferredcites →https://doi.org/10.1007/s100090050010openalex-snapshot
Uppaal in a nutshell
inferredcites →https://doi.org/10.1016/0304-3975(94)90010-8openalex-snapshot
A theory of timed automata
inferredcites →https://doi.org/10.1090/dimacs/029/08openalex-snapshot
Presheaves as transition systems
inferredcites →https://doi.org/10.1109/lics.1997.614944openalex-snapshot
A Kleene theorem for timed automata
inferredcites →https://doi.org/10.1109/lics.1998.705658openalex-snapshot
A theory of recursive domains with applications to concurrency
inferredcites →https://doi.org/10.7146/brics.v2i2.19504openalex-snapshot
From Timed Automata to Logic - and Back
inferredcites →https://doi.org/10.7146/brics.v2i23.19925openalex-snapshot
Open Maps (at) Work
inferredcites →https://doi.org/10.7146/brics.v4i48.19269openalex-snapshot
CoFI: The Common Framework Initiative for Algebraic Specification and Development
inferredcites →https://doi.org/10.7146/brics.v4i49.19270openalex-snapshot
CASL for ASF+SDF Users
inferredcites →https://doi.org/10.7146/brics.v4i51.19272openalex-snapshot
Some Lambda Calculus and Type Theory Formalized
inferredcites →https://doi.org/10.7146/brics.v4i53.19274openalex-snapshot
Online Type-Directed Partial Evaluation
inferredcites →https://doi.org/10.7146/brics.v5i3.19276openalex-snapshot
Comparison of Coding DNA
inferredcites →https://doi.org/10.7146/brics.v5i4.19277openalex-snapshot
Timed Bisimulation and Open Maps

What points at this work

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

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-65306-6_23openalex-snapshot
Petri nets and other models of concurrency
inferred← citeshttps://doi.org/10.1007/978-3-031-30829-1_15openalex-snapshot
Weighted and Branching Bisimilarities from Generalized Open Maps
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-642-03409-1_25openalex-snapshot
Open Maps Bisimulations for Higher Dimensional Automata Models
inferred← citeshttps://doi.org/10.1007/bfb0055761openalex-snapshot
Reasoning about the past
inferred← citeshttps://doi.org/10.1016/j.entcs.2015.12.005openalex-snapshot
Open Maps in Concrete Categories and Branching Bisimulation for Prefix Orders
inferred← citeshttps://doi.org/10.1016/j.jss.2014.02.058openalex-snapshot
From AADL to Timed Abstract State Machines: A verified model transformation
inferred← citeshttps://doi.org/10.3103/s1055134414010064openalex-snapshot
Comparing equivalences on precubical sets and spaces
inferred← citeshttps://doi.org/10.3233/fi-1999-381206openalex-snapshot
Bisimulation and Open Maps for Timed Transition Systems
inferred← citeshttps://doi.org/10.7146/brics.v5i4.19277openalex-snapshot
Timed Bisimulation and Open Maps
inferred← citeshttps://doi.org/10.7146/brics.v5i8.19280openalex-snapshot
Distributed Versions of Linear Time Temporal Logic: A Trace Perspective
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.