On the public citation graph

Interface refinement in reactive systems

https://doi.org/10.1007/bfb0084784
0 signed · 29 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-51803-7_24openalex-snapshot
Specification and verification of concurrent programs by ∀-automata
inferredcites →https://doi.org/10.1007/3-540-52559-9_77openalex-snapshot
Multivalued possibilities mappings
inferredcites →https://doi.org/10.1007/3-540-52559-9_87openalex-snapshot
Foundations of compositional program refinement
inferredcites →https://doi.org/10.1007/3-540-54430-5_99openalex-snapshot
Simulations between specifications of distributed systems
inferredcites →https://doi.org/10.1007/3540539816_73openalex-snapshot
Refining interfaces of communicating systems
inferredcites →https://doi.org/10.1007/bf01786227openalex-snapshot
On interprocess communication
inferredcites →https://doi.org/10.1007/bfb0013024openalex-snapshot
The anchored version of the temporal framework
inferredcites →https://doi.org/10.1016/0169-7552(94)00016-mopenalex-snapshot
On communicating sequential processes
inferredcites →https://doi.org/10.1016/0304-3975(91)90224-popenalex-snapshot
The existence of refinement mappings
inferredcites →https://doi.org/10.1109/lics.1991.151648openalex-snapshot
Specifying and proving serializability in temporal logic
inferredcites →https://doi.org/10.1145/177492.177726openalex-snapshot
The temporal logic of actions
inferredcites →https://doi.org/10.1145/41625.41626openalex-snapshot
Specification and verification of concurrent programs by A ∀ automata
inferredcites →https://doi.org/10.1145/41840.41852openalex-snapshot
Hierarchical correctness proofs for distributed algorithms

What points at this work

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

inferred← citeshttps://doi.org/10.1007/10692867_6openalex-snapshot
Combining and Distributing Hierarchical Systems
inferred← citeshttps://doi.org/10.1007/3-540-44618-4_22openalex-snapshot
Action Contraction
inferred← citeshttps://doi.org/10.1007/3-540-45484-5_17openalex-snapshot
Refining Interactions in a Distributed System
inferred← citeshttps://doi.org/10.1007/3-540-58027-1_9openalex-snapshot
Timewise refinement for communicating processes
inferred← citeshttps://doi.org/10.1007/3-540-58715-2_141openalex-snapshot
Extending the limits of sequentially phased reasoning
inferred← citeshttps://doi.org/10.1007/3-540-60973-3_110openalex-snapshot
A strategic approach to transformational design
inferred← citeshttps://doi.org/10.1007/978-1-4757-3573-4_1openalex-snapshot
Compositional Development in the Event of Interface Difference
inferred← citeshttps://doi.org/10.1007/978-3-540-27813-9_1openalex-snapshot
Rob Tristan Gerth: 1956-2003
inferred← citeshttps://doi.org/10.1007/978-3-540-27813-9_10openalex-snapshot
Using Interface Refinement to Integrate Formal Verification into the Design Cycle
inferred← citeshttps://doi.org/10.1007/bfb0024426openalex-snapshot
A TLA solution to the RPC-memory specification problem
inferred← citeshttps://doi.org/10.1007/s004460050062openalex-snapshot
Proving refinement using transduction
inferred← citeshttps://doi.org/10.1016/b978-044482830-9/50034-5openalex-snapshot
Action Refinement
inferred← citeshttps://doi.org/10.1016/s0167-6423(96)00016-0openalex-snapshot
Timewise refinement for communicating processes
inferred← citeshttps://doi.org/10.1109/acsd.2006.34openalex-snapshot
Towards an Algebra of Abstractions for Communicating Processes
inferred← citeshttps://doi.org/10.1109/csd.2001.981767openalex-snapshot
Implementing communicating processes in the event of interface difference
inferred← citeshttps://doi.org/10.18452/14640openalex-snapshot
Halbordnungsbasierte Verfeinerung zur Verifikation verteilter Algorithmen
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.