On the public citation graph

Process theory: Semantics, specification and verification

https://doi.org/10.1007/bfb0027046
0 signed · 60 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.1002/bimj.19670090121openalex-snapshot
Pearce, S. C.: Biological Statistics, an Introduction. Mc‐Graw Hill Book Company, New York, London 1965. XIII + 212 S., Preis $ 9,50
inferredcites →https://doi.org/10.1007/3-540-09526-8_8openalex-snapshot
Full abstraction for a simple parallel programming language
inferredcites →https://doi.org/10.1007/3-540-10001-6_21openalex-snapshot
Introduction to general net theory
inferredcites →https://doi.org/10.1007/3-540-10235-3openalex-snapshot
A Calculus of Communicating Systems
inferredcites →https://doi.org/10.1007/978-1-4612-6228-2openalex-snapshot
The Denotational Description of Programming Languages
inferredcites →https://doi.org/10.1007/978-3-642-82453-1openalex-snapshot
Logics and Models of Concurrent Systems
inferredcites →https://doi.org/10.1007/978-3-642-82453-1_14openalex-snapshot
Specification-Oriented Programming in TCSP
inferredcites →https://doi.org/10.1007/978-3-642-82921-5openalex-snapshot
Control Flow and Data Flow: Concepts of Distributed Programming
inferredcites →https://doi.org/10.1007/978-3-642-82921-5_9openalex-snapshot
Concurrent Computations and VLSI Circuits
inferredcites →https://doi.org/10.1007/bf00261258openalex-snapshot
Sound and complete Hoare-like calculi based on copy rules
inferredcites →https://doi.org/10.1007/bf00268134openalex-snapshot
An axiomatic proof technique for parallel programs I
inferredcites →https://doi.org/10.1007/bfb0015776openalex-snapshot
Compositionality and concurrent networks: Soundness and completeness of a proofsystem
inferredcites →https://doi.org/10.1007/bfb0017309openalex-snapshot
Concurrency and automata on infinite sequences
inferredcites →https://doi.org/10.1007/bfb0036937openalex-snapshot
Specification-oriented semantics for communicating processes
inferredcites →https://doi.org/10.1016/0096-0551(83)90036-xopenalex-snapshot
Denotational semantics: The scott-strachey approach to programming language theory
inferredcites →https://doi.org/10.1016/0141-9331(86)90196-1openalex-snapshot
Communicating sequential processes
inferredcites →https://doi.org/10.1016/0167-6423(83)90017-5openalex-snapshot
Using branching time temporal logic to synthesize synchronization skeletons
inferredcites →https://doi.org/10.1016/0304-3975(84)90022-7openalex-snapshot
A linear-history semantics for languages for distributed programming
inferredcites →https://doi.org/10.1016/0304-3975(84)90113-0openalex-snapshot
Testing equivalences for processes
inferredcites →https://doi.org/10.1016/s0019-9958(82)91250-5openalex-snapshot
Processes and the denotational semantics of concurrency
inferredcites →https://doi.org/10.1016/s0167-9260(83)80017-0openalex-snapshot
Circal: A calculus for circuit description
inferredcites →https://doi.org/10.1145/22145.22174openalex-snapshot
Transition systems, infinitary languages and the semantics of uniform concurrency
inferredcites →https://doi.org/10.1145/321992.321996openalex-snapshot
A Transformation System for Developing Recursive Programs
inferredcites →https://doi.org/10.1145/357103.357110openalex-snapshot
A Proof System for Communicating Sequential Processes
inferredcites →https://doi.org/10.1145/357172.357178openalex-snapshot
Proving Liveness Properties of Concurrent Programs
inferredcites →https://doi.org/10.1145/357233.357237openalex-snapshot
Synthesis of Communicating Processes from Temporal Logic Specifications
inferredcites →https://doi.org/10.1145/357980.358010openalex-snapshot
Program development by stepwise refinement
inferredcites →https://doi.org/10.1145/360248.360251openalex-snapshot
Formal verification of parallel programs
inferredcites →https://doi.org/10.1145/362575.362577openalex-snapshot
Program development by stepwise refinement
inferredcites →https://doi.org/10.1145/5956.5999openalex-snapshot
Proving systolic systems correct
inferredcites →https://doi.org/10.1145/69610.357988openalex-snapshot
Predicative programming Part I
inferredcites →https://doi.org/10.1145/828.833openalex-snapshot
A Theory of Communicating Sequential Processes
inferredcites →https://doi.org/10.1147/rd.32.0114openalex-snapshot
Finite Automata and Their Decision Problems

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-17906-2_34openalex-snapshot
TCSP: Theory of communicating sequential processes
inferred← citeshttps://doi.org/10.1007/3-540-18086-9_27openalex-snapshot
Operational Petri net semantics for CCSP
inferred← citeshttps://doi.org/10.1007/3-540-18088-5_9openalex-snapshot
A timed failures model for extended communicating processes
inferred← citeshttps://doi.org/10.1007/3-540-49213-5_10openalex-snapshot
Compositional Verification of Real-Time Applications
inferred← citeshttps://doi.org/10.1007/3-540-50940-2_33openalex-snapshot
Formulas, processes, and Petri-Nets applied to the specification and verification of a HDLC protocol
inferred← citeshttps://doi.org/10.1007/3-540-50940-2_45openalex-snapshot
Specification and verification of TCSP systems by means of partial abstract data types
inferred← citeshttps://doi.org/10.1007/3-540-52148-8_6openalex-snapshot
Verifying properties of large sets of processes with network invariants
inferred← citeshttps://doi.org/10.1007/3-540-52513-0_19openalex-snapshot
Refining data to processes
inferred← citeshttps://doi.org/10.1007/3-540-52559-9_86openalex-snapshot
Predicates, predicate transformers and refinement
inferred← citeshttps://doi.org/10.1007/3-540-53982-4_23openalex-snapshot
A complete proof system for timed observations
inferred← citeshttps://doi.org/10.1007/3-540-55719-9_113openalex-snapshot
Program composition via unification
inferred← citeshttps://doi.org/10.1007/3-540-55895-0_409openalex-snapshot
Invariance properties in distributed systems
inferred← citeshttps://doi.org/10.1007/3-540-58468-4_158openalex-snapshot
Correctness of real time systems by construction
inferred← citeshttps://doi.org/10.1007/3-540-60692-0_42openalex-snapshot
Synthesizing different development paradigms: Combining top-down with bottom-up reasoning about distributed systems
inferred← citeshttps://doi.org/10.1007/bf01212486openalex-snapshot
Communicating processes with value-passing and assignments
inferred← citeshttps://doi.org/10.1007/bfb0035748openalex-snapshot
Realizable and unrealizable specifications of reactive systems
inferred← citeshttps://doi.org/10.1007/s004460050061openalex-snapshot
The compositional approach to sequential consistency and lazy caching
inferred← citeshttps://doi.org/10.1016/0304-3975(92)90053-iopenalex-snapshot
A compositional axiomatization of Statecharts
inferred← citeshttps://doi.org/10.1016/0304-3975(94)90093-0openalex-snapshot
Program composition via unification
inferred← citeshttps://doi.org/10.1016/b978-0-7506-0813-8.50030-7openalex-snapshot
Formal treatment of concurrency and time
inferred← citeshttps://doi.org/10.1016/b978-044482830-9/50020-5openalex-snapshot
Trace-Oriented Models of Concurrency
inferred← citeshttps://doi.org/10.1109/37.56284openalex-snapshot
Concurrency and discrete event control
inferred← citeshttps://doi.org/10.1109/emwrts.1995.514317openalex-snapshot
An integrated technique for developing real-time systems
inferred← citeshttps://doi.org/10.1109/reldis.1995.518723openalex-snapshot
On the design of systems of cooperating functional processes
inferred← citeshttps://doi.org/10.1145/41625.41645openalex-snapshot
Full abstraction of a real-time denotational semantics for an OCCAM-like language
inferred← citeshttps://doi.org/10.1145/72981.73000openalex-snapshot
Predicates are predicate transformers: a unified compositional theory for concurrency
inferred← citeshttps://doi.org/10.3176/eng.1998.2.02openalex-snapshot
FORMAL VERIFICATION OF THE BINARY EXPONENTIAL BACKOFF PROTOCOL
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.