On the public citation graph

Proof systems for message-passing process algebras

https://doi.org/10.1007/bf01213531
0 signed · 46 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.1006/inco.1993.1067openalex-snapshot
A Theory of Communicating Processes with Value Passing
inferredcites →https://doi.org/10.1007/3-540-55179-4_14openalex-snapshot
PAM: A process algebra manipulator
inferredcites →https://doi.org/10.1007/978-1-4471-2120-6_2openalex-snapshot
The Syntax and Semantics of μCRL
inferredcites →https://doi.org/10.1007/bf01642508openalex-snapshot
A proof system for communicating processes with value-passing
inferredcites →https://doi.org/10.1007/bf01887209openalex-snapshot
Automated analysis of mutual exclusion algorithms using CCS
inferredcites →https://doi.org/10.1007/s002360050020openalex-snapshot
A modal logic for message passing processes
inferredcites →https://doi.org/10.1016/0304-3975(94)00172-fopenalex-snapshot
Symbolic bisimulations
inferredcites →https://doi.org/10.1016/0890-5401(92)90008-4openalex-snapshot
A calculus of mobile processes, I
inferredcites →https://doi.org/10.1145/151646.151648openalex-snapshot
The concurrency workbench

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-44450-5_22openalex-snapshot
A Complete Axiomatisation for Timed Automata
inferred← citeshttps://doi.org/10.1007/3-540-46016-0_42openalex-snapshot
Towards a Model for an Immune System
inferred← citeshttps://doi.org/10.1007/3-540-46432-8_14openalex-snapshot
A Proof System for Timed Automata
inferred← citeshttps://doi.org/10.1007/3-540-49059-0_21openalex-snapshot
Computing Strong/Weak Bisimulation Equivalences and Observation Congruence for Value-Passing Processes
inferred← citeshttps://doi.org/10.1007/3-540-60218-6_5openalex-snapshot
The weak late π-calculus semantics as observation equivalence
inferred← citeshttps://doi.org/10.1007/3-540-60692-0_56openalex-snapshot
On the complexity of bisimilarity for value-passing processes
inferred← citeshttps://doi.org/10.1007/978-3-030-78089-0_1openalex-snapshot
On Bidirectional Runtime Enforcement
inferred← citeshttps://doi.org/10.1007/978-3-540-30133-2_69openalex-snapshot
A Process Algebra Model of the Immune System
inferred← citeshttps://doi.org/10.1007/978-3-540-40007-3_21openalex-snapshot
Making Timed Automata Communicate
inferred← citeshttps://doi.org/10.1007/978-3-540-73814-5_17openalex-snapshot
A Non-interleaving Denotational Semantics of Value Passing CCS with Action Refinement
inferred← citeshttps://doi.org/10.1007/978-3-540-79124-9_4openalex-snapshot
Equivalence Checking for a Finite Higher Order π-Calculus
inferred← citeshttps://doi.org/10.1007/978-3-642-11266-9_46openalex-snapshot
A Complete Symbolic Bisimulation for Full Applied Pi Calculus
inferred← citeshttps://doi.org/10.1007/978-3-642-12032-9_9openalex-snapshot
Incremental Pattern-Based Coinduction for Process Algebra and Its Isabelle Formalization
inferred← citeshttps://doi.org/10.1007/978-3-642-15240-5_17openalex-snapshot
Proof System for Applied Pi Calculus
inferred← citeshttps://doi.org/10.1007/978-3-642-39698-4_11openalex-snapshot
The Value-Passing Calculus
inferred← citeshttps://doi.org/10.1007/bf02951922openalex-snapshot
Computing bisimulations for finite-control π-calculus
inferred← citeshttps://doi.org/10.1007/bfb0014555openalex-snapshot
Local model checking for value-passing processes (Extended abstract)
inferred← citeshttps://doi.org/10.1007/s11432-014-5150-4openalex-snapshot
A formal semantics for debugging synchronous message passing-based concurrent programs
inferred← citeshttps://doi.org/10.1007/s236-002-8035-2openalex-snapshot
Axiomatising timed automata
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.egypro.2011.12.276openalex-snapshot
Weaker bisimulation: How to make a.0+b.0 and τ.a.0+b.0 equivalent?
inferred← citeshttps://doi.org/10.1016/j.jlamp.2015.08.001openalex-snapshot
Revisiting sequential composition in process calculi
inferred← citeshttps://doi.org/10.1016/j.tcs.2012.07.034openalex-snapshot
A complete symbolic bisimulation for full applied pi calculus
inferred← citeshttps://doi.org/10.1016/j.tcs.2015.07.043openalex-snapshot
Theory of interaction
inferred← citeshttps://doi.org/10.1016/s0167-6423(01)00008-9openalex-snapshot
Unique fixpoint induction for message-passing process calculi
inferred← citeshttps://doi.org/10.1016/s0890-5401(02)00014-7openalex-snapshot
Complete inference systems for weak bisimulation equivalences in the π-calculus
inferred← citeshttps://doi.org/10.1093/comjnl/39.4.303openalex-snapshot
A Process Algebra Foundation for Reasoning about Core ELLA
inferred← citeshttps://doi.org/10.1109/csse.2008.520openalex-snapshot
Stochastic Process Algebra with Value-Passing
inferred← citeshttps://doi.org/10.1109/fskd.2013.6816288openalex-snapshot
Bisimulation-based consistency checking on Feng-Han-Shi-Bi syndrome for rheumatoid arthritis
inferred← citeshttps://doi.org/10.1109/lics.1997.614942openalex-snapshot
Unique fixpoint induction for value-passing processes
inferred← citeshttps://doi.org/10.13053/cys-7-4-1068openalex-snapshot
On Modelling an Immune System
inferred← citeshttps://doi.org/10.2168/lmcs-7(3:7)2011openalex-snapshot
Permission-Based Separation Logic for Message-Passing Concurrency
inferred← citeshttps://doi.org/10.4028/www.scientific.net/amm.513-517.3397openalex-snapshot
A Calculus for Concurrent Processes with Cryptographic Primitives
inferred← citeshttps://doi.org/10.4304/jsw.9.3.536-540openalex-snapshot
Bisimulation-based Consistency Checking on Syndrome Feng-Shi-Re-Bi in Rheumatoid Arthritis
inferred← citeshttps://doi.org/10.46298/lmcs-19(1:14)2023openalex-snapshot
Bidirectional Runtime Enforcement of First-Order Branching-Time Properties
inferred← citeshttps://doi.org/10.48550/arxiv.1508.00093openalex-snapshot
The Name-Passing Calculus
inferred← citeshttps://doi.org/10.48550/arxiv.cs/0601014openalex-snapshot
Probabilistic bisimilarities between quantum processes
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.