On the public citation graph

A model and temporal proof system for networks of processes

https://doi.org/10.1007/bf01843567
0 signed · 72 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-10699-5_102openalex-snapshot
Scenarios: A model of non-determinate computation
inferredcites →https://doi.org/10.1007/3-540-12896-4_356openalex-snapshot
A semantics and proof system for communicating processes
inferredcites →https://doi.org/10.1007/3-540-15648-8_19openalex-snapshot
Behavior: a temporal appreach to process modeling
inferredcites →https://doi.org/10.1007/978-3-662-09507-2_19openalex-snapshot
Communicating Sequential Processes
inferredcites →https://doi.org/10.1007/bf00289266openalex-snapshot
A proof technique for communicating sequential processes
inferredcites →https://doi.org/10.1007/bf03037020openalex-snapshot
Object oriented programming in Concurrent Prolog
inferredcites →https://doi.org/10.1007/bfb0025785openalex-snapshot
Verification of concurrent programs: Temporal proof principles
inferredcites →https://doi.org/10.1016/0020-0190(85)90040-7openalex-snapshot
The incompleteness of Misra and Chandy's proof systems
inferredcites →https://doi.org/10.1109/tse.1981.230844openalex-snapshot
Proofs of Networks of Processes
inferredcites →https://doi.org/10.1145/318593.318624openalex-snapshot
A model and temporal proof system for networks of processes
inferredcites →https://doi.org/10.1145/357146.357150openalex-snapshot
Ten Years of Hoare's Logic: A Survey—Part I
inferredcites →https://doi.org/10.1145/567067.567082openalex-snapshot
How to cook a temporal proof system for your pet language
inferredcites →https://doi.org/10.1145/582153.582177openalex-snapshot
On the composition of processes
inferredcites →https://doi.org/10.1145/800057.808665openalex-snapshot
Now you may compose temporal logic specifications
inferredcites →https://doi.org/10.1145/800220.806698openalex-snapshot
Proving safety and liveness of communicating processes with examples
inferredcites →https://doi.org/10.21236/ada106750openalex-snapshot
Verification of Concurrent Programs. Part I. The Temporal Framework,
inferredcites →https://doi.org/10.21236/ada116035openalex-snapshot
Verification of Concurrent Programs. Part II. Temporal Proof Principles.

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-17945-3_11openalex-snapshot
Rigorous development of a distributed calendar system
inferred← citeshttps://doi.org/10.1007/3-540-17945-3_14openalex-snapshot
A computational model for distributed systems using operator nets
inferred← citeshttps://doi.org/10.1007/3-540-47891-4_22openalex-snapshot
Inheritance and Subtyping in a Parallel Object-Oriented Language
inferred← citeshttps://doi.org/10.1007/3-540-49213-5_1openalex-snapshot
The Need for Compositional Proof Systems: A Survey
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-54099-7_11openalex-snapshot
Stepwise development of a distributed load balancing algorithm
inferred← citeshttps://doi.org/10.1007/3-540-54415-1_47openalex-snapshot
Towards a complete hierarchy of compositional dataflow models
inferred← citeshttps://doi.org/10.1007/3-540-57887-0_123openalex-snapshot
Temporal verification diagrams
inferred← citeshttps://doi.org/10.1007/3-540-58152-9_12openalex-snapshot
New structural invariants for Petri nets analysis
inferred← citeshttps://doi.org/10.1007/3-540-60915-6_3openalex-snapshot
Automated temporal reasoning about reactive systems
inferred← citeshttps://doi.org/10.1007/978-1-4471-3534-0_20openalex-snapshot
Temporal Specifications Directed by Grammar and Design of Process Networks
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-4613-1033-4_32openalex-snapshot
Are There Non Real-Time Systems?
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/978-94-009-3461-0_2openalex-snapshot
Formal Support for Development of Safety Related Systems
inferred← citeshttps://doi.org/10.1007/bf01784888openalex-snapshot
An operator net model for distributed systems
inferred← citeshttps://doi.org/10.1007/bf02280834openalex-snapshot
A fully abstract trace model for dataflow and asynchronous networks
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/bfb0013024openalex-snapshot
The anchored version of the temporal framework
inferred← citeshttps://doi.org/10.1007/bfb0026105openalex-snapshot
Expressiveness bounds for completeness in trace-based network proof systems
inferred← citeshttps://doi.org/10.1007/bfb0027047openalex-snapshot
Applications of temporal logic to the specification and verification of reactive systems: A survey of current trends
inferred← citeshttps://doi.org/10.1007/bfb0029628openalex-snapshot
A hierarchy of compositional models of I/O-automata (Extended Abstract)
inferred← citeshttps://doi.org/10.1016/0010-4655(88)90117-8openalex-snapshot
Formal specification of real time systems
inferred← citeshttps://doi.org/10.1016/0164-1212(96)00049-0openalex-snapshot
Specification of communication protocols using temporal logic
inferred← citeshttps://doi.org/10.1016/0165-6074(92)90381-gopenalex-snapshot
Verifying networks of processes that communicate via shared variables
inferred← citeshttps://doi.org/10.1016/0169-023x(96)00004-3openalex-snapshot
A temporal logic approach to object certification
inferred← citeshttps://doi.org/10.1016/0169-7552(90)90133-dopenalex-snapshot
Protocol verification for OSI
inferred← citeshttps://doi.org/10.1016/0304-3975(92)90053-iopenalex-snapshot
A compositional axiomatization of Statecharts
inferred← citeshttps://doi.org/10.1016/b978-0-08-040953-5.50007-6openalex-snapshot
FORMAL APPROACH TO FAULTS IN SAFETY RELATED APPLICATIONS
inferred← citeshttps://doi.org/10.1016/b978-0-408-02938-4.50016-4openalex-snapshot
Key references in distributed computer systems 1959–1989
inferred← citeshttps://doi.org/10.1016/b978-0-444-88074-1.50021-4openalex-snapshot
Temporal and Modal Logic
inferred← citeshttps://doi.org/10.1016/s0167-6423(96)00028-7openalex-snapshot
Verification of XTP context management closing procedure in style of TLA
inferred← citeshttps://doi.org/10.1016/s1474-6670(17)52169-2openalex-snapshot
Formal Approach to Faults in Safety Related Applications
inferred← citeshttps://doi.org/10.1051/ita/1992260201151openalex-snapshot
TTL : a formalism to describe local and global properties of distributed systems
inferred← citeshttps://doi.org/10.1109/32.44363openalex-snapshot
Verifying general safety properties of Ada tasking programs
inferred← citeshttps://doi.org/10.1109/5.48825openalex-snapshot
A review of specification and verification methods for parallel programs including the dataflow approach
inferred← citeshttps://doi.org/10.1109/cmpeur.1991.257366openalex-snapshot
Verifying networks of processes that synchronize via shared variables
inferred← citeshttps://doi.org/10.1109/eurmic.1997.617347openalex-snapshot
TLA-style specification of a mobile network
inferred← citeshttps://doi.org/10.1109/hicss.1989.47998openalex-snapshot
Formal approach to development of critical computer applications
inferred← citeshttps://doi.org/10.1109/hicss.1990.205209openalex-snapshot
A model and a proof system for parallel and distributed processes
inferred← citeshttps://doi.org/10.1145/128861.128866openalex-snapshot
An object-based programming model for shared data
inferred← citeshttps://doi.org/10.1145/129393.129396openalex-snapshot
Trace-based network proof systems
inferred← citeshttps://doi.org/10.1145/174662.174665openalex-snapshot
Compositional specification and verification of distributed systems
inferred← citeshttps://doi.org/10.1145/224964.224981openalex-snapshot
Reasoning about meta level activities in open distributed systems
inferred← citeshttps://doi.org/10.1145/323648.323745openalex-snapshot
A generalized object model
inferred← citeshttps://doi.org/10.1145/41625.41628openalex-snapshot
Completeness and incompleteness of trace-based network proof systems
inferred← citeshttps://doi.org/10.1145/41840.41853openalex-snapshot
Modular verification of asynchronous networks
inferred← citeshttps://doi.org/10.1145/44501.44502openalex-snapshot
Constrained expressions: toward broad applicability of analysis methods for distributed software systems
inferred← citeshttps://doi.org/10.1145/62546.62585openalex-snapshot
Process semantics: universal axioms compositional rules, and applications
inferred← citeshttps://doi.org/10.1145/72981.73000openalex-snapshot
Predicates are predicate transformers: a unified compositional theory for concurrency
inferred← citeshttps://doi.org/10.1145/75277.75291openalex-snapshot
A fully abstract trace model for dataflow networks
inferred← citeshttps://doi.org/10.1145/88616.96551openalex-snapshot
Using symbolic execution for verification of Ada tasking programs
inferred← citeshttps://doi.org/10.14236/ewic/fa1997.17openalex-snapshot
Communication Traces in the Verification of Distributed Programs
inferred← citeshttps://doi.org/10.3233/fi-1994-201238openalex-snapshot
COMPOSITIONAL PROOFS FOR NETWORKS OF 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.