On the public citation graph

A complete compositional modal proof system for a subset of CCS

https://doi.org/10.1007/bfb0015773
0 signed · 51 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-07135-0_113openalex-snapshot
A fundamental theorem of asynchronous parallel computation
inferredcites →https://doi.org/10.1007/3-540-09237-4openalex-snapshot
First-Order Dynamic Logic
inferredcites →https://doi.org/10.1007/3-540-10235-3openalex-snapshot
A Calculus of Communicating Systems
inferredcites →https://doi.org/10.1007/3-540-10828-9_52openalex-snapshot
A modal characterisation of observable machine-behaviour
inferredcites →https://doi.org/10.1007/3-540-12689-9_89openalex-snapshot
Experiments, powerdomains and fully abstract models for applicative multiprogramming
inferredcites →https://doi.org/10.1007/3-540-12896-4_381openalex-snapshot
Property preserving homomorphisms of transition systems
inferredcites →https://doi.org/10.1007/3-540-12896-4_384openalex-snapshot
A proof system for partial correctness of dynamic networks of processes
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/3-540-15198-2_16openalex-snapshot
A complete modal proof system for a subset of SCCS
inferredcites →https://doi.org/10.1007/3-540-15670-4_3openalex-snapshot
On the composition and decomposition of assertions
inferredcites →https://doi.org/10.1007/3-540-16042-6_22openalex-snapshot
A complete proof system for SCCS with modal assertions
inferredcites →https://doi.org/10.1007/bf00265555openalex-snapshot
Fairness and related properties in transition systems ? a temporal logic to deal with fairness
inferredcites →https://doi.org/10.1007/bf00268134openalex-snapshot
An axiomatic proof technique for parallel programs I
inferredcites →https://doi.org/10.1007/bf00289062openalex-snapshot
The ?Hoare logic? of concurrent programs
inferredcites →https://doi.org/10.1007/bf00289266openalex-snapshot
A proof technique for communicating sequential processes
inferredcites →https://doi.org/10.1007/bfb0015763openalex-snapshot
A context dependent equivalence between processes
inferredcites →https://doi.org/10.1007/bfb0017309openalex-snapshot
Concurrency and automata on infinite sequences
inferredcites →https://doi.org/10.1007/bfb0030311openalex-snapshot
The power of the future perfect in program logics
inferredcites →https://doi.org/10.1007/bfb0036900openalex-snapshot
Behavioural equivalence relations induced by programming logics
inferredcites →https://doi.org/10.1007/bfb0036936openalex-snapshot
Testing equivalences for processes
inferredcites →https://doi.org/10.1016/0304-3975(82)90067-6openalex-snapshot
A unified approach for studying the properties of transition systems
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)90129-xopenalex-snapshot
A proof-theoretic characterization of observational equivalence
inferredcites →https://doi.org/10.1145/2455.2460openalex-snapshot
Algebraic laws for nondeterminism and concurrency
inferredcites →https://doi.org/10.1145/357103.357110openalex-snapshot
A Proof System for Communicating Sequential Processes
inferredcites →https://doi.org/10.1145/567067.567081openalex-snapshot
"Sometimes" and "not never" revisited
inferredcites →https://doi.org/10.1145/567067.567082openalex-snapshot
How to cook a temporal proof system for your pet language
inferredcites →https://doi.org/10.1145/800057.808665openalex-snapshot
Now you may compose temporal logic specifications
inferredcites →https://doi.org/10.1145/828.833openalex-snapshot
A Theory of Communicating Sequential Processes
inferredcites →https://doi.org/10.1515/9781400882618-006openalex-snapshot
Gedanken-Experiments on Sequential Machines

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-45352-0_18openalex-snapshot
Compositional Verification of Synchronous Networks
inferred← citeshttps://doi.org/10.1007/3-540-58140-5_2openalex-snapshot
On model checking infinite-state systems
inferred← citeshttps://doi.org/10.1007/978-3-540-28629-5_41openalex-snapshot
Compositional Verification: Decidability Issues Using Graph Substitutions
inferred← citeshttps://doi.org/10.1007/978-3-540-45077-1_38openalex-snapshot
Compositionality of Hennessy-Milner Logic through Structural Operational Semantics
inferred← citeshttps://doi.org/10.1007/978-3-540-70583-3_9openalex-snapshot
Completeness and Logical Full Abstraction in Modal Logics for Typed Mobile Processes
inferred← citeshttps://doi.org/10.1007/978-3-642-11623-0_11openalex-snapshot
Program Logics for Sequential Higher-Order Control
inferred← citeshttps://doi.org/10.1007/978-3-642-29320-7_3openalex-snapshot
Decompositional Reasoning about the History of Parallel Processes
inferred← citeshttps://doi.org/10.1007/bf01887208openalex-snapshot
A refinement calculus for specifications in Hennessy-Milner logic with recursion
inferred← citeshttps://doi.org/10.1007/bfb0035379openalex-snapshot
Partial model checking with ROBDDs
inferred← citeshttps://doi.org/10.1016/0020-0190(91)90163-copenalex-snapshot
Compositionality and bisimulation: a negative result
inferred← citeshttps://doi.org/10.1016/0304-3975(87)90007-7openalex-snapshot
A context dependent equivalence between processes
inferred← citeshttps://doi.org/10.1016/0304-3975(87)90012-0openalex-snapshot
Modal logics for communicating systems
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/j.scico.2004.07.002openalex-snapshot
Compositionality and locality for improving model checking in the selective mu-calculus
inferred← citeshttps://doi.org/10.1016/j.tcs.2005.11.035openalex-snapshot
Compositionality of Hennessy–Milner logic by structural operational semantics
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.1109/lics.1994.316076openalex-snapshot
A compositional proof system for the modal μ-calculus
inferred← citeshttps://doi.org/10.14236/ewic/vocs2008.22openalex-snapshot
A Unified Theory of Program Logics: An Approach based on the π-Calculus
inferred← citeshttps://doi.org/10.7146/brics.v1i34.21609openalex-snapshot
A Compositional Proof System for the Modal mu-Calculus
inferred← citeshttps://doi.org/10.7146/brics.v5i40.19485openalex-snapshot
A Compositional Proof System for the Modal mu-Calculus
inferred← citeshttps://doi.org/10.7146/dpb.v22i445.6762openalex-snapshot
Verification of Temporal Properties of Concurrent Systems
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.