On the public citation graph
A term model for CCS
0 signed · 98 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.1002/malq.19800261902openalex-snapshot
Lambda‐Calculus Models and Extensionality
inferredcites →https://doi.org/10.1007/3-540-08442-8_97openalex-snapshot
Functorial Semantics of the Type Free λ-βη Calculus
inferredcites →https://doi.org/10.1007/3-540-08921-7_57openalex-snapshot
Synthesis of communicating behaviour
inferredcites →https://doi.org/10.1007/3-540-09526-8_8openalex-snapshot
Full abstraction for a simple parallel programming language
inferredcites →https://doi.org/10.1007/3-540-10003-2_79openalex-snapshot
On observing nondeterminism and concurrency
inferredcites →https://doi.org/10.1016/0304-3975(77)90053-6openalex-snapshot
Fully abstract models of typed λ-calculi
inferredcites →https://doi.org/10.1016/b978-0-08-011356-2.50008-2openalex-snapshot
A λ-CALCULUS APPROACH
inferredcites →https://doi.org/10.1016/c2013-0-01911-1openalex-snapshot
Advances in Programming and Non-Numerical Computation
inferredcites →https://doi.org/10.1016/s0049-237x(08)71129-7openalex-snapshot
The Type Free Lambda Calculus
inferredcites →https://doi.org/10.1145/321992.321997openalex-snapshot
Initial Algebra Semantics and Continuous Algebras
inferredcites →https://doi.org/10.1145/322123.322134openalex-snapshot
Concurrent Processes and Their Syntax
inferredcites →https://doi.org/10.1145/357146.357150openalex-snapshot
Ten Years of Hoare's Logic: A Survey—Part I
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.2307/2274155openalex-snapshot
Handbook of mathematical logic, edited by Jon Barwise with the cooperation of H. J. Keisler, K. Kunen, Y. N. Moschovakis, and A. S. Troelstra, Studies in logic and the foundations of mathematics, vol. 90, North-Holland Publishing Company, Amsterdam, New York, and Oxford, 1978 (© 1977), xi + 1165…
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1002/sec.281openalex-snapshot
A formal separation method of protocols to eliminate parallel attacks in virtual organization
inferred← citeshttps://doi.org/10.1006/inco.1993.1067openalex-snapshot
A Theory of Communicating Processes with Value Passing
inferred← citeshttps://doi.org/10.1006/inco.1995.1114openalex-snapshot
Testing Equivalence for Mobile Processes
inferred← citeshttps://doi.org/10.1006/inco.1996.0077openalex-snapshot
CPO Models for Compact GSOS Languages
inferred← citeshttps://doi.org/10.1006/inco.2002.2968openalex-snapshot
A Fully Abstract Model for the π-calculus
inferred← citeshttps://doi.org/10.1007/3-540-10828-9_52openalex-snapshot
A modal characterisation of observable machine-behaviour
inferred← citeshttps://doi.org/10.1007/3-540-10828-9_61openalex-snapshot
On the algebraic specification of nondeterministic programming languages
inferred← citeshttps://doi.org/10.1007/3-540-10856-4_83openalex-snapshot
Semantics of CSP via translation into CCS
inferred← citeshttps://doi.org/10.1007/3-540-11494-7_5openalex-snapshot
An enlarged definition and complete axiomatization of observational congruence of finite processes
inferred← citeshttps://doi.org/10.1007/3-540-16042-6_22openalex-snapshot
A complete proof system for SCCS with modal assertions
inferred← citeshttps://doi.org/10.1007/3-540-17660-8_54openalex-snapshot
A fully observational model for infinite behaviours of communicating systems
inferred← citeshttps://doi.org/10.1007/3-540-17906-2_34openalex-snapshot
TCSP: Theory of communicating sequential processes
inferred← citeshttps://doi.org/10.1007/3-540-18170-9_174openalex-snapshot
Communication with concurrent systems via I/0-procedures
inferred← citeshttps://doi.org/10.1007/3-540-18419-8_12openalex-snapshot
Views of distributed systems
inferred← citeshttps://doi.org/10.1007/3-540-19020-1_12openalex-snapshot
Quasi-uniformities: Reconciling domains with metric spaces
inferred← citeshttps://doi.org/10.1007/3-540-50403-6_30openalex-snapshot
Requirement and design specification for distributed systems
inferred← citeshttps://doi.org/10.1007/3-540-52048-1_54openalex-snapshot
A proof system for communicating processes with value-passing (extended abstract)
inferred← citeshttps://doi.org/10.1007/3-540-57208-2_6openalex-snapshot
The linear time — Branching time spectrum II
inferred← citeshttps://doi.org/10.1007/3-540-59293-8_212openalex-snapshot
CPO models for a class of GSOS languages
inferred← citeshttps://doi.org/10.1007/3-540-60218-6_37openalex-snapshot
Bisimulations for a calculus of broadcasting systems
inferred← citeshttps://doi.org/10.1007/3-540-61604-7_50openalex-snapshot
A presheaf semantics of value-passing processes
inferred← citeshttps://doi.org/10.1007/978-3-030-01461-2_7openalex-snapshot
Characterization and Verification of Stuttering Equivalence
inferred← citeshttps://doi.org/10.1007/978-3-319-89366-2_12openalex-snapshot
Logics for Bisimulation and Divergence
inferred← citeshttps://doi.org/10.1007/978-3-642-19805-2_3openalex-snapshot
Similarity Quotients as Final Coalgebras
inferred← citeshttps://doi.org/10.1007/978-3-642-74127-2_3openalex-snapshot
Spezifikation und Entwurf komplexer, kausal vernetzter Systeme
inferred← citeshttps://doi.org/10.1007/978-3-642-74884-4_10openalex-snapshot
Towards a Design Methodology for Distributed Systems
inferred← citeshttps://doi.org/10.1007/978-3-662-01089-1_10openalex-snapshot
Semantics of Distributed Processes Derived by Translation
inferred← citeshttps://doi.org/10.1007/978-3-662-04293-9_9openalex-snapshot
Structural Operational Semantics
inferred← citeshttps://doi.org/10.1007/978-94-009-7760-0_19openalex-snapshot
An Introduction to a Calculus of Communicating Systems
inferred← citeshttps://doi.org/10.1007/bf00289140openalex-snapshot
Axiomatising finite delay operators
inferred← citeshttps://doi.org/10.1007/bf01101651openalex-snapshot
Semantics of algorithmic languages
inferred← citeshttps://doi.org/10.1007/bf01212486openalex-snapshot
Communicating processes with value-passing and assignments
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/bfb0015763openalex-snapshot
A context dependent equivalence between processes
inferred← citeshttps://doi.org/10.1007/bfb0027047openalex-snapshot
Applications of temporal logic to the specification and verification of reactive systems: A survey of current trends
inferred← citeshttps://doi.org/10.1007/bfb0032033openalex-snapshot
A theory of communicating processes with value-passing
inferred← citeshttps://doi.org/10.1007/bfb0036899openalex-snapshot
On the relationship of CCS and CSP
inferred← citeshttps://doi.org/10.1007/bfb0036905openalex-snapshot
On the observational semantics of fair parallelism
inferred← citeshttps://doi.org/10.1007/bfb0036936openalex-snapshot
Testing equivalences for processes
inferred← citeshttps://doi.org/10.1007/bfb0040264openalex-snapshot
Termination, deadlock and divergence
inferred← citeshttps://doi.org/10.1007/bfb0055626openalex-snapshot
Priority and maximal progress are completely axiomatisable (extended abstract)
inferred← citeshttps://doi.org/10.1007/bfb0084779openalex-snapshot
Testing equivalence for mobile processes
inferred← citeshttps://doi.org/10.1007/bfb0086126openalex-snapshot
A characterization of effective topological spaces
inferred← citeshttps://doi.org/10.1016/0096-0551(88)90005-7openalex-snapshot
Broadcasting buffering communication
inferred← citeshttps://doi.org/10.1016/0304-3975(83)90114-7openalex-snapshot
Calculi for synchrony and asynchrony
inferred← citeshttps://doi.org/10.1016/0304-3975(84)90113-0openalex-snapshot
Testing equivalences for processes
inferred← citeshttps://doi.org/10.1016/0304-3975(87)90007-7openalex-snapshot
A context dependent equivalence between processes
inferred← citeshttps://doi.org/10.1016/0890-5401(89)90070-9openalex-snapshot
A complete axiomatisation for observational congruence of finite-state behaviours
inferred← citeshttps://doi.org/10.1016/0890-5401(90)90048-mopenalex-snapshot
Bisimulation and divergence
inferred← citeshttps://doi.org/10.1016/b978-0-7506-0813-8.50030-7openalex-snapshot
Formal treatment of concurrency and time
inferred← citeshttps://doi.org/10.1016/b978-044482830-9/50025-4openalex-snapshot
A Symbolic Approach to Value-Passing Processes
inferred← citeshttps://doi.org/10.1016/j.ipl.2008.05.019openalex-snapshot
The equational theory of prebisimilarity over basic CCS with divergence
inferred← citeshttps://doi.org/10.1016/j.jlap.2004.03.009openalex-snapshot
The origins of structural operational semantics
inferred← citeshttps://doi.org/10.1016/s0019-9958(81)90082-6openalex-snapshot
A term model for synchronous processes
inferred← citeshttps://doi.org/10.1016/s0019-9958(83)80029-1openalex-snapshot
Synchronous and asynchronous experiments on processes
inferred← citeshttps://doi.org/10.1016/s0019-9958(84)80025-xopenalex-snapshot
Process algebra for synchronous communication
inferred← citeshttps://doi.org/10.1016/s0019-9958(84)80048-0openalex-snapshot
Semantics of communicating processes
inferred← citeshttps://doi.org/10.1016/s0020-0190(97)00163-4openalex-snapshot
A characterization of finitary bisimulation
inferred← citeshttps://doi.org/10.1016/s0304-3975(00)00281-4openalex-snapshot
A fully abstract denotational semantics for the calculus of higher-order communicating systems
inferred← citeshttps://doi.org/10.1016/s0304-3975(97)00261-2openalex-snapshot
Bisimulations for a calculus of broadcasting systems
inferred← citeshttps://doi.org/10.1016/s0304-3975(99)00339-4openalex-snapshot
Linda-based applicative and imperative process algebras
inferred← citeshttps://doi.org/10.1016/s0890-5401(03)00052-xopenalex-snapshot
A semantic theory for value-passing processes based on the late approach
inferred← citeshttps://doi.org/10.1109/lics.1996.561302openalex-snapshot
A fully-abstract model for the π-calculus
inferred← citeshttps://doi.org/10.1109/wpc.1993.263910openalex-snapshot
A process algebra based program and system representation for reverse engineering
inferred← citeshttps://doi.org/10.1145/147508.147527openalex-snapshot
Termination, deadlock, and divergence
inferred← citeshttps://doi.org/10.1145/233551.233556openalex-snapshot
Branching time and abstraction in bisimulation semantics
inferred← citeshttps://doi.org/10.1145/3009837.3009870openalex-snapshot
Analyzing divergence in bisimulation semantics
inferred← citeshttps://doi.org/10.1145/3304133.3304153openalex-snapshot
An operational semantics of multitasking and exception handling in Ada
inferred← citeshttps://doi.org/10.1145/828.833openalex-snapshot
A Theory of Communicating Sequential Processes
inferred← citeshttps://doi.org/10.23638/lmcs-13(4:15)2017openalex-snapshot
Games for Bisimulations and Abstraction
inferred← citeshttps://doi.org/10.4204/eptcs.41.3openalex-snapshot
Process Behaviour: Formulae vs. Tests (Extended Abstract)
inferred← citeshttps://doi.org/10.4204/eptcs.89.7openalex-snapshot
Musings on Encodings and Expressiveness
inferred← citeshttps://doi.org/10.7146/brics.v2i59.19960openalex-snapshot
On the Finitary Bisimulation
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.