On the public citation graph
Specification-oriented semantics for Communicating Processes
0 signed · 288 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.
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.
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-10828-9_52openalex-snapshot
A modal characterisation of observable machine-behaviour
inferredcites →https://doi.org/10.1007/3-540-11494-7_17openalex-snapshot
Specification of communicating processes and process implementation correctness
inferredcites →https://doi.org/10.1007/3-540-12689-9_98openalex-snapshot
A complete set of axioms for a theory of communicating sequential processes
inferredcites →https://doi.org/10.1007/3-540-15670-4_14openalex-snapshot
An improved failures model for communicating processes
inferredcites →https://doi.org/10.1007/978-3-642-82453-1_14openalex-snapshot
Specification-Oriented Programming in TCSP
inferredcites →https://doi.org/10.1007/bf00289266openalex-snapshot
A proof technique for communicating sequential processes
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/bfb0015776openalex-snapshot
Compositionality and concurrent networks: Soundness and completeness of a proofsystem
inferredcites →https://doi.org/10.1007/bfb0036899openalex-snapshot
On the relationship of CCS and CSP
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(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(81)90005-8openalex-snapshot
A calculus of total correctness for communicating processes
inferredcites →https://doi.org/10.1016/0304-3975(83)90081-6openalex-snapshot
A more complete model of communicating processes
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)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/s0019-9958(82)91250-5openalex-snapshot
Processes and the denotational semantics of concurrency
inferredcites →https://doi.org/10.1109/sfcs.1981.36openalex-snapshot
Possible futures, acceptances, refusals, and communicating processes
inferredcites →https://doi.org/10.1109/tse.1981.230844openalex-snapshot
Proofs of Networks of Processes
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/2455.2460openalex-snapshot
Algebraic laws for nondeterminism and concurrency
inferredcites →https://doi.org/10.1145/321992.321997openalex-snapshot
Initial Algebra Semantics and Continuous Algebras
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/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/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/800220.806698openalex-snapshot
Proving safety and liveness of communicating processes with examples
inferredcites →https://doi.org/10.1145/828.833openalex-snapshot
A Theory of Communicating Sequential Processes
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1002/9780470611647.ch12openalex-snapshot
Verification of Specific Properties
inferred← citeshttps://doi.org/10.1002/spe.4380160106openalex-snapshot
Communicating parallel processes
inferred← citeshttps://doi.org/10.1006/inco.1995.1039openalex-snapshot
On Deciding Readiness and Failure Equivalences for Processes
inferred← citeshttps://doi.org/10.1006/inco.1998.2755openalex-snapshot
Basic Observables for Processes
inferred← citeshttps://doi.org/10.1007/11423348_6openalex-snapshot
Models for Data-Flow Sequential Processes
inferred← citeshttps://doi.org/10.1007/11768869_17openalex-snapshot
Abstract Interface Behavior of Object-Oriented Languages with Monitors
inferred← citeshttps://doi.org/10.1007/11780342_1openalex-snapshot
Heap-Abstraction for an Object-Oriented Calculus with Thread Classes
inferred← citeshttps://doi.org/10.1007/3-540-17660-8_54openalex-snapshot
A fully observational model for infinite behaviours of communicating systems
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-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_10openalex-snapshot
Readiness semantics for regular processes with silent actions
inferred← citeshttps://doi.org/10.1007/3-540-18419-8_12openalex-snapshot
Views of distributed systems
inferred← citeshttps://doi.org/10.1007/3-540-36135-9_3openalex-snapshot
Congruent Weak Conformance, a Partial Order among Processes
inferred← citeshttps://doi.org/10.1007/3-540-44612-5_17openalex-snapshot
A Compositional Model for Confluent Dynamic Data-Flow Networks
inferred← citeshttps://doi.org/10.1007/3-540-44667-2_5openalex-snapshot
Process Algebra and Markov Chains
inferred← citeshttps://doi.org/10.1007/3-540-45263-x_16openalex-snapshot
A Logical Interface Description Language for Components
inferred← citeshttps://doi.org/10.1007/3-540-50403-6_30openalex-snapshot
Requirement and design specification for distributed systems
inferred← citeshttps://doi.org/10.1007/3-540-50403-6_51openalex-snapshot
Adequacy-preserving transformations of COSY path programs
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-51305-1_10openalex-snapshot
Networks of communicating processes and their (De-)composition
inferred← citeshttps://doi.org/10.1007/3-540-51486-4_59openalex-snapshot
Correctness of concurrent processes
inferred← citeshttps://doi.org/10.1007/3-540-51803-7_21openalex-snapshot
An expressive logic for a process algebra with silent actions
inferred← citeshttps://doi.org/10.1007/3-540-52148-8_8openalex-snapshot
Projections of the reachability graph and environment models
inferred← citeshttps://doi.org/10.1007/3-540-52559-9_80openalex-snapshot
From trace specifications to process terms
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-54152-7_59openalex-snapshot
Acceptance Automata: A framework for specifying and verifying TCSP parallel systems
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-54430-5_111openalex-snapshot
Reduced labelled transition systems save verification effort
inferred← citeshttps://doi.org/10.1007/3-540-54430-5_81openalex-snapshot
Towards a design calculus for communicating programs
inferred← citeshttps://doi.org/10.1007/3-540-54430-5_87openalex-snapshot
Algebraic formulations of trace theory
inferred← citeshttps://doi.org/10.1007/3-540-54834-3_11openalex-snapshot
Specification and stepwise development of communicating systems
inferred← citeshttps://doi.org/10.1007/3-540-55092-5_28openalex-snapshot
Operational semantics for timed observations
inferred← citeshttps://doi.org/10.1007/3-540-55610-9_180openalex-snapshot
A survey of equivalence notions for net based systems
inferred← citeshttps://doi.org/10.1007/3-540-55719-9_108openalex-snapshot
Asynchronous communication of Petri Nets and the refinement of transitions
inferred← citeshttps://doi.org/10.1007/3-540-56689-9_54openalex-snapshot
Compositional state space generation
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-57887-0_110openalex-snapshot
Undecidable equivalences for basic parallel processes
inferred← citeshttps://doi.org/10.1007/3-540-58027-1_13openalex-snapshot
On the specification of elementary reactive behaviour
inferred← citeshttps://doi.org/10.1007/3-540-59293-8_198openalex-snapshot
An algebraic approach to temporal logic
inferred← citeshttps://doi.org/10.1007/3-540-60117-1_10openalex-snapshot
Formal derivation of CSP programs from temporal specifications
inferred← citeshttps://doi.org/10.1007/3-540-60630-0_11openalex-snapshot
On automatic and interactive design of communicating systems
inferred← citeshttps://doi.org/10.1007/3-540-61363-3_25openalex-snapshot
Behavioural equivalence for infinite systems — Partially decidable!
inferred← citeshttps://doi.org/10.1007/3-540-61440-0_117openalex-snapshot
Algebraic characterizations of decorated trace equivalences over tree-like structures
inferred← citeshttps://doi.org/10.1007/3-540-61604-7_87openalex-snapshot
Synchronous development of asynchronous systems
inferred← citeshttps://doi.org/10.1007/3-540-63139-9_40openalex-snapshot
Covering step graph preserving failure semantics
inferred← citeshttps://doi.org/10.1007/3-540-63165-8_204openalex-snapshot
Basic observables for processes
inferred← citeshttps://doi.org/10.1007/3-540-63172-0_42openalex-snapshot
Weak semantics based on lighted button pressing experiments
inferred← citeshttps://doi.org/10.1007/3540539816_73openalex-snapshot
Refining interfaces of communicating systems
inferred← citeshttps://doi.org/10.1007/978-0-387-34867-4_17openalex-snapshot
Failure-based Congruences, Unfair Divergences and New Testing Theory
inferred← citeshttps://doi.org/10.1007/978-0-387-34988-6_28openalex-snapshot
Towards a “Practical Formal Method” for Test Derivation
inferred← citeshttps://doi.org/10.1007/978-0-387-35562-7_18openalex-snapshot
A Junction Between State Based and Behavioural Specification
inferred← citeshttps://doi.org/10.1007/978-1-4471-0851-1_7openalex-snapshot
Modular Formal Specification of Data and Behaviour
inferred← citeshttps://doi.org/10.1007/978-1-4471-3229-5_9openalex-snapshot
A Timed Specification Language for Concurrent Reactive Systems
inferred← citeshttps://doi.org/10.1007/978-1-4471-3431-2_6openalex-snapshot
Real-Time and Safety-Critical 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-3756-6_15openalex-snapshot
A Theory of State-based Parallel Programming: Part 1
inferred← citeshttps://doi.org/10.1007/978-1-4471-5355-9_19openalex-snapshot
Refining CSP and Object-Z Specifications
inferred← citeshttps://doi.org/10.1007/978-1-4757-6463-5_3openalex-snapshot
The ProCoS Approach to Correct Systems
inferred← citeshttps://doi.org/10.1007/978-1-84800-223-4openalex-snapshot
A Process Algebraic Approach to Software Architecture Design
inferred← citeshttps://doi.org/10.1007/978-1-84882-258-0_11openalex-snapshot
Finite Observation Models
inferred← citeshttps://doi.org/10.1007/978-3-030-21485-2_5openalex-snapshot
Reward Testing Equivalences for Processes
inferred← citeshttps://doi.org/10.1007/978-3-031-73709-1_5openalex-snapshot
An Abstract Account of Up-to Techniques for Inductive Behavioural Relations
inferred← citeshttps://doi.org/10.1007/978-3-031-98208-8_7openalex-snapshot
Mining Diamonds in Labelled Transition Systems
inferred← citeshttps://doi.org/10.1007/978-3-319-23506-6_16openalex-snapshot
Mediator Synthesis in a Component Algebra with Data
inferred← citeshttps://doi.org/10.1007/978-3-319-23506-6_2openalex-snapshot
Ernst-Rüdiger Olderog: A Life for Meaning
inferred← citeshttps://doi.org/10.1007/978-3-319-23506-6_9openalex-snapshot
Structure Preserving Bisimilarity, Supporting an Operational Petri Net Semantics of CCSP
inferred← citeshttps://doi.org/10.1007/978-3-319-25942-0_10openalex-snapshot
An Application of Temporal Projection to Interleaving Concurrency
inferred← citeshttps://doi.org/10.1007/978-3-319-51046-0_14openalex-snapshot
A Branching Time Model of CSP
inferred← citeshttps://doi.org/10.1007/978-3-322-94670-6_6openalex-snapshot
Literaturverzeichnis zur parallelen Programmierung
inferred← citeshttps://doi.org/10.1007/978-3-540-24727-2_14openalex-snapshot
On Finite Alphabets and Infinite Bases: From Ready Pairs to Possible Worlds
inferred← citeshttps://doi.org/10.1007/978-3-540-39656-7_15openalex-snapshot
Specification and Inheritance in CSP-OZ
inferred← citeshttps://doi.org/10.1007/978-3-540-48654-1_31openalex-snapshot
Testing-Based Abstractions for Value-Passing Systems
inferred← citeshttps://doi.org/10.1007/978-3-540-73420-8_65openalex-snapshot
Ready Simulation for Concurrency: It’s Logical!
inferred← citeshttps://doi.org/10.1007/978-3-540-75596-8_4openalex-snapshot
Branching vs. Linear Time: Semantical Perspective
inferred← citeshttps://doi.org/10.1007/978-3-540-85238-4_2openalex-snapshot
On Synchronous and Asynchronous Interaction in Distributed Systems
inferred← citeshttps://doi.org/10.1007/978-3-540-85762-4_3openalex-snapshot
The Three Platonic Models of Divergence-Strict CSP
inferred← citeshttps://doi.org/10.1007/978-3-642-11623-0_16openalex-snapshot
On the Expressiveness of Refinement Settings
inferred← citeshttps://doi.org/10.1007/978-3-642-17164-2_28openalex-snapshot
Model Independent Order Relations for Processes
inferred← citeshttps://doi.org/10.1007/978-3-642-28729-9_22openalex-snapshot
On Distributability of Petri Nets
inferred← citeshttps://doi.org/10.1007/978-3-642-60858-2_18openalex-snapshot
Formal Derivation of a Protocol in CSP
inferred← citeshttps://doi.org/10.1007/978-3-642-74884-4_10openalex-snapshot
Towards a Design Methodology for Distributed Systems
inferred← citeshttps://doi.org/10.1007/978-3-642-77572-7_15openalex-snapshot
Systematic Derivation of Communicating Programs
inferred← citeshttps://doi.org/10.1007/978-3-642-82453-1_14openalex-snapshot
Specification-Oriented Programming in TCSP
inferred← citeshttps://doi.org/10.1007/978-3-662-04293-9openalex-snapshot
Introduction to Process Algebra
inferred← citeshttps://doi.org/10.1007/978-3-662-25209-3_32openalex-snapshot
Acceptance Automata: A Framework for Specifying and Verifying TCSP Parallel Systems
inferred← citeshttps://doi.org/10.1007/978-3-662-45198-4_5openalex-snapshot
Testing Finite Probabilistic Processes
inferred← citeshttps://doi.org/10.1007/bf00263291openalex-snapshot
Order and metric in the stream semantics of elemental concurrency
inferred← citeshttps://doi.org/10.1007/bf00264365openalex-snapshot
Extensional equivalences for transition systems
inferred← citeshttps://doi.org/10.1007/bf00265151openalex-snapshot
Step failures semantics and a complete proof system
inferred← citeshttps://doi.org/10.1007/bf00276021openalex-snapshot
Failures semantics and deadlocking of modular Petri nets
inferred← citeshttps://doi.org/10.1007/bf00277389openalex-snapshot
Representing CCS programs by finite predicate/transition nets
inferred← citeshttps://doi.org/10.1007/bf00289016openalex-snapshot
Hiding in stream semantics of uniform concurrency
inferred← citeshttps://doi.org/10.1007/bf01094341openalex-snapshot
Tools for specifying real-time systems
inferred← citeshttps://doi.org/10.1007/bf01178923openalex-snapshot
The connection between an event structure semantics and an operational semantics forTCSP
inferred← citeshttps://doi.org/10.1007/bf01211075openalex-snapshot
A fully abstract semantics of classes for Object-Z
inferred← citeshttps://doi.org/10.1007/bf01211218openalex-snapshot
Compositional failure-based semantic models for Basic LOTOS
inferred← citeshttps://doi.org/10.1007/bf01784023openalex-snapshot
Step semantics for “true” concurrency with recursion
inferred← citeshttps://doi.org/10.1007/bf01788563openalex-snapshot
A state-based approach to communicating processes
inferred← citeshttps://doi.org/10.1007/bf01898399openalex-snapshot
The fixed point theory of unbounded non-determinism
inferred← citeshttps://doi.org/10.1007/bf02280834openalex-snapshot
A fully abstract trace model for dataflow and asynchronous networks
inferred← citeshttps://doi.org/10.1007/bf03037487openalex-snapshot
Deriving failures models for nonuniform concurrency from structured operational semantics
inferred← citeshttps://doi.org/10.1007/bfb0013035openalex-snapshot
Strong bisimilarity on nets: A new concept for comparing net semantics
inferred← citeshttps://doi.org/10.1007/bfb0013038openalex-snapshot
Correctness and full abstraction of metric semantics for concurrency
inferred← citeshttps://doi.org/10.1007/bfb0015049openalex-snapshot
Modular specifications in process algebra
inferred← citeshttps://doi.org/10.1007/bfb0015456openalex-snapshot
Event automata as a generic model of reactive systems
inferred← citeshttps://doi.org/10.1007/bfb0015727openalex-snapshot
Linear and branching structures in the semantics and logics of reactive systems
inferred← citeshttps://doi.org/10.1007/bfb0017178openalex-snapshot
Failures semantics and deadlocking of modular petri nets
inferred← citeshttps://doi.org/10.1007/bfb0029628openalex-snapshot
A hierarchy of compositional models of I/O-automata (Extended Abstract)
inferred← citeshttps://doi.org/10.1007/bfb0039053openalex-snapshot
Process algebra with a zero object
inferred← citeshttps://doi.org/10.1007/bfb0039066openalex-snapshot
The linear time - branching time spectrum
inferred← citeshttps://doi.org/10.1007/bfb0084793openalex-snapshot
The weakest compositional semantic equivalence preserving nexttime-less linear temporal logic
inferred← citeshttps://doi.org/10.1007/s00165-003-0007-4openalex-snapshot
Relational Concurrent Refinement
inferred← citeshttps://doi.org/10.1007/s00165-007-0032-9openalex-snapshot
Responsiveness and stable revivals
inferred← citeshttps://doi.org/10.1007/s00165-007-0042-7openalex-snapshot
Integrating a formal method into a software engineering process with UML and Java
inferred← citeshttps://doi.org/10.1007/s00165-017-0417-3openalex-snapshot
An application of temporal projection to interleaving concurrency
inferred← citeshttps://doi.org/10.1007/s00224-007-9047-0openalex-snapshot
Abstract Interface Behavior of Object-Oriented Languages with Monitors
inferred← citeshttps://doi.org/10.1007/s00236-020-00369-4openalex-snapshot
A linear-time branching-time perspective on interface automata
inferred← citeshttps://doi.org/10.1007/s00236-022-00417-1openalex-snapshot
Reactive bisimulation semantics for a process algebra with timeouts
inferred← citeshttps://doi.org/10.1007/s002360000041openalex-snapshot
Refinement of actions and equivalence notions for concurrent systems
inferred← citeshttps://doi.org/10.1007/s004460050061openalex-snapshot
The compositional approach to sequential consistency and lazy caching
inferred← citeshttps://doi.org/10.1007/s10270-007-0065-9openalex-snapshot
Heap-abstraction for an object-oriented calculus with thread classes
inferred← citeshttps://doi.org/10.1007/s10626-012-0133-3openalex-snapshot
Conflict-preserving abstraction of discrete event systems using annotated automata
inferred← citeshttps://doi.org/10.1007/s11704-011-0140-9openalex-snapshot
Two-thirds simulation indexes and modal logic characterization
inferred← citeshttps://doi.org/10.1016/0020-0190(91)90145-8openalex-snapshot
A note on the notation of recursion in process algebras
inferred← citeshttps://doi.org/10.1016/0020-0190(93)90219-yopenalex-snapshot
From algebra to operational semantics
inferred← citeshttps://doi.org/10.1016/0020-0255(93)90031-gopenalex-snapshot
On deciding trace equivalences for processes
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/0096-0551(94)90007-8openalex-snapshot
A process oriented semantics of the PRAM-language FORK
inferred← citeshttps://doi.org/10.1016/0164-1212(92)90045-lopenalex-snapshot
Formal methods for the specification and design of real-time safety critical systems
inferred← citeshttps://doi.org/10.1016/0164-1212(95)00066-6openalex-snapshot
A formally specified prototyping system
inferred← citeshttps://doi.org/10.1016/0164-1212(95)00071-2openalex-snapshot
Languages for the specification of software
inferred← citeshttps://doi.org/10.1016/0167-6423(92)90003-topenalex-snapshot
Communication relations: a paradigm for parallel program design
inferred← citeshttps://doi.org/10.1016/0167-6423(95)00024-0openalex-snapshot
Towards a design calculus for CSP
inferred← citeshttps://doi.org/10.1016/0304-3975(87)90002-8openalex-snapshot
Infinite streams and finite observations in the semantics of uniform concurrency
inferred← citeshttps://doi.org/10.1016/0304-3975(87)90012-0openalex-snapshot
Modal logics for communicating systems
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)90142-9openalex-snapshot
Interpretations of recursion under unbounded nondeterminacy
inferred← citeshttps://doi.org/10.1016/0304-3975(90)90060-uopenalex-snapshot
Comparative metric semantics for concurrent prolog
inferred← citeshttps://doi.org/10.1016/0304-3975(90)90095-yopenalex-snapshot
A partial ordering semantics for CCS
inferred← citeshttps://doi.org/10.1016/0304-3975(91)90390-nopenalex-snapshot
Correctness of concurrent processes
inferred← citeshttps://doi.org/10.1016/0304-3975(92)90041-dopenalex-snapshot
The N U system as a development system for concurrent programs: δ N U
inferred← citeshttps://doi.org/10.1016/0304-3975(92)90327-copenalex-snapshot
Adequacy-preserving transformations of COSY path programs
inferred← citeshttps://doi.org/10.1016/0304-3975(93)90006-fopenalex-snapshot
Modular specification of process algebras
inferred← citeshttps://doi.org/10.1016/0304-3975(95)00166-2openalex-snapshot
On the operational semantics of nondeterminism and divergence
inferred← citeshttps://doi.org/10.1016/0890-5401(91)90005-mopenalex-snapshot
Towards a foundation for semantics in complete metric spaces
inferred← citeshttps://doi.org/10.1016/0890-5401(92)90013-6openalex-snapshot
Structured operational semantics and bisimulation as a congruence
inferred← citeshttps://doi.org/10.1016/b978-0-08-040953-5.50008-8openalex-snapshot
PROVABLY CORRECT SAFETY CRITICAL SOFTWARE
inferred← citeshttps://doi.org/10.1016/b978-0-08-041894-0.50030-7openalex-snapshot
The Specification, Design and Verification of Real-Time Embedded Control Logic using CSP and TCSP
inferred← citeshttps://doi.org/10.1016/b978-0-444-88074-1.50020-2openalex-snapshot
Methods and Logics for Proving Programs
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/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.1016/b978-044482830-9/50020-5openalex-snapshot
Trace-Oriented Models of Concurrency
inferred← citeshttps://doi.org/10.1016/j.entcs.2004.04.025openalex-snapshot
A Hierarchy of Failures-Based Models
inferred← citeshttps://doi.org/10.1016/j.entcs.2005.10.012openalex-snapshot
Machine-Verifiable Responsiveness
inferred← citeshttps://doi.org/10.1016/j.entcs.2007.02.013openalex-snapshot
Remarks on Testing Probabilistic Processes
inferred← citeshttps://doi.org/10.1016/j.ic.2007.12.003openalex-snapshot
(Bi)simulations up-to characterise process semantics
inferred← citeshttps://doi.org/10.1016/j.ic.2010.02.001openalex-snapshot
Ready simulation for concurrency: It’s logical!
inferred← citeshttps://doi.org/10.1016/j.jlap.2008.08.003openalex-snapshot
Processes with local and global liveness requirements
inferred← citeshttps://doi.org/10.1016/j.jlap.2008.10.002openalex-snapshot
Revivals, stuckness and the hierarchy of CSP models
inferred← citeshttps://doi.org/10.1016/j.jlap.2013.03.001openalex-snapshot
Processes with infinite liveness requirements
inferred← citeshttps://doi.org/10.1016/j.jss.2006.04.003openalex-snapshot
Timed verification of the reliable adaptive multicast protocol
inferred← citeshttps://doi.org/10.1016/j.scico.2004.05.017openalex-snapshot
Specification and (property) inheritance in CSP-OZ
inferred← citeshttps://doi.org/10.1016/j.tcs.2004.10.004openalex-snapshot
A hierarchy of failures-based models: theory and application
inferred← citeshttps://doi.org/10.1016/j.tcs.2011.02.036openalex-snapshot
On cool congruence formats for weak bisimulations
inferred← citeshttps://doi.org/10.1016/s0304-3975(00)00170-5openalex-snapshot
Divergence in testing and readiness semantics
inferred← citeshttps://doi.org/10.1016/s0304-3975(96)00251-4openalex-snapshot
Notes on the methodology of CCS and CSP
inferred← citeshttps://doi.org/10.1016/s0304-3975(99)00300-xopenalex-snapshot
Algebraic characterizations of trace and decorated trace equivalences over tree-like structures
inferred← citeshttps://doi.org/10.1016/s1474-6670(17)50142-1openalex-snapshot
The Specification, Design and Verification of Real-Time Embedded Control Logic using CSP and TCSP
inferred← citeshttps://doi.org/10.1016/s1474-6670(17)51218-5openalex-snapshot
Foundations of a logical theory of modeling and control of discrete event systems
inferred← citeshttps://doi.org/10.1016/s1474-6670(17)52170-9openalex-snapshot
Provably Correct Safety Critical Software
inferred← citeshttps://doi.org/10.1016/s1567-8326(02)00066-8openalex-snapshot
On the use of MTBDDs for performability analysis and verification of stochastic systems
inferred← citeshttps://doi.org/10.1016/s1571-0661(05)80488-8openalex-snapshot
Unifying Concurrent and Relational Refinement
inferred← citeshttps://doi.org/10.1016/s1571-0661(05)80596-1openalex-snapshot
On Generative Parallel Composition
inferred← citeshttps://doi.org/10.1017/cbo9780511777110openalex-snapshot
Introduction to Bisimulation and Coinduction
inferred← citeshttps://doi.org/10.1017/s0960129500000189openalex-snapshot
Quantales, observational logic and process semantics
inferred← citeshttps://doi.org/10.1017/s0960129516000360openalex-snapshot
Order algebras: a quantitative model of interaction
inferred← citeshttps://doi.org/10.1017/s0960129597002491openalex-snapshot
A menagerie of non-finitely based process semantics over BPA* – from ready simulation to completed traces
inferred← citeshttps://doi.org/10.1023/a:1007963427189openalex-snapshot
The ProCoS Approach to Correct Systems
inferred← citeshttps://doi.org/10.1023/a:1008264413708openalex-snapshot
The Evolution of Concurrent Programs
inferred← citeshttps://doi.org/10.1051/ita/1994280100511openalex-snapshot
On deciding some equivalences for concurrent processes
inferred← citeshttps://doi.org/10.1093/comjnl/bxn009openalex-snapshot
Congruence Formats for Weak Readiness Equivalence and Weak Possible Future Equivalence
inferred← citeshttps://doi.org/10.1109/32.58782openalex-snapshot
The specification and verified decomposition of system requirements using CSP
inferred← citeshttps://doi.org/10.1109/37.56284openalex-snapshot
Concurrency and discrete event control
inferred← citeshttps://doi.org/10.1109/cmpass.1990.175409openalex-snapshot
Using CSP to develop trustworthy hardware
showing the first 200 of 247 · page through all 247
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.