On the public citation graph
The silent step in time
0 signed · 26 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-10003-2_79openalex-snapshot
On observing nondeterminism and concurrency
inferredcites →https://doi.org/10.1007/3-540-10235-3openalex-snapshot
A Calculus of Communicating Systems
inferredcites →https://doi.org/10.1007/3-540-10828-9_52openalex-snapshot
A modal characterisation of observable machine-behaviour
inferredcites →https://doi.org/10.1007/3-540-18088-5_8openalex-snapshot
Another look at abstraction in process algebra
inferredcites →https://doi.org/10.1007/3-540-54430-5_101openalex-snapshot
Completeness in real time process algebra
inferredcites →https://doi.org/10.1007/3-540-55719-9_104openalex-snapshot
Behavioural abstraction in TCCS
inferredcites →https://doi.org/10.1007/bfb0039073openalex-snapshot
A temporal calculus of communicating systems
inferredcites →https://doi.org/10.1007/bfb0084808openalex-snapshot
Action transducers and timed automata
inferredcites →https://doi.org/10.1016/0169-7552(94)00016-mopenalex-snapshot
On communicating sequential processes
inferredcites →https://doi.org/10.1016/0304-3975(83)90114-7openalex-snapshot
Calculi for synchrony and asynchrony
inferredcites →https://doi.org/10.1145/233551.233556openalex-snapshot
Branching time and abstraction in bisimulation semantics
inferredcites →https://doi.org/10.1145/2455.2460openalex-snapshot
Algebraic laws for nondeterminism and concurrency
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.1995.1151openalex-snapshot
An Effective Axiomatization for Real Time ACP
inferred← citeshttps://doi.org/10.1006/inco.1996.0060openalex-snapshot
Forward and Backward Simulations
inferred← citeshttps://doi.org/10.1007/11603009_20openalex-snapshot
Is Timed Branching Bisimilarity an Equivalence Indeed?
inferred← citeshttps://doi.org/10.1007/978-3-642-13562-0_40openalex-snapshot
A Categorical View of Timed Weak Bisimulation
inferred← citeshttps://doi.org/10.1007/978-3-662-04293-9openalex-snapshot
Introduction to Process Algebra
inferred← citeshttps://doi.org/10.1007/bfb0032002openalex-snapshot
Forward and backward simulations for timing-based systems
inferred← citeshttps://doi.org/10.1016/j.entcs.2005.09.003openalex-snapshot
Formal Verification of Timed Systems Using Cones and Foci
inferred← citeshttps://doi.org/10.1016/s0020-0190(01)00215-0openalex-snapshot
The cones and foci proof technique for timed transition systems
inferred← citeshttps://doi.org/10.3233/fi-1997-323407openalex-snapshot
An Axiomatization for Regular Processes in Timed Branching Bisimulation
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.3233/fun-2008-873-402openalex-snapshot
Is Timed Branching Bisimilarity a Congruence Indeed?
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.