On the public citation graph

Generalized bisimulation in relational specifications

0 signed · 33 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-10235-3openalex-snapshot
A Calculus of Communicating Systems
inferredcites →https://doi.org/10.1007/3-540-15198-2_22openalex-snapshot
On the parameterized algebraic specification of concurrent systems
inferredcites →https://doi.org/10.1007/3-540-17660-8_55openalex-snapshot
SMoLCS-driven concurrent calculi
inferredcites →https://doi.org/10.1007/3-540-18419-8_11openalex-snapshot
An outline of the SMoLCS approach
inferredcites →https://doi.org/10.1007/bf00625280openalex-snapshot
Partial abstract types
inferredcites →https://doi.org/10.1007/bfb0016244openalex-snapshot
Relational specifications and observational semantics
inferredcites →https://doi.org/10.1007/bfb0017309openalex-snapshot
Concurrency and automata on infinite sequences
inferredcites →https://doi.org/10.1016/0304-3975(83)90114-7openalex-snapshot
Calculi for synchrony and asynchrony
inferredcites →https://doi.org/10.1051/ita/1983170201371openalex-snapshot
Algebraic definition of a functional programming language and its semantic models

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.1052openalex-snapshot
A Fully Abstract Denotational Model for Higher-Order Processes
inferred← citeshttps://doi.org/10.1007/11539452_25openalex-snapshot
SOS for Higher Order Processes
inferred← citeshttps://doi.org/10.1007/3-540-50403-6_38openalex-snapshot
Data in a concurrent environment
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-55808-x_45openalex-snapshot
Fully abstract semantics for higher order communicating systems
inferred← citeshttps://doi.org/10.1007/3-540-56610-4_62openalex-snapshot
From π-calculus to higher-order π-calculus — and back
inferred← citeshttps://doi.org/10.1007/978-1-4471-3196-0_24openalex-snapshot
Operational Theories of Improvement in Functional Languages
inferred← citeshttps://doi.org/10.1007/bf02944905openalex-snapshot
Towards a theory of bisimulation for the higher-order process calculi
inferred← citeshttps://doi.org/10.1007/bfb0015037openalex-snapshot
An integrated algebraic approach to the specification of data types, processes and objects
inferred← citeshttps://doi.org/10.1007/bfb0029625openalex-snapshot
Specification & verification of higher order processes
inferred← citeshttps://doi.org/10.1007/pl00013308openalex-snapshot
Labelled transition logic: an outline
inferred← citeshttps://doi.org/10.1016/0304-3975(92)90186-jopenalex-snapshot
Observational structures and their logic
inferred← citeshttps://doi.org/10.1016/j.entcs.2005.05.005openalex-snapshot
Contextual Labelled Semantics for Higher-order Process Calculi
inferred← citeshttps://doi.org/10.1016/j.entcs.2005.11.077openalex-snapshot
A Hierarchy of SOS Rule Formats
inferred← citeshttps://doi.org/10.1016/j.entcs.2005.12.099openalex-snapshot
Bisimulation and Co-induction: Some Problems
inferred← citeshttps://doi.org/10.1016/j.tcs.2006.12.019openalex-snapshot
SOS formats and meta-theory: 20 years after
inferred← citeshttps://doi.org/10.1016/j.tcs.2011.12.058openalex-snapshot
Foundational aspects of multiscale modeling of biological systems with process algebras
inferred← citeshttps://doi.org/10.1016/s1571-0661(04)80873-9openalex-snapshot
First–order Semantics for Higher–order Processes
inferred← citeshttps://doi.org/10.1017/cbo9780511777110openalex-snapshot
Introduction to Bisimulation and Coinduction
inferred← citeshttps://doi.org/10.1109/lics.2004.1319624openalex-snapshot
Bisimulation: from the origins to today
inferred← citeshttps://doi.org/10.1145/289423.289430openalex-snapshot
A theory of core fudgets
inferred← citeshttps://doi.org/10.4204/eptcs.40.5openalex-snapshot
Aspects of multiscale modelling in a process algebra for biological systems
inferred← citeshttps://doi.org/10.6092/unibo/amsdottorato/2285openalex-snapshot
Higher-Order Concurrency: Expressiveness and Decidability Results
inferred← citeshttps://doi.org/10.6100/ir594899openalex-snapshot
Structuring 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.