On the public citation graph

Time-dependent distributed systems: proving safety, liveness and real-time properties

https://doi.org/10.1007/bf01667079
0 signed · 78 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/bf00289074openalex-snapshot
A proof method for cyclic programs
inferredcites →https://doi.org/10.1007/bf01934068openalex-snapshot
Verification of link-level protocols
inferredcites →https://doi.org/10.1016/0167-6423(83)90014-xopenalex-snapshot
An assertional correctness proof of a distributed algorithm
inferredcites →https://doi.org/10.1016/0376-5075(76)90015-5openalex-snapshot
A data transfer protocol
inferredcites →https://doi.org/10.1109/tcom.1983.1095720openalex-snapshot
Modular Verification of Computer Communication Protocols
inferredcites →https://doi.org/10.1109/tcom.1983.1095741openalex-snapshot
Editorial Notes
inferredcites →https://doi.org/10.1109/tse.1981.230844openalex-snapshot
Proofs of Networks of Processes
inferredcites →https://doi.org/10.1145/1013812.18183openalex-snapshot
A verified sliding window protocol with variable flow control
inferredcites →https://doi.org/10.1145/1040132.1040134openalex-snapshot
DOD standard transmission control protocol
inferredcites →https://doi.org/10.1145/18172.18183openalex-snapshot
A verified sliding window protocol with variable flow control
inferredcites →https://doi.org/10.1145/357172.357178openalex-snapshot
Proving Liveness Properties of Concurrent Programs
inferredcites →https://doi.org/10.1145/357377.357382openalex-snapshot
Mechanisms that enforce bounds on packet lifetimes
inferredcites →https://doi.org/10.1145/357377.357384openalex-snapshot
An HDLC protocol specification and its verification using image protocols
inferredcites →https://doi.org/10.1145/359545.359563openalex-snapshot
Time, clocks, and the ordering of events in a distributed system
inferredcites →https://doi.org/10.1145/360051.360224openalex-snapshot
Verifying properties of parallel programs
inferredcites →https://doi.org/10.1145/362946.362970openalex-snapshot
A note on reliable full-duplex transmission over half-duplex links
inferredcites →https://doi.org/10.1145/5956.5958openalex-snapshot
An example of stepwise refinement of distributed programs: quiescence detection
inferredcites →https://doi.org/10.1145/69624.357207openalex-snapshot
Specifying Concurrent Program Modules
inferredcites →https://doi.org/10.17487/rfc0761openalex-snapshot
DoD standard Transmission Control Protocol
inferredcites →https://doi.org/10.2307/2283757openalex-snapshot
The Art of Computer Programming. Volume 1: Fundamental 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/3-540-19488-6_145openalex-snapshot
Assertional verification of a timer based protocol
inferred← citeshttps://doi.org/10.1007/3-540-51285-3_56openalex-snapshot
A temporal-logic based compositional proof system for real-time message passing
inferred← citeshttps://doi.org/10.1007/3-540-51687-5_34openalex-snapshot
An efficient solution to the drinking philosophers problem and its extensions
inferred← citeshttps://doi.org/10.1007/3-540-52559-9_64openalex-snapshot
Functional specification of time sensitive communicating systems
inferred← citeshttps://doi.org/10.1007/3-540-52559-9_75openalex-snapshot
Refinement and projection of relational specifications
inferred← citeshttps://doi.org/10.1007/3-540-52559-9_83openalex-snapshot
Construction of network protocols by stepwise refinement
inferred← citeshttps://doi.org/10.1007/3-540-54029-6_201openalex-snapshot
A formal description of the IC* model of parallel computation
inferred← citeshttps://doi.org/10.1007/3-540-54430-5_103openalex-snapshot
Time-constrained automata
inferred← citeshttps://doi.org/10.1007/3-540-55092-5_3openalex-snapshot
A compositional semantics for fault-tolerant real-time systems
inferred← citeshttps://doi.org/10.1007/3-540-56496-9_2openalex-snapshot
Modular abstractions for verifying real-time distributed systems
inferred← citeshttps://doi.org/10.1007/3-540-58555-9_105openalex-snapshot
Specifying & verifying concurrent systems using Z
inferred← citeshttps://doi.org/10.1007/3540539816_71openalex-snapshot
Using higher order logic for modelling real-time protocols
inferred← citeshttps://doi.org/10.1007/978-0-387-34867-4_20openalex-snapshot
Specifying and Verifying Conditional Progress
inferred← citeshttps://doi.org/10.1007/978-1-4471-3452-7_16openalex-snapshot
Visualising Concurrent Z Specifications
inferred← citeshttps://doi.org/10.1007/978-1-4471-3860-0_15openalex-snapshot
A Compositional Axiomatisation of Safety and Liveness Properties for Statecharts
inferred← citeshttps://doi.org/10.1007/978-1-4614-4881-5_1openalex-snapshot
Introduction
inferred← citeshttps://doi.org/10.1007/978-1-4614-4881-5_6openalex-snapshot
Programs, Semantics and Effective Atomicity
inferred← citeshttps://doi.org/10.1007/978-1-4614-4881-5_8openalex-snapshot
SESF for Time-Constrained Programs
inferred← citeshttps://doi.org/10.1007/978-1-4615-3220-0_3openalex-snapshot
Parameterized Semantics for Fault Tolerant Real-Time Systems
inferred← citeshttps://doi.org/10.1007/978-1-4615-4016-8_5openalex-snapshot
Theory of Real-Time Systems — Project Survey
inferred← citeshttps://doi.org/10.1007/978-3-642-77580-2_5openalex-snapshot
An introduction to compositional methods for concurrency and their application to real-time
inferred← citeshttps://doi.org/10.1007/bf01211866openalex-snapshot
A logic for reasoning about time and reliability
inferred← citeshttps://doi.org/10.1007/bf01383942openalex-snapshot
Modular abstractions for verifying real-time distributed systems
inferred← citeshttps://doi.org/10.1007/bf01558665openalex-snapshot
Decentralization of process nets with centralized control
inferred← citeshttps://doi.org/10.1007/bf01898402openalex-snapshot
Eliminating the substitution axiom from UNITY logic
inferred← citeshttps://doi.org/10.1007/bf02252683openalex-snapshot
Using mappings to prove timing properties
inferred← citeshttps://doi.org/10.1007/bf02811338openalex-snapshot
An introduction to compositional methods for concurrency and their application to real-time
inferred← citeshttps://doi.org/10.1007/bfb0031988openalex-snapshot
Logics and models of real time: A survey
inferred← citeshttps://doi.org/10.1016/0167-6423(90)90069-popenalex-snapshot
Stepwise refinement of parallel algorithms
inferred← citeshttps://doi.org/10.1016/0304-3975(92)90053-iopenalex-snapshot
A compositional axiomatization of Statecharts
inferred← citeshttps://doi.org/10.1016/0950-5849(89)90085-2openalex-snapshot
Formal description of realtime systems: a review
inferred← citeshttps://doi.org/10.1016/b978-0-408-03741-9.50021-0openalex-snapshot
Formal description of realtime systems
inferred← citeshttps://doi.org/10.1109/12.88460openalex-snapshot
Formalization of protocol engineering concepts
inferred← citeshttps://doi.org/10.1109/12.88461openalex-snapshot
Specification of real-time broadcast networks
inferred← citeshttps://doi.org/10.1109/32.4655openalex-snapshot
Protocol conversion
inferred← citeshttps://doi.org/10.1109/32.491647openalex-snapshot
Reasoning about places, times, and actions in the presence of mobility
inferred← citeshttps://doi.org/10.1109/32.56101openalex-snapshot
A relational notation for state transition systems
inferred← citeshttps://doi.org/10.1109/5.119547openalex-snapshot
Modular design principles for protocols with an application to the transport layer
inferred← citeshttps://doi.org/10.1109/5.259434openalex-snapshot
Reasoning assertionally about real-time systems
inferred← citeshttps://doi.org/10.1109/aswec.2004.1290477openalex-snapshot
ASPIRE: automated systematic protocol implementation robustness evaluation
inferred← citeshttps://doi.org/10.1109/real.1989.63561openalex-snapshot
A framework for reasoning about time and reliability
inferred← citeshttps://doi.org/10.1109/real.1989.63584openalex-snapshot
Verifying properties of systems with variable timing constraints
inferred← citeshttps://doi.org/10.1109/real.1992.242666openalex-snapshot
A simple assertional proof system for real-time systems
inferred← citeshttps://doi.org/10.1142/s0218127410027519openalex-snapshot
MULTICAST CONGESTION CONTROL SRMSH APPROACH USING COMMUNICATING REAL-TIME STATE MACHINES
inferred← citeshttps://doi.org/10.1145/1013812.18183openalex-snapshot
A verified sliding window protocol with variable flow control
inferred← citeshttps://doi.org/10.1145/128733.128735openalex-snapshot
Tolerating failures of continuous-valued sensors
inferred← citeshttps://doi.org/10.1145/129393.129394openalex-snapshot
A stepwise refinement heuristic for protocol construction
inferred← citeshttps://doi.org/10.1145/151299.151302openalex-snapshot
Functional specification of time-sensitive communicating systems
inferred← citeshttps://doi.org/10.1145/18172.18183openalex-snapshot
A verified sliding window protocol with variable flow control
inferred← citeshttps://doi.org/10.1145/3453417.3453431openalex-snapshot
Formal Verification of a Mixed-Trust Synchronization Protocol
inferred← citeshttps://doi.org/10.1145/504136.504176openalex-snapshot
A formal approach to fault-tolerance in distributed real-time systems
inferred← citeshttps://doi.org/10.1145/52324.52353openalex-snapshot
Specification and verification of collusion-free broadcast networks
inferred← citeshttps://doi.org/10.1145/52325.52353openalex-snapshot
Specification and verification of collusion-free broadcast networks
inferred← citeshttps://doi.org/10.1145/55482.55495openalex-snapshot
A verified connection management protocol for the transport layer
inferred← citeshttps://doi.org/10.1145/65000.65003openalex-snapshot
Verified data transfer protocols with variable flow control
inferred← citeshttps://doi.org/10.1145/75246.75260openalex-snapshot
Block acknowledgement: redesigning the window protocol
inferred← citeshttps://doi.org/10.1145/75247.75260openalex-snapshot
Block acknowledgement: redesigning the window protocol
inferred← citeshttps://doi.org/10.1145/93385.93428openalex-snapshot
Using mappings to prove timing properties
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.