On the public citation graph
A logic for the specification and proof of regular controllable processes of CCS
0 signed · 23 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-13345-3_20openalex-snapshot
A modal characterization of observational congruence on finite terms of CCS
inferredcites →https://doi.org/10.1007/bfb0012782openalex-snapshot
Results on the propositional μ-calculus
inferredcites →https://doi.org/10.1007/bfb0036900openalex-snapshot
Behavioural equivalence relations induced by programming logics
inferredcites →https://doi.org/10.1016/0304-3975(85)90129-xopenalex-snapshot
A proof-theoretic characterization of observational equivalence
inferredcites →https://doi.org/10.1016/s0019-9958(86)80038-9openalex-snapshot
A logic for the description of non-deterministic programs and their properties
inferredcites →https://doi.org/10.1145/2455.2460openalex-snapshot
Algebraic laws for nondeterminism and concurrency
inferredcites →https://doi.org/10.1145/828.833openalex-snapshot
A Theory of Communicating Sequential Processes
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-18088-5_10openalex-snapshot
Readiness semantics for regular processes with silent actions
inferred← citeshttps://doi.org/10.1007/3-540-51803-7_21openalex-snapshot
An expressive logic for a process algebra with silent actions
inferred← citeshttps://doi.org/10.1007/3-540-56496-9_21openalex-snapshot
Property preserving simulations
inferred← citeshttps://doi.org/10.1007/3-540-56610-4_95openalex-snapshot
Property preserving abstractions under parallel composition
inferred← citeshttps://doi.org/10.1007/3-540-57182-5_37openalex-snapshot
An expressive logic for Basic Process Algebra
inferred← citeshttps://doi.org/10.1007/978-3-642-72822-8_16openalex-snapshot
Finite Conjunctive Nondeterminism (Extended Abstract)
inferred← citeshttps://doi.org/10.1007/bfb0013027openalex-snapshot
A logic for the description of behaviours and properties of concurrent systems
inferred← citeshttps://doi.org/10.1007/bfb0015727openalex-snapshot
Linear and branching structures in the semantics and logics of reactive systems
inferred← citeshttps://doi.org/10.1007/bfb0026106openalex-snapshot
Proof systems for Hennessy-Milner Logic with recursion
inferred← citeshttps://doi.org/10.1016/0168-0072(91)90065-topenalex-snapshot
Domain theory in logical form*
inferred← citeshttps://doi.org/10.1016/0304-3975(90)90038-jopenalex-snapshot
Proof systems for satisfiability in Hennessy-Milner Logic with recursion
inferred← citeshttps://doi.org/10.1016/s0019-9958(86)80038-9openalex-snapshot
A logic for the description of non-deterministic programs and their properties
inferred← citeshttps://doi.org/10.1145/165854.167976openalex-snapshot
Regular types for active objects
inferred← citeshttps://doi.org/10.1145/167962.167976openalex-snapshot
Regular types for active objects
inferred← citeshttps://doi.org/10.4230/lipics.itp.2019.31openalex-snapshot
Domain Theory and the Logic of Observable Properties
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.