On the public citation graph

Contrasting themes in the semantics of imperative concurrency

https://doi.org/10.1007/bfb0027040
0 signed · 91 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-09526-8_8openalex-snapshot
Full abstraction for a simple parallel programming language
inferredcites →https://doi.org/10.1007/3-540-10007-5_48openalex-snapshot
Dijkstra's predicate transformers and smyth's powerdomains
inferredcites →https://doi.org/10.1007/3-540-10235-3openalex-snapshot
A Calculus of Communicating Systems
inferredcites →https://doi.org/10.1007/3-540-12896-4_352openalex-snapshot
Compactness in semantics for merge and fair merge
inferredcites →https://doi.org/10.1007/3-540-15670-4openalex-snapshot
Seminar on Concurrency
inferredcites →https://doi.org/10.1007/978-1-4757-3472-0_2openalex-snapshot
Cooperating Sequential Processes
inferredcites →https://doi.org/10.1007/978-3-642-82453-1openalex-snapshot
Logics and Models of Concurrent Systems
inferredcites →https://doi.org/10.1007/bf00289262openalex-snapshot
Recursive assertions and parallel programs
inferredcites →https://doi.org/10.1007/bfb0012801openalex-snapshot
Domains for denotational semantics
inferredcites →https://doi.org/10.1007/bfb0015727openalex-snapshot
Linear and branching structures in the semantics and logics of reactive systems
inferredcites →https://doi.org/10.1007/bfb0015739openalex-snapshot
Towards a uniform topological treatment of streams and functions on streams
inferredcites →https://doi.org/10.1007/bfb0015740openalex-snapshot
Infinite streams and finite observations in the semantics of uniform concurrency
inferredcites →https://doi.org/10.1007/bfb0015751openalex-snapshot
An algebraic theory of fair asynchronous communicating processes
inferredcites →https://doi.org/10.1007/bfb0017309openalex-snapshot
Concurrency and automata on infinite sequences
inferredcites →https://doi.org/10.1007/bfb0036897openalex-snapshot
Processes and a fair semantics for the ADA rendez-vous
inferredcites →https://doi.org/10.1007/bfb0036899openalex-snapshot
On the relationship of CCS and CSP
inferredcites →https://doi.org/10.1007/bfb0036937openalex-snapshot
Specification-oriented semantics for communicating processes
inferredcites →https://doi.org/10.1016/0022-0000(79)90006-0openalex-snapshot
Semantics of nondeterminism, concurrency, and communication
inferredcites →https://doi.org/10.1016/0096-0551(80)90011-9openalex-snapshot
Introduction to automata theory, languages, and computation
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/0304-3975(80)90045-6openalex-snapshot
Metric interpretations of infinite trees and semantics of non deterministic recursive programs
inferredcites →https://doi.org/10.1016/0304-3975(83)90055-5openalex-snapshot
A continuous semantics for unbounded nondeterminism
inferredcites →https://doi.org/10.1016/0304-3975(83)90114-7openalex-snapshot
Calculi for synchrony and asynchrony
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)90112-9openalex-snapshot
Synchronization trees
inferredcites →https://doi.org/10.1016/0304-3975(84)90113-0openalex-snapshot
Testing equivalences for processes
inferredcites →https://doi.org/10.1016/0304-3975(84)90114-2openalex-snapshot
Linear time and branching time semantics for recursion with merge
inferredcites →https://doi.org/10.1016/0304-3975(85)90088-xopenalex-snapshot
Algebra of communicating processes with abstraction
inferredcites →https://doi.org/10.1016/0304-3975(87)90002-8openalex-snapshot
Infinite streams and finite observations in the semantics of uniform concurrency
inferredcites →https://doi.org/10.1016/0378-4754(81)90068-9openalex-snapshot
Introduction to automata theory, languages and computation
inferredcites →https://doi.org/10.1016/c2013-0-10398-4openalex-snapshot
Formal Language Theory
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/s0019-9958(83)80029-1openalex-snapshot
Synchronous and asynchronous experiments on processes
inferredcites →https://doi.org/10.1016/s0019-9958(83)80039-4openalex-snapshot
Connections between two theories of concurrency: Metric spaces and synchronization trees
inferredcites →https://doi.org/10.1016/s0019-9958(84)80025-xopenalex-snapshot
Process algebra for synchronous communication
inferredcites →https://doi.org/10.1016/s0049-237x(08)71948-7openalex-snapshot
Processes: A Mathematical Model of Computing Agents
inferredcites →https://doi.org/10.1090/s0002-9947-1951-0042109-4openalex-snapshot
Topologies on spaces of subsets
inferredcites →https://doi.org/10.1109/sfcs.1981.36openalex-snapshot
Possible futures, acceptances, refusals, and communicating processes
inferredcites →https://doi.org/10.1137/0205035openalex-snapshot
A Powerdomain Construction
inferredcites →https://doi.org/10.1137/0217073openalex-snapshot
Readies and Failures in the Algebra of Communicating Processes
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/322123.322134openalex-snapshot
Concurrent Processes and Their Syntax
inferredcites →https://doi.org/10.1145/322358.322372openalex-snapshot
Formal Justification of a Proof System for Communicating Sequential Processes
inferredcites →https://doi.org/10.1145/357980.358021openalex-snapshot
Communicating sequential processes
inferredcites →https://doi.org/10.1145/359576.359585openalex-snapshot
Communicating sequential processes
inferredcites →https://doi.org/10.1145/360248.360251openalex-snapshot
Formal verification of parallel programs
inferredcites →https://doi.org/10.1145/512644.512662openalex-snapshot
Operational semantics of a parallel object-oriented language
inferredcites →https://doi.org/10.1145/800057.808663openalex-snapshot
Liveness properties as convergence in metric spaces
inferredcites →https://doi.org/10.1145/800070.802188openalex-snapshot
Denotational semantics of concurrency
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
inferredcites →https://doi.org/10.21236/ada016808openalex-snapshot
Synchronization of Concurrent Processes
inferredcites →https://doi.org/10.25405/ncl.34127751openalex-snapshot
Relational Semantics of Concurrent Programs (with some Applications)
inferredcites →https://doi.org/10.7146/dpb.v6i78.7691openalex-snapshot
Concurrent Program Schemes and their Interpretations

What points at this work

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

inferred← citeshttps://doi.org/10.1006/inco.1993.1001openalex-snapshot
Iteration Theories of Synchronization Trees
inferred← citeshttps://doi.org/10.1007/3-540-17660-8_59openalex-snapshot
Applications of compactness in the Smyth powerdomain of streams
inferred← citeshttps://doi.org/10.1007/3-540-18419-8_10openalex-snapshot
Designing equivalent semantic models for process creation
inferred← citeshttps://doi.org/10.1007/3-540-19488-6_125openalex-snapshot
Contractions in comparing concurrency semantics
inferred← citeshttps://doi.org/10.1007/3-540-50939-9_132openalex-snapshot
Continuation semantics for PROLOG with cut
inferred← citeshttps://doi.org/10.1007/3-540-53479-2_2openalex-snapshot
Metric pomset semantics for a concurrent language with recursion
inferred← citeshttps://doi.org/10.1007/3-540-53982-4_22openalex-snapshot
Comparative semantics for a real-time programming language with integration
inferred← citeshttps://doi.org/10.1007/3-540-56596-5_34openalex-snapshot
Asynchronous rendez-vous in distributed logic programming
inferred← citeshttps://doi.org/10.1007/3-540-57182-5_40openalex-snapshot
Object Oriented application flow graphs and their semantics
inferred← citeshttps://doi.org/10.1007/3-540-57208-2_6openalex-snapshot
The linear time — Branching time spectrum II
inferred← citeshttps://doi.org/10.1007/3-540-61286-6_149openalex-snapshot
Meeting the deadline: On the formal specification of temporal deontic constraints
inferred← citeshttps://doi.org/10.1007/3540539816_55openalex-snapshot
CCS for OO and LP
inferred← citeshttps://doi.org/10.1007/978-1-4471-1488-8_5openalex-snapshot
A Modal Approach to Intentions, Commitments and Obligations: Intention plus Commitment yields Obligation
inferred← citeshttps://doi.org/10.1007/978-1-4471-3860-0_5openalex-snapshot
Negations of Transactions and Their Use in the Specification of Dynamic and Deontic Integrity Constraints
inferred← citeshttps://doi.org/10.1007/978-1-4471-3860-0_7openalex-snapshot
Iteration Theories of Synchronization Trees
inferred← citeshttps://doi.org/10.1007/978-3-642-84524-6_21openalex-snapshot
PROTEAN: A High-level Petri Net Tool for the Specification and Verification of Communication Protocols
inferred← citeshttps://doi.org/10.1007/bf00263291openalex-snapshot
Order and metric in the stream semantics of elemental concurrency
inferred← citeshttps://doi.org/10.1007/bf00370675openalex-snapshot
Free choice and contextually permitted actions
inferred← citeshttps://doi.org/10.1007/bf01068646openalex-snapshot
Algorithm to construct the behavior of concurrent systems represented by modified path expressions
inferred← citeshttps://doi.org/10.1007/bf01784023openalex-snapshot
Step semantics for “true” concurrency with recursion
inferred← citeshttps://doi.org/10.1007/bf01941131openalex-snapshot
Metric semantics for concurrency
inferred← citeshttps://doi.org/10.1007/bfb0013038openalex-snapshot
Correctness and full abstraction of metric semantics for concurrency
inferred← citeshttps://doi.org/10.1007/bfb0029606openalex-snapshot
Retractions in comparing prolog semantics (extended abstract)
inferred← citeshttps://doi.org/10.1016/0022-0000(88)90026-8openalex-snapshot
Transition systems, metric spaces and ready sets in the semantics of uniform concurrency
inferred← citeshttps://doi.org/10.1016/0167-6423(90)90072-lopenalex-snapshot
Comparative semantics for prolog with cut
inferred← citeshttps://doi.org/10.1016/0304-3975(88)90042-4openalex-snapshot
Applications of compactness in the Smyth powerdomain of streams
inferred← citeshttps://doi.org/10.1016/0304-3975(88)90048-5openalex-snapshot
Designing equivalent semantic models for process creation
inferred← citeshttps://doi.org/10.1016/0304-3975(90)90016-bopenalex-snapshot
Fundamental study
inferred← citeshttps://doi.org/10.1016/0304-3975(91)90303-jopenalex-snapshot
Four domains for concurrency
inferred← citeshttps://doi.org/10.1016/0890-5401(89)90057-6openalex-snapshot
Denotational semantics of a parallel object-oriented language
inferred← citeshttps://doi.org/10.1016/0890-5401(91)90036-2openalex-snapshot
Comparative semantics for flow of control in logic programming without logic
inferred← citeshttps://doi.org/10.1016/0890-5401(91)90044-3openalex-snapshot
Process expressions and Hoare's logic: Showing an irreconcilability of context-free recursion with Scott's induction rule
inferred← citeshttps://doi.org/10.1016/b978-044482830-9/50019-9openalex-snapshot
The Linear Time - Branching Time Spectrum I.**This is an extension of [20]. The research reported in this paper has been initiated at CWI in Amsterdam, continued at the Technical University of Munich, and finalized at Stanford University. It has been supported by Sonderforschungsbereich 342 of the…
inferred← citeshttps://doi.org/10.1109/32.4651openalex-snapshot
PROTEAN: a high-level Petri net tool for the specification and verification of communication protocols
inferred← citeshttps://doi.org/10.1109/hicss.1997.663191openalex-snapshot
Combining dynamic deontic logic and temporal logic for the specification of deadlines
inferred← citeshttps://doi.org/10.1137/0219023openalex-snapshot
Semantic Correctness for a Parallel Object-Oriented Language
inferred← citeshttps://doi.org/10.1145/512644.512662openalex-snapshot
Operational semantics of a parallel object-oriented language
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.