On the public citation graph
Multiway synchronization verified with coupled simulation
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.
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-17945-3_22openalex-snapshot
A new and efficient implementation of multiprocess synchronization
inferredcites →https://doi.org/10.1007/978-3-642-82453-1_7openalex-snapshot
Script: A Communication Abstraction Mechanism and its Verification
inferredcites →https://doi.org/10.1007/bfb0039063openalex-snapshot
Superimposition for interacting processes
inferredcites →https://doi.org/10.1016/0020-0190(90)90091-bopenalex-snapshot
A distributed synchronization scheme for fair multi-process handshakes
inferredcites →https://doi.org/10.1016/0167-6423(86)90018-3openalex-snapshot
Script: A communication abstraction mechanism and its verification
inferredcites →https://doi.org/10.1016/0169-7552(87)90085-7openalex-snapshot
Introduction to the ISO specification language LOTOS
inferredcites →https://doi.org/10.1016/0304-3975(84)90113-0openalex-snapshot
Testing equivalences for processes
inferredcites →https://doi.org/10.1109/32.31364openalex-snapshot
Process synchronization: design and performance evaluation of distributed algorithms
inferredcites →https://doi.org/10.1109/32.41333openalex-snapshot
Multiparty interactions for interprocess communication and synchronization
inferredcites →https://doi.org/10.1109/icdcs.1990.89299openalex-snapshot
An implementation of N-party synchronization using tokens
inferredcites →https://doi.org/10.1109/tse.1987.233514openalex-snapshot
A Methodology for Developing Distributed Programs
inferredcites →https://doi.org/10.1145/48022.48023openalex-snapshot
Distributed cooperation with action systems
inferredcites →https://doi.org/10.1145/99583.99614openalex-snapshot
Coordinating first-order multiparty interactions
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.1999.2822openalex-snapshot
What is a “Good” Encoding of Guarded Choice?
inferred← citeshttps://doi.org/10.1007/11415787_3openalex-snapshot
Non-atomic Refinement in Z and CSP
inferred← citeshttps://doi.org/10.1007/3-540-44880-2_10openalex-snapshot
Using Coupled Simulations in Non-atomic Refinement
inferred← citeshttps://doi.org/10.1007/3-540-44929-9_26openalex-snapshot
An Asynchronous, Distributed Implementation of Mobile Ambients
inferred← citeshttps://doi.org/10.1007/3-540-45699-6_6openalex-snapshot
The Join Calculus: A Language for Distributed Mobile Programming
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-57785-8_171openalex-snapshot
The complete axiomatization of Cs-congruence
inferred← citeshttps://doi.org/10.1007/978-0-387-35608-2_44openalex-snapshot
A Randomized Distributed Encoding of the π-Calculus with Mixed Choice
inferred← citeshttps://doi.org/10.1007/978-3-030-17462-0_14openalex-snapshot
Computing Coupled Similarity
inferred← citeshttps://doi.org/10.1007/978-3-030-32505-3_12openalex-snapshot
Taming Concurrency for Verification Using Multiparty Session Types
inferred← citeshttps://doi.org/10.1007/978-3-319-48989-6_13openalex-snapshot
Local Planning of Multiparty Interactions with Bounded Horizons
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-540-28644-8_24openalex-snapshot
A General Approach to Comparing Infinite-State Systems with Their Finite-State Specifications
inferred← citeshttps://doi.org/10.1007/978-3-642-38592-6_11openalex-snapshot
Formal Verification of Distributed Branching Multiway Synchronization Protocols
inferred← citeshttps://doi.org/10.1007/bfb0055107openalex-snapshot
A hierarchy of equivalences for asynchronous calculi
inferred← citeshttps://doi.org/10.1007/s00236-016-0271-4openalex-snapshot
A general account of coinduction up-to
inferred← citeshttps://doi.org/10.1007/s00236-019-00356-4openalex-snapshot
Coupled similarity: the first 32 years
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/s10617-012-9091-0openalex-snapshot
Model-based implementation of distributed systems with priorities
inferred← citeshttps://doi.org/10.1016/j.entcs.2009.06.005openalex-snapshot
Encapsulation and Dynamic Modularity in the π-calculus
inferred← citeshttps://doi.org/10.1016/j.jlap.2004.01.006openalex-snapshot
A hierarchy of equivalences for asynchronous calculi
inferred← citeshttps://doi.org/10.1016/j.scico.2014.02.013openalex-snapshot
Optimized distributed implementation of multiparty interactions with Restriction
inferred← citeshttps://doi.org/10.1016/j.tcs.2004.11.020openalex-snapshot
A randomized encoding of the π -calculus with mixed choice
inferred← citeshttps://doi.org/10.1016/j.tcs.2006.01.021openalex-snapshot
A general approach to comparing infinite-state systems with their finite-state specifications
inferred← citeshttps://doi.org/10.1016/s0020-0190(01)00217-4openalex-snapshot
Impossible futures and determinism
inferred← citeshttps://doi.org/10.1016/s0140-3664(96)01149-8openalex-snapshot
Designing a multiway synchronization protocol
inferred← citeshttps://doi.org/10.1017/cbo9780511777110openalex-snapshot
Introduction to Bisimulation and Coinduction
inferred← citeshttps://doi.org/10.1017/s0960129516000402openalex-snapshot
The true concurrency of differential interaction nets
inferred← citeshttps://doi.org/10.1145/2038642.2038654openalex-snapshot
Automated distributed implementation of component-based models with priorities
inferred← citeshttps://doi.org/10.1145/233551.233556openalex-snapshot
Branching time and abstraction in bisimulation semantics
inferred← citeshttps://doi.org/10.1145/2414639.2414649openalex-snapshot
Optimized distributed implementation of multiparty interactions with observation
inferred← citeshttps://doi.org/10.1145/263699.263731openalex-snapshot
Comparing the expressive power of the synchronous and the asynchronous π-calculus
inferred← citeshttps://doi.org/10.1145/3828683openalex-snapshot
Safety First: How to Safely Disregard Unsafe Behaviour in Compiler Calculations
inferred← citeshttps://doi.org/10.14279/depositonce-3416openalex-snapshot
Translational expressiveness: comparing process calculi using encodings
inferred← citeshttps://doi.org/10.2178/bsl/1264433799openalex-snapshot
2009 European Summer Meeting of the Association for Symbolic Logic. Logic Colloquium '09
inferred← citeshttps://doi.org/10.3990/1.9789090074610openalex-snapshot
Architectural notes: a framework for distributed systems development
inferred← citeshttps://doi.org/10.4204/eptcs.190.4openalex-snapshot
Analysing and Comparing Encodability Criteria
inferred← citeshttps://doi.org/10.4204/eptcs.300.2openalex-snapshot
Comparing Process Calculi Using Encodings
inferred← citeshttps://doi.org/10.4204/eptcs.368.7openalex-snapshot
On the Expressiveness of Mixed Choice Sessions
inferred← citeshttps://doi.org/10.48456/tr-514openalex-snapshot
Nomadic π-calculi: expressing and verifying communication infrastructure for mobile computation
inferred← citeshttps://doi.org/10.48550/arxiv.1209.0663openalex-snapshot
Computational Complexity of Interactive Behaviors
inferred← citeshttps://doi.org/10.48550/arxiv.1508.01127openalex-snapshot
Encoding CSP into CCS (Extended Version)
inferred← citeshttps://doi.org/10.48550/arxiv.1908.06510openalex-snapshot
Taming Concurrency for Verification Using Multiparty Session Types (Technical Report)
inferred← citeshttps://doi.org/10.70675/b796ac39ze4b4z4857z9f03zbd5ff117286bopenalex-snapshot
Implantations distribuées de modèles à base de composants communicants par interactions multiparties avec priorités : application au langage BIP
inferred← citeshttps://doi.org/10.7146/brics.v4i45.19266openalex-snapshot
What Is a ‘Good’ Encoding of Guarded Choice?
inferred← citeshttps://doi.org/10.7146/brics.v6i43.20113openalex-snapshot
What is a ‘Good’ Encoding of Guarded Choice?
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.