On the public citation graph

Action systems, unbounded nondeterminism, and infinite traces

https://doi.org/10.1007/bf01214622
0 signed · 35 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-51285-3_42openalex-snapshot
A method for refining atomicity in parallel algorithms
inferredcites →https://doi.org/10.1007/3-540-52513-0_18openalex-snapshot
Refinement of state-based concurrent systems
inferredcites →https://doi.org/10.1007/3-540-52559-9_61openalex-snapshot
Refinement calculus, part II: Parallel and reactive programs
inferredcites →https://doi.org/10.1007/978-1-4471-3273-8openalex-snapshot
On the Refinement Calculus
inferredcites →https://doi.org/10.1007/978-1-4612-4476-9_37openalex-snapshot
Of wp and CSP
inferredcites →https://doi.org/10.1007/978-3-642-82921-5_4openalex-snapshot
Notes on Communicating Sequential Systems
inferredcites →https://doi.org/10.1007/978-3-662-02880-3_2openalex-snapshot
Refinement Calculus, Lattices and Higher Order Logic
inferredcites →https://doi.org/10.1007/bf01788563openalex-snapshot
A state-based approach to communicating processes
inferredcites →https://doi.org/10.1007/bfb0040257openalex-snapshot
Unbounded nondeterminism in CSP
inferredcites →https://doi.org/10.1016/0167-6423(87)90011-6openalex-snapshot
A theoretical basis for stepwise refinement and the programming calculus
inferredcites →https://doi.org/10.1093/logcom/3.2.131openalex-snapshot
Unbounded Non-determinism in CSP
inferredcites →https://doi.org/10.1145/44501.44503openalex-snapshot
The specification statement
inferredcites →https://doi.org/10.1145/69558.69559openalex-snapshot
A generalization of Dijkstra's calculus
inferredcites →https://doi.org/10.1145/800221.806716openalex-snapshot
Decentralization of process nets with centralized control
inferredcites →https://doi.org/10.2140/pjm.1955.5.285openalex-snapshot
A lattice-theoretical fixpoint theorem and its applications

What points at this work

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

inferred← citeshttps://doi.org/10.1007/10722010_9openalex-snapshot
On Guarded Commands with Fair Choice
inferred← citeshttps://doi.org/10.1007/11415787_10openalex-snapshot
The Challenge of Probabilistic Event B—Extended Abstract—
inferred← citeshttps://doi.org/10.1007/11423348_12openalex-snapshot
Of Probabilistic wp and CSP—and Compositionality
inferred← citeshttps://doi.org/10.1007/11813040_10openalex-snapshot
Quantitative Refinement and Model Checking for the Analysis of Probabilistic Systems
inferred← citeshttps://doi.org/10.1007/11921240_4openalex-snapshot
Quantitative μ-Calculus Analysis of Power Management in Wireless Networks
inferred← citeshttps://doi.org/10.1007/3-540-36103-0_15openalex-snapshot
Mechanization of an Integrated Approach: Shallow Embedding into SAL/PVS
inferred← citeshttps://doi.org/10.1007/3-540-45251-6_6openalex-snapshot
How to Make FDR Spin LTL Model Checking of CSP by Refinement
inferred← citeshttps://doi.org/10.1007/3-540-61550-4_178openalex-snapshot
On fairness in terminating and reactive programs
inferred← citeshttps://doi.org/10.1007/3-540-63533-5_4openalex-snapshot
A semantic integration of object-Z and CSP for the specification of concurrent systems
inferred← citeshttps://doi.org/10.1007/978-0-387-35358-6_29openalex-snapshot
A model of real-time distributed systems
inferred← citeshttps://doi.org/10.1007/978-3-540-49676-2_2openalex-snapshot
How to Combine Z with a Process Algebra
inferred← citeshttps://doi.org/10.1007/978-3-642-17071-3_10openalex-snapshot
Mapping UML to Labeled Transition Systems for Test-Case Generation
inferred← citeshttps://doi.org/10.1007/bf01211074openalex-snapshot
Event refinement in state-based concurrent systems
inferred← citeshttps://doi.org/10.1007/s002360050163openalex-snapshot
Reasoning algebraically about loops
inferred← citeshttps://doi.org/10.1016/0167-6423(96)81173-7openalex-snapshot
Stepwise refinement of communicating systems
inferred← citeshttps://doi.org/10.1016/j.entcs.2008.06.004openalex-snapshot
An Algebraic Approach to Refinement with Fair Choice
inferred← citeshttps://doi.org/10.1023/a:1011269103179openalex-snapshot
Specification, Refinement and Verification of Concurrent Systems—An Integration of Object-Z and CSP
inferred← citeshttps://doi.org/10.1109/isola.2006.51openalex-snapshot
Formal Techniques for the Analysis of Wireless Networks
inferred← citeshttps://doi.org/10.1109/qsic.2004.1357943openalex-snapshot
A mechanically proved development combining B abstract systems and spin
inferred← citeshttps://doi.org/10.1145/1921532.1921559openalex-snapshot
UML in action
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.