On the public citation graph

ACPτ a universal axiom system for process specification

https://doi.org/10.1007/bfb0015048
0 signed · 27 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-13345-3_7openalex-snapshot
The algebra of recursively defined processes and the algebra of regular processes
inferredcites →https://doi.org/10.1007/3-540-17945-3_13openalex-snapshot
Petri net models for algebraic theories of concurrency
inferredcites →https://doi.org/10.1007/3-540-17945-3_5openalex-snapshot
Decidability of bisimulation equivalence for processes generating context-free languages
inferredcites →https://doi.org/10.1007/bfb0017309openalex-snapshot
Concurrency and automata on infinite sequences
inferredcites →https://doi.org/10.1016/0304-3975(87)90052-1openalex-snapshot
On the consistency of Koomen's Fair Abstraction Rule
inferredcites →https://doi.org/10.1017/cbo9780511608841.007openalex-snapshot
Correctness proofs for systolic algorithms: palindromes and sorting
inferredcites →https://doi.org/10.1017/cbo9780511608841.012openalex-snapshot
A modular approach to protocol verification using process algebra
inferredcites →https://doi.org/10.3233/fi-1989-12208openalex-snapshot
Abstraction and Empty Process in Process Algebra1

What points at this work

Incoming claims: where this work appears in other papers’ reference lists and arguments.

inferred← citeshttps://doi.org/10.1007/978-3-030-72019-3_7openalex-snapshot
Nested Session Types
inferred← citeshttps://doi.org/10.1007/978-3-030-83906-2_15openalex-snapshot
Towards Assurance-Driven Architectural Decomposition of Software Systems
inferred← citeshttps://doi.org/10.1007/978-3-319-07317-0_6openalex-snapshot
Combining Monitoring with Run-Time Assertion Checking
inferred← citeshttps://doi.org/10.1007/978-3-642-14859-0_18openalex-snapshot
A Research Framework for Interaction Computing
inferred← citeshttps://doi.org/10.1007/bfb0014423openalex-snapshot
Algebraic specification languages: An overview
inferred← citeshttps://doi.org/10.1007/s10586-009-0099-6openalex-snapshot
Analysing scientific workflows with Computational Tree Logic
inferred← citeshttps://doi.org/10.1016/j.scico.2015.09.001openalex-snapshot
Global consensus through local synchronization: A formal basis for partially-distributed coordination
inferred← citeshttps://doi.org/10.1016/j.tcs.2011.07.021openalex-snapshot
A linear process-algebraic format with data for probabilistic automata
inferred← citeshttps://doi.org/10.1093/comjnl/bxq081openalex-snapshot
An Architectural Framework for the Design, Analysis and Implementation of Interactive Systems
inferred← citeshttps://doi.org/10.1109/access.2019.2891067openalex-snapshot
The Structure-Behavior Coalescence Approach for Systems Modeling
inferred← citeshttps://doi.org/10.1109/electronics.2017.7995232openalex-snapshot
Algebraic specification of ABP protocol using different time constraints
inferred← citeshttps://doi.org/10.1145/3539656openalex-snapshot
Nested Session Types
inferred← citeshttps://doi.org/10.26226/morressier.604907f41a80aac83ca25d10openalex-snapshot
Nested Session Types
inferred← citeshttps://doi.org/10.3990/1.9789036505925openalex-snapshot
Efficient modelling, generation and analysis of Markov Automata
inferred← citeshttps://doi.org/10.48550/arxiv.1602.07065openalex-snapshot
Composition, Cooperation, and Coordination of Computational Systems
inferred← citeshttps://doi.org/10.48550/arxiv.1604.05577openalex-snapshot
Contribution to the Formal Specification and Verification of a Multi-Agent Robotic System
inferred← citeshttps://doi.org/10.70675/b2732a24z3d75z47e5z883cz8c0a15bcad60openalex-snapshot
An integrated language for the specification, simulation, formal analysis and enactment of discrete event systems
inferred← citeshttps://doi.org/10.7561/sacs.2020.1.69openalex-snapshot
A Complete Axiomatisation for Probabilistic Trace Equivalence
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.