On the public citation graph
Structured operational semantics and bisimulation as a congruence
0 signed · 60 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-10235-3openalex-snapshot
A Calculus of Communicating Systems
inferredcites →https://doi.org/10.1007/3-540-11981-7_17openalex-snapshot
An operational semantics for CSP
inferredcites →https://doi.org/10.1007/3-540-18625-5_49openalex-snapshot
Merge and termination in process algebra
inferredcites →https://doi.org/10.1007/bfb0017309openalex-snapshot
Concurrency and automata on infinite sequences
inferredcites →https://doi.org/10.1007/bfb0039617openalex-snapshot
Bounded nondeterminism and the approximation induction principle in process algebra
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(85)90093-3openalex-snapshot
Higher-level synchronising devices in Meije-SCCS
inferredcites →https://doi.org/10.1016/0304-3975(87)90065-xopenalex-snapshot
Observation equivalence as a testing equivalence
inferredcites →https://doi.org/10.1016/s0049-237x(09)70651-2openalex-snapshot
A Complete Inference System for Regular Processes with Silent Moves
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.1994.1095openalex-snapshot
Fully Abstract Denotational Models for Nonuniform Concurrent Languages
inferred← citeshttps://doi.org/10.1007/3-540-49366-2_11openalex-snapshot
Taxonomy and Expressiveness of Preemption: A Syntactic Approach
inferred← citeshttps://doi.org/10.1007/3-540-52559-9_76openalex-snapshot
Compositional theories based on an operational semantics of contexts
inferred← citeshttps://doi.org/10.1007/3-540-53479-2_1openalex-snapshot
Processes as data types: Observational semantics and logic
inferred← citeshttps://doi.org/10.1007/3-540-53982-4_22openalex-snapshot
Comparative semantics for a real-time programming language with integration
inferred← citeshttps://doi.org/10.1007/3-540-54430-5_108openalex-snapshot
Experiments on processes with backtracking
inferred← citeshttps://doi.org/10.1007/3-540-55092-5_4openalex-snapshot
Modelling real-time behavior with an interval time calculus
inferred← citeshttps://doi.org/10.1007/3-540-57887-0_110openalex-snapshot
Undecidable equivalences for basic parallel processes
inferred← citeshttps://doi.org/10.1007/3-540-60692-0_57openalex-snapshot
On the expressive power of CCS
inferred← citeshttps://doi.org/10.1007/3-540-60915-6_5openalex-snapshot
Modal and temporal logics for processes
inferred← citeshttps://doi.org/10.1007/978-1-4471-3217-2_8openalex-snapshot
Computing Ready Simulations Efficiently
inferred← citeshttps://doi.org/10.1007/978-1-4471-3503-6_25openalex-snapshot
Congruences for τ-respecting Formats of Rules
inferred← citeshttps://doi.org/10.1007/978-1-4471-3860-0_6openalex-snapshot
Experimenting with Process Equivalence
inferred← citeshttps://doi.org/10.1007/978-3-031-15629-8_7openalex-snapshot
Better Automata Through Process Algebra
inferred← citeshttps://doi.org/10.1007/978-3-319-63121-9_10openalex-snapshot
Negative Results on Decidability and Small Model Property of Process Equations
inferred← citeshttps://doi.org/10.1007/978-3-662-04293-9_9openalex-snapshot
Structural Operational Semantics
inferred← citeshttps://doi.org/10.1007/bf01215409openalex-snapshot
When is partial trace equivalence adequate?
inferred← citeshttps://doi.org/10.1007/bfb0023775openalex-snapshot
Ordinal processes in comparative concurrency semantics
inferred← citeshttps://doi.org/10.1007/bfb0039050openalex-snapshot
Ideal specification formalism = expressivity + compositionality + decidability + testability + ...
inferred← citeshttps://doi.org/10.1007/bfb0039053openalex-snapshot
Process algebra with a zero object
inferred← citeshttps://doi.org/10.1007/bfb0084782openalex-snapshot
On the uniqueness of fixpoints modulo observation congruence
inferred← citeshttps://doi.org/10.1007/bfb0084783openalex-snapshot
Verification of parallel systems via decomposition
inferred← citeshttps://doi.org/10.1016/0167-6423(95)00003-bopenalex-snapshot
Transformational design and implementation of a new efficient solution to the ready simulation problem
inferred← citeshttps://doi.org/10.1016/0167-739x(90)90024-8openalex-snapshot
The expressive power of parallelism
inferred← citeshttps://doi.org/10.1016/0304-3975(92)90050-popenalex-snapshot
Experimenting with process equivalence
inferred← citeshttps://doi.org/10.1016/0304-3975(92)90186-jopenalex-snapshot
Observational structures and their logic
inferred← citeshttps://doi.org/10.1016/0304-3975(93)90111-6openalex-snapshot
Transition system specifications with negative premises
inferred← citeshttps://doi.org/10.1016/b978-044482830-9/50021-7openalex-snapshot
Structural Operational Semantics
inferred← citeshttps://doi.org/10.1016/j.ic.2008.12.011openalex-snapshot
Undecidable equivalences for basic parallel processes
inferred← citeshttps://doi.org/10.1016/j.jlamp.2015.08.001openalex-snapshot
Revisiting sequential composition in process calculi
inferred← citeshttps://doi.org/10.1016/j.jlap.2010.03.001openalex-snapshot
A precongruence format for should testing preorder
inferred← citeshttps://doi.org/10.1051/ita/1994280100511openalex-snapshot
On deciding some equivalences for concurrent processes
inferred← citeshttps://doi.org/10.1109/lics.1990.113738openalex-snapshot
Equation solving using modal transition systems
inferred← citeshttps://doi.org/10.1109/lics.1991.151662openalex-snapshot
On the relationship between process algebra and input/output automata
inferred← citeshttps://doi.org/10.1109/lics.1992.185524openalex-snapshot
The lazy lambda calculus in a concurrency scenario
inferred← citeshttps://doi.org/10.1109/lics.1992.185526openalex-snapshot
Turning SOS rules into equations
inferred← citeshttps://doi.org/10.1109/lics.1992.185529openalex-snapshot
Equivalences on observable processes
inferred← citeshttps://doi.org/10.1109/mwscas.2001.986276openalex-snapshot
Congruent weak conformance
inferred← citeshttps://doi.org/10.3233/fi-1994-201231openalex-snapshot
BISIMULATION SEMANTICS FOR CONCURRENCY WITH ATOMICITY AND ACTION REFINEMENT
inferred← citeshttps://doi.org/10.4204/eptcs.18.3openalex-snapshot
Causality in the Semantics of Esterel: Revisited
inferred← citeshttps://doi.org/10.70675/4304aa95z48b6z400az97ebzd9800ded803bopenalex-snapshot
Higher-order languages : dualities and bisimulation enhancements
inferred← citeshttps://doi.org/10.7146/brics.v3i39.20021openalex-snapshot
On the Complexity of Deciding Behavioural Equivalences and Preorders. A Survey
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.