On the public citation graph

When is partial trace equivalence adequate?

https://doi.org/10.1007/bf01215409
0 signed · 45 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.1007/3-540-51486-4_71openalex-snapshot
Equivalence notions for concurrent systems and refinement of actions
inferredcites →https://doi.org/10.1007/3-540-53479-2_16openalex-snapshot
Observers, experiments, and agents: A comprehensive approach to parallelism
inferredcites →https://doi.org/10.1007/3-540-54430-5_87openalex-snapshot
Algebraic formulations of trace theory
inferredcites →https://doi.org/10.1007/3-540-55511-0_4openalex-snapshot
A simple language supporting angelic nondeterminism and parallel composition
inferredcites →https://doi.org/10.1007/3-540-57208-2_6openalex-snapshot
The linear time — Branching time spectrum II
inferredcites →https://doi.org/10.1007/bf01660032openalex-snapshot
A formal model for defining and classifying delay-insensitive circuits and systems
inferredcites →https://doi.org/10.1007/bfb0013025openalex-snapshot
Basic notions of trace theory
inferredcites →https://doi.org/10.1007/bfb0013028openalex-snapshot
Permutation of transitions: An event structure semantics for CCS and SCCS
inferredcites →https://doi.org/10.1007/bfb0035774openalex-snapshot
Structured operational semantics and bisimulation as a congruence
inferredcites →https://doi.org/10.1016/0167-6423(90)90076-popenalex-snapshot
Communication and concurrency
inferredcites →https://doi.org/10.1016/0169-7552(87)90085-7openalex-snapshot
Introduction to the ISO specification language LOTOS
inferredcites →https://doi.org/10.1016/0304-3975(83)90114-7openalex-snapshot
Calculi for synchrony and asynchrony
inferredcites →https://doi.org/10.1016/0304-3975(84)90113-0openalex-snapshot
Testing equivalences for processes
inferredcites →https://doi.org/10.1016/0304-3975(85)90028-3openalex-snapshot
Determinancy → (observation equivalence = trace equivalence)
inferredcites →https://doi.org/10.1016/0304-3975(85)90093-3openalex-snapshot
Higher-level synchronising devices in Meije-SCCS
inferredcites →https://doi.org/10.1016/0304-3975(91)90333-wopenalex-snapshot
Determinism → (event structure isomorphism = step sequence equivalence)
inferredcites →https://doi.org/10.1016/0304-3975(92)90050-popenalex-snapshot
Experimenting with process equivalence
inferredcites →https://doi.org/10.1016/0890-5401(90)90048-mopenalex-snapshot
Bisimulation and divergence
inferredcites →https://doi.org/10.1016/0890-5401(92)90013-6openalex-snapshot
Structured operational semantics and bisimulation as a congruence
inferredcites →https://doi.org/10.1016/c2009-0-14341-6openalex-snapshot
The Lambda Calculus - Its Syntax and Semantics
inferredcites →https://doi.org/10.1016/s0019-9958(83)80029-1openalex-snapshot
Synchronous and asynchronous experiments on processes
inferredcites →https://doi.org/10.1017/s0960129500000189openalex-snapshot
Quantales, observational logic and process semantics
inferredcites →https://doi.org/10.1109/lics.1991.151662openalex-snapshot
On the relationship between process algebra and input/output automata
inferredcites →https://doi.org/10.1145/200836.200876openalex-snapshot
Bisimulation can't be traced
inferredcites →https://doi.org/10.1145/233551.233556openalex-snapshot
Branching time and abstraction in bisimulation semantics
inferredcites →https://doi.org/10.1145/357980.358021openalex-snapshot
Communicating sequential processes
inferredcites →https://doi.org/10.1145/359576.359585openalex-snapshot
Communicating sequential processes
inferredcites →https://doi.org/10.1145/73560.73580openalex-snapshot
Bisimulation can't be traced
inferredcites →https://doi.org/10.1145/828.833openalex-snapshot
A Theory of Communicating Sequential Processes
inferredcites →https://doi.org/10.7551/mitpress/6874.001.0001openalex-snapshot
Trace Theory for Automatic Hierarchical Verification of Speed-Independent Circuits

What points at this work

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

inferred← citeshttps://doi.org/10.1006/jcss.1999.1663openalex-snapshot
Rooted Branching Bisimulation as a Congruence
inferred← citeshttps://doi.org/10.1007/978-3-031-61716-4_1openalex-snapshot
Sequential Value Passing Yields a Kleene Theorem for Processes
inferred← citeshttps://doi.org/10.1007/978-3-540-45187-7_5openalex-snapshot
Syntactic Formats for Free
inferred← citeshttps://doi.org/10.1007/978-3-662-04293-9_9openalex-snapshot
Structural Operational Semantics
inferred← citeshttps://doi.org/10.1007/s00236-003-0111-1openalex-snapshot
Structural operational semantics and bounded nondeterminism
inferred← citeshttps://doi.org/10.1016/b978-044482830-9/50021-7openalex-snapshot
Structural Operational Semantics
inferred← citeshttps://doi.org/10.1016/j.ic.2019.104435openalex-snapshot
Divide and congruence III: From decomposition of modal formulas to preservation of stability and divergence
inferred← citeshttps://doi.org/10.1109/lics.2000.855760openalex-snapshot
Precongruence formats for decorated trace preorders
inferred← citeshttps://doi.org/10.1145/963927.963929openalex-snapshot
Precongruence formats for decorated trace semantics
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-2010-372openalex-snapshot
Equivalence of Processes in Partially Commutative Object-Oriented Environments
inferred← citeshttps://doi.org/10.4204/eptcs.255.1openalex-snapshot
Sequential Composition in the Presence of Intermediate Termination (Extended Abstract)
inferred← citeshttps://doi.org/10.4204/eptcs.322.2openalex-snapshot
Divergence-Preserving Branching Bisimilarity
inferred← citeshttps://doi.org/10.4230/lipics.csl.2017.25openalex-snapshot
Precongruence Formats with Lookahead through Modal Decomposition
inferred← citeshttps://doi.org/10.7146/brics.v6i30.20099openalex-snapshot
Structural Operational Semantics
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.