On the public citation graph

Partial ordering derivations for CCS

0 signed · 69 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-12925-1_42openalex-snapshot
Non-sequential behaviour
inferredcites →https://doi.org/10.1007/978-3-642-82921-5_2openalex-snapshot
Distributed Systems, Partial Orderings of Events, and Event Structures
inferredcites →https://doi.org/10.1007/978-94-009-7893-5_14openalex-snapshot
Behaviors of Processes and Synchronized Systems of Processes
inferredcites →https://doi.org/10.1007/bf00266047openalex-snapshot
COSY ? a system specification language based on paths and processes
inferredcites →https://doi.org/10.1007/bfb0012800openalex-snapshot
Event structure semantics for CCS and related languages
inferredcites →https://doi.org/10.1007/bfb0036905openalex-snapshot
On the observational semantics of fair parallelism
inferredcites →https://doi.org/10.1016/0304-3975(80)90004-3openalex-snapshot
Behaviours of concurrent systems
inferredcites →https://doi.org/10.1016/0304-3975(84)90113-0openalex-snapshot
Testing equivalences for processes
inferredcites →https://doi.org/10.1016/s0019-9958(83)80040-0openalex-snapshot
The non-sequential behaviour of Petri nets
inferredcites →https://doi.org/10.1108/ir.1999.04926fae.001openalex-snapshot
Lecture Notes in Computer Science 1205
inferredcites →https://doi.org/10.1145/3335772.3335934openalex-snapshot
Time, clocks, and the ordering of events in a distributed system
inferredcites →https://doi.org/10.1145/359545.359563openalex-snapshot
Time, clocks, and the ordering of events in a distributed system
inferredcites →https://doi.org/10.1145/582153.582177openalex-snapshot
On the composition of processes
inferredcites →https://doi.org/10.1145/800057.808663openalex-snapshot
Liveness properties as convergence in metric spaces
inferredcites →https://doi.org/10.1145/828.833openalex-snapshot
A Theory of Communicating Sequential Processes
inferredcites →https://doi.org/10.7146/dpb.v6i78.7691openalex-snapshot
Concurrent Program Schemes and their Interpretations

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.2000.3058openalex-snapshot
Language-based Performance Prediction for Distributed and Mobile Systems
inferred← citeshttps://doi.org/10.1007/3-540-15198-2_3openalex-snapshot
Specification languages for distributed systems
inferred← citeshttps://doi.org/10.1007/3-540-17660-8_52openalex-snapshot
On the semantics of concurrency: Partial orders and transition systems
inferred← citeshttps://doi.org/10.1007/3-540-18419-8_12openalex-snapshot
Views of distributed systems
inferred← citeshttps://doi.org/10.1007/3-540-18419-8_13openalex-snapshot
CCS is an (augmented) contact free C/E system
inferred← citeshttps://doi.org/10.1007/3-540-45499-3_18openalex-snapshot
A Causal Semantics for Timed Default Concurrent Constraint Programming
inferred← citeshttps://doi.org/10.1007/3-540-49727-7_10openalex-snapshot
Constructing Specific SOS Semantics for Concurrency via Abstract Interpretation
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-53479-2_14openalex-snapshot
CCS and petri nets
inferred← citeshttps://doi.org/10.1007/3-540-53479-2_4openalex-snapshot
Flow event structures and flow nets
inferred← citeshttps://doi.org/10.1007/3-540-53479-2_5openalex-snapshot
Three equivalent semantics for CCS
inferred← citeshttps://doi.org/10.1007/3-540-55719-9_110openalex-snapshot
Proved trees
inferred← citeshttps://doi.org/10.1007/3-540-56689-9_46openalex-snapshot
Distributed implementation of CCS
inferred← citeshttps://doi.org/10.1007/3-540-59450-7_4openalex-snapshot
Distributed conflicts in communicating systems
inferred← citeshttps://doi.org/10.1007/3-540-60084-1_113openalex-snapshot
Causality for mobile processes
inferred← citeshttps://doi.org/10.1007/3-540-60222-4_95openalex-snapshot
An efficient verifier of truly concurrent properties
inferred← citeshttps://doi.org/10.1007/3-540-62503-8_1openalex-snapshot
Logical and operational methods in the analysis of programs and systems
inferred← citeshttps://doi.org/10.1007/3-540-62503-8_14openalex-snapshot
Mobile processes with local clocks
inferred← citeshttps://doi.org/10.1007/3540539816_56openalex-snapshot
An extended expansion theorem
inferred← citeshttps://doi.org/10.1007/978-1-4471-3217-2_7openalex-snapshot
Observation Trees
inferred← citeshttps://doi.org/10.1007/978-3-319-25527-9_1openalex-snapshot
Pierpaolo Degano
inferred← citeshttps://doi.org/10.1007/978-3-540-39866-0_30openalex-snapshot
Causality and Replication in Concurrent Processes
inferred← citeshttps://doi.org/10.1007/978-3-540-49020-3_14openalex-snapshot
Semantic-Driven Performance Evaluation
inferred← citeshttps://doi.org/10.1007/978-3-540-68679-8_47openalex-snapshot
Twenty Years on: Reflections on the CEDISYS Project. Combining True Concurrency with Process Algebra
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/bf00277389openalex-snapshot
Representing CCS programs by finite predicate/transition nets
inferred← citeshttps://doi.org/10.1007/bf02252682openalex-snapshot
Verification of distributed programs using representative interleaving sequences
inferred← citeshttps://doi.org/10.1007/bf02915446openalex-snapshot
A distributed operational semantics for CCS based on condition/event systems
inferred← citeshttps://doi.org/10.1007/bfb0013028openalex-snapshot
Permutation of transitions: An event structure semantics for CCS and SCCS
inferred← citeshttps://doi.org/10.1007/bfb0013032openalex-snapshot
An efficient verification method for parallel and distributed programs
inferred← citeshttps://doi.org/10.1007/bfb0018342openalex-snapshot
An algebraic view of interleaving and distributed operational semantics for CCS
inferred← citeshttps://doi.org/10.1007/bfb0032743openalex-snapshot
True concurrency via abstract interpretation
inferred← citeshttps://doi.org/10.1016/0022-0000(87)90032-8openalex-snapshot
Concurrent histories: A basis for observing distributed systems
inferred← citeshttps://doi.org/10.1016/0304-3975(88)90096-5openalex-snapshot
Concurrency and atomicity
inferred← citeshttps://doi.org/10.1016/0304-3975(90)90095-yopenalex-snapshot
A partial ordering semantics for CCS
inferred← citeshttps://doi.org/10.1016/0304-3975(91)90025-wopenalex-snapshot
Decoders with initial state invariance for multivalued encodings
inferred← citeshttps://doi.org/10.1016/0304-3975(94)00073-ropenalex-snapshot
On the implementation of concurrent calculi in net calculi: two case studies
inferred← citeshttps://doi.org/10.1016/b978-0-12-046370-1.50013-9openalex-snapshot
Some Fixpoint Techniques in Algebraic Structures and Applications to Computer Science
inferred← citeshttps://doi.org/10.1016/b978-044482830-9/50033-3openalex-snapshot
Process Algebras with Localities
inferred← citeshttps://doi.org/10.1016/j.jlap.2006.11.002openalex-snapshot
Reversing algebraic process calculi
inferred← citeshttps://doi.org/10.1016/s0304-3975(06)80004-6openalex-snapshot
Control machines: A new model of parallelism for compositional specifications and their effective compilation
inferred← citeshttps://doi.org/10.1016/s0304-3975(99)80003-6openalex-snapshot
Non-interleaving semantics for mobile processes
inferred← citeshttps://doi.org/10.1109/32.962559openalex-snapshot
Performance evaluation of mobile processes via abstract machines
inferred← citeshttps://doi.org/10.1145/23005.24038openalex-snapshot
A model for distributed systems based on graph rewriting
inferred← citeshttps://doi.org/10.1145/234528.234748openalex-snapshot
Enhanced operational semantics
inferred← citeshttps://doi.org/10.1145/384192.384194openalex-snapshot
Enhanced operational semantics
inferred← citeshttps://doi.org/10.1145/41840.41855openalex-snapshot
Interleaving set temporal logic
inferred← citeshttps://doi.org/10.1145/76359.76369openalex-snapshot
Distributed bisimulations
inferred← citeshttps://doi.org/10.1609/aaai.v34i05.6199openalex-snapshot
An Operational Semantics for True Concurrency in BDI Agent Systems
inferred← citeshttps://doi.org/10.3233/fi-1996-27402openalex-snapshot
ON FOUR PARTIAL ORDERING SEMANTICS FOR A PROCESS CALCULUS
inferred← citeshttps://doi.org/10.3233/fi-1999-402306openalex-snapshot
Applying Techniques of Asynchronous Concurrency to Synchronous Languages
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.