On the public citation graph
Testing equivalences for processes
0 signed · 128 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-10003-2_79openalex-snapshot
On observing nondeterminism and concurrency
inferredcites →https://doi.org/10.1007/3-540-10235-3openalex-snapshot
A Calculus of Communicating Systems
inferredcites →https://doi.org/10.1007/3-540-11494-7_13openalex-snapshot
Powerdomains and nondeterministic recursive definitions
inferredcites →https://doi.org/10.1007/3-540-11494-7_5openalex-snapshot
An enlarged definition and complete axiomatization of observational congruence of finite 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.1109/sfcs.1981.36openalex-snapshot
Possible futures, acceptances, refusals, and communicating processes
inferredcites →https://doi.org/10.1145/321992.321997openalex-snapshot
Initial Algebra Semantics and Continuous Algebras
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.1007/11901914_30openalex-snapshot
A Semantic Framework for Test Coverage
inferred← citeshttps://doi.org/10.1007/3-540-12689-9_89openalex-snapshot
Experiments, powerdomains and fully abstract models for applicative multiprogramming
inferred← citeshttps://doi.org/10.1007/3-540-12689-9_98openalex-snapshot
A complete set of axioms for a theory of communicating sequential processes
inferred← citeshttps://doi.org/10.1007/3-540-12896-4_356openalex-snapshot
A semantics and proof system for communicating processes
inferred← citeshttps://doi.org/10.1007/3-540-15198-2_16openalex-snapshot
A complete modal proof system for a subset of SCCS
inferred← citeshttps://doi.org/10.1007/3-540-15670-4_14openalex-snapshot
An improved failures model for communicating processes
inferred← citeshttps://doi.org/10.1007/3-540-15670-4_21openalex-snapshot
A fully abstract model of fair asynchrony
inferred← citeshttps://doi.org/10.1007/3-540-15670-4_3openalex-snapshot
On the composition and decomposition of assertions
inferred← citeshttps://doi.org/10.1007/3-540-16042-6_22openalex-snapshot
A complete proof system for SCCS with modal assertions
inferred← citeshttps://doi.org/10.1007/3-540-16078-7_82openalex-snapshot
Towards specification and proof of asynchronous systems
inferred← citeshttps://doi.org/10.1007/3-540-16816-8_31openalex-snapshot
Free constructions of powerdomains
inferred← citeshttps://doi.org/10.1007/3-540-50325-0_9openalex-snapshot
Observing nondeterministic data types
inferred← citeshttps://doi.org/10.1007/3-540-55251-0_11openalex-snapshot
Must preorder in non-deterministic untyped λ-calculus
inferred← citeshttps://doi.org/10.1007/3-540-55613-3_2openalex-snapshot
On asynchronous communication semantics
inferred← citeshttps://doi.org/10.1007/978-1-4471-3217-2_5openalex-snapshot
CCSR 92: Calculus for Communicating Shared Resources with Dynamic Priorities
inferred← citeshttps://doi.org/10.1007/978-1-4471-3534-0_14openalex-snapshot
Specifying Processes in Terms of Their Environments
inferred← citeshttps://doi.org/10.1007/978-1-84882-912-1_1openalex-snapshot
Insight, Inspiration and Collaboration
inferred← citeshttps://doi.org/10.1007/978-3-030-17184-1_23openalex-snapshot
A Categorical Model of an $$\mathbf {i/o}$$ -typed $$\pi $$ -calculus
inferred← citeshttps://doi.org/10.1007/978-3-030-21485-2_20openalex-snapshot
Process Calculi for Modelling Mobile, Service-Oriented, and Collective Autonomic Systems
inferred← citeshttps://doi.org/10.1007/978-3-030-21485-2_4openalex-snapshot
Testing Equivalence vs. Runtime Monitoring
inferred← citeshttps://doi.org/10.1007/978-3-030-38800-3_5openalex-snapshot
Specification-Based Testing
inferred← citeshttps://doi.org/10.1007/978-3-030-47361-7openalex-snapshot
Reversible Computation: Extending Horizons of Computing
inferred← citeshttps://doi.org/10.1007/978-3-030-71995-1openalex-snapshot
Foundations of Software Science and Computation Structures
inferred← citeshttps://doi.org/10.1007/978-3-319-39519-7_2openalex-snapshot
A Game Interpretation of Retractable Contracts
inferred← citeshttps://doi.org/10.1007/978-3-540-31848-4_5openalex-snapshot
A Test Generation Framework for quiescent Real-Time Systems
inferred← citeshttps://doi.org/10.1007/978-3-540-45133-4_15openalex-snapshot
A Model for Conformance Testing of Mobile Agents in a MASIF Framework
inferred← citeshttps://doi.org/10.1007/978-3-540-89287-8_9openalex-snapshot
Model Driven Testing Based on Test History
inferred← citeshttps://doi.org/10.1007/978-3-642-00255-7_13openalex-snapshot
Modelling Divergence in Relational Concurrent Refinement
inferred← citeshttps://doi.org/10.1007/978-3-642-22953-4_24openalex-snapshot
A Coinductive Calculus for Asynchronous Side-Effecting Processes
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-642-82453-1_9openalex-snapshot
Notes on Algebraic Calculi of Processes
inferred← citeshttps://doi.org/10.1007/978-3-642-82921-5_6openalex-snapshot
Extensional Behaviour of Concurrent, Nondeterministic, Communicating Systems
inferred← citeshttps://doi.org/10.1007/bf00263649openalex-snapshot
Non-deterministic data types: models and implementations
inferred← citeshttps://doi.org/10.1007/bf00289140openalex-snapshot
Axiomatising finite delay operators
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/bfb0015773openalex-snapshot
A complete compositional modal proof system for a subset of CCS
inferred← citeshttps://doi.org/10.1007/bfb0016260openalex-snapshot
Safe implementation equivalence for asynchronous nondeterministic processes
inferred← citeshttps://doi.org/10.1007/bfb0030326openalex-snapshot
Models and operators for nondeterministic processes
inferred← citeshttps://doi.org/10.1007/bfb0036899openalex-snapshot
On the relationship of CCS and CSP
inferred← citeshttps://doi.org/10.1007/bfb0036946openalex-snapshot
Power domains and predicate transformers: A topological view
inferred← citeshttps://doi.org/10.1007/s001650050026openalex-snapshot
Testing Algebraic Data Types and Processes: A Unifying Theory
inferred← citeshttps://doi.org/10.1007/s100090050006openalex-snapshot
Continuous modeling of real-time and hybrid systems: from concepts to tools
inferred← citeshttps://doi.org/10.1007/s100090050044openalex-snapshot
On-the-fly conformance testing using SPIN
inferred← citeshttps://doi.org/10.1016/0066-4138(88)90002-xopenalex-snapshot
LOTOS based derivation methodology in the PRODAT project
inferred← citeshttps://doi.org/10.1016/0140-3664(92)90106-oopenalex-snapshot
Addressing performance requirements in the FDT-based design of distributed systems
inferred← citeshttps://doi.org/10.1016/0169-7552(87)90085-7openalex-snapshot
Introduction to the ISO specification language LOTOS
inferred← citeshttps://doi.org/10.1016/0304-3975(85)90037-4openalex-snapshot
On powerdomains and modality
inferred← citeshttps://doi.org/10.1016/0304-3975(85)90129-xopenalex-snapshot
A proof-theoretic characterization of observational equivalence
inferred← citeshttps://doi.org/10.1016/0304-3975(87)90065-xopenalex-snapshot
Observation equivalence as a testing equivalence
inferred← citeshttps://doi.org/10.1016/j.entcs.2008.06.013openalex-snapshot
General Refinement, Part One: Interfaces, Determinism and Special Refinement
inferred← citeshttps://doi.org/10.1016/j.tcs.2025.115325openalex-snapshot
Axiomatising weak bisimulation congruences over CCS with left merge and communication merge
inferred← citeshttps://doi.org/10.1016/s0019-9958(83)80029-1openalex-snapshot
Synchronous and asynchronous experiments on processes
inferred← citeshttps://doi.org/10.1016/s0019-9958(84)80025-xopenalex-snapshot
Process algebra for synchronous communication
inferred← citeshttps://doi.org/10.1016/s0019-9958(84)80032-7openalex-snapshot
Functional behavior of nondeterministic and concurrent programs
inferred← citeshttps://doi.org/10.1016/s1571-0661(04)80004-5openalex-snapshot
Full Abstraction for Strongly Fair Communicating Processes
inferred← citeshttps://doi.org/10.1016/s1571-0661(04)80873-9openalex-snapshot
First–order Semantics for Higher–order Processes
inferred← citeshttps://doi.org/10.1017/s095679689700261xopenalex-snapshot
A foundation for actor computation
inferred← citeshttps://doi.org/10.1017/s096012951400005xopenalex-snapshot
Sub-behaviour relations for session-based client/server systems
inferred← citeshttps://doi.org/10.1017/s0960129514000073openalex-snapshot
On recursive operations over logic LTS
inferred← citeshttps://doi.org/10.1017/s0960129514000619openalex-snapshot
Information flow safety in multiparty sessions
inferred← citeshttps://doi.org/10.1109/apsec51365.2020.00060openalex-snapshot
Asynchronous test equivalence for probabilistic processes
inferred← citeshttps://doi.org/10.1109/csf.2015.40openalex-snapshot
A Methodology for Information Flow Experiments
inferred← citeshttps://doi.org/10.1109/ispdc.2013.30openalex-snapshot
Not Seeing the Parse Trees from the Parse Forest of a Context-Free Parallel Communicating Grammar System
inferred← citeshttps://doi.org/10.1109/lics52264.2021.9470526openalex-snapshot
In search of lost time: Axiomatising parallel composition in process algebras
inferred← citeshttps://doi.org/10.1109/services.2010.23openalex-snapshot
Towards a Formalization of Contracts for Service Substitution
inferred← citeshttps://doi.org/10.1109/tc.1986.1676697openalex-snapshot
A LOTOS Specification of the PROWAY Highway Service
inferred← citeshttps://doi.org/10.1109/tencon.1990.152637openalex-snapshot
On the design of communication systems by ECCS and CSP based approaches
inferred← citeshttps://doi.org/10.1109/tse.2013.20openalex-snapshot
Whitening SOA Testing via Event Exposure
inferred← citeshttps://doi.org/10.1145/147508.147527openalex-snapshot
Termination, deadlock, and divergence
inferred← citeshttps://doi.org/10.1145/174675.177941openalex-snapshot
An operational framework for value-passing processes
inferred← citeshttps://doi.org/10.1145/3576915.3623113openalex-snapshot
Formal Analysis of Access Control Mechanism of 5G Core Network
inferred← citeshttps://doi.org/10.1145/63264.63402openalex-snapshot
ECCS and LIPS: two languages for OSI systems specification and verification
inferred← citeshttps://doi.org/10.11606/t.55.2019.tde-04012019-112931openalex-snapshot
Formal mutation testing in Circus process algebra
inferred← citeshttps://doi.org/10.1184/r1/6591032openalex-snapshot
A Methodology for Information Flow Experiments
inferred← citeshttps://doi.org/10.15514/syrcose-2007-1-14openalex-snapshot
Conformance Testing With State Mapping
inferred← citeshttps://doi.org/10.15546/aeei-2014-0012openalex-snapshot
Security Properties Verification of Security Protocols
inferred← citeshttps://doi.org/10.1561/2500000031openalex-snapshot
Behavioral Types in Programming Languages
inferred← citeshttps://doi.org/10.20868/upm.thesis.15499openalex-snapshot
Contribución a la Formalización de la Fase de Ejecución de Pruebas
inferred← citeshttps://doi.org/10.20868/upm.thesis.46778openalex-snapshot
Síntesis de protocolos de comunicación a partir de especificaciones de servicio
inferred← citeshttps://doi.org/10.20868/upm.thesis.57809openalex-snapshot
A Model Driven Methodology for the Construction of Reliable Concurrent Software
inferred← citeshttps://doi.org/10.2168/lmcs-1(1:1)2005openalex-snapshot
Labelled transition systems as a Stone space
inferred← citeshttps://doi.org/10.2168/lmcs-10(1:16)2014openalex-snapshot
Revisiting Trace and Testing Equivalences for Nondeterministic and Probabilistic Processes
inferred← citeshttps://doi.org/10.2168/lmcs-11(3:17)2015openalex-snapshot
On the Axiomatizability of Impossible Futures
inferred← citeshttps://doi.org/10.2168/lmcs-12(2:10)2016openalex-snapshot
Using higher-order contracts to model session types
inferred← citeshttps://doi.org/10.2168/lmcs-4(4:4)2008openalex-snapshot
Characterising Testing Preorders for Finite Probabilistic Processes
inferred← citeshttps://doi.org/10.2168/lmcs-9(3:26)2013openalex-snapshot
Modelling Probabilistic Wireless Networks
inferred← citeshttps://doi.org/10.25100/iyc.v15i2.2601openalex-snapshot
Sobre la decidibilidad de dos fragmentos del π-cálculo asincrónico
inferred← citeshttps://doi.org/10.26226/morressier.604907f41a80aac83ca25cc3openalex-snapshot
Fair Refinement for Asynchronous Session Types
inferred← citeshttps://doi.org/10.2991/icsecs-13.2013.27openalex-snapshot
Approximation of Homogeneous Linear Algebraic Transition Systems
inferred← citeshttps://doi.org/10.3990/1.9789036531955openalex-snapshot
On changing models in model-based testing
inferred← citeshttps://doi.org/10.3990/1.9789036546959openalex-snapshot
Choice and Chance : Model-Based Testing of Stochastic Behaviour
inferred← citeshttps://doi.org/10.3990/1.9789064642739openalex-snapshot
Testing reactive systems with data : enumerative methods and constraint solving
inferred← citeshttps://doi.org/10.3990/1.9789090056432openalex-snapshot
A formal approach to conformance testing
inferred← citeshttps://doi.org/10.4204/eptcs.166.10openalex-snapshot
Loosening the notions of compliance and sub-behaviour in client/server systems
inferred← citeshttps://doi.org/10.4204/eptcs.41.3openalex-snapshot
Process Behaviour: Formulae vs. Tests (Extended Abstract)
inferred← citeshttps://doi.org/10.46298/lmcs-18(2:21)2022openalex-snapshot
The Theory of Traces for Systems with Nondeterminism, Probability, and Termination
inferred← citeshttps://doi.org/10.5353/th_b3124518openalex-snapshot
Towards a new extension relation for compositional test case generation for CSP concurrent processes
inferred← citeshttps://doi.org/10.5815/ijem.2017.01.01openalex-snapshot
Relating Interactive System Design and Information Theory from Information Leakage Perspective
inferred← citeshttps://doi.org/10.70675/174b16b3z807cz413fz9849z794e3e037748openalex-snapshot
Efficient verification of observational equivalences of cryptographic processes : theory and practice
inferred← citeshttps://doi.org/10.70675/46783f54zd6e0z49f4z8a90z590dd316e960openalex-snapshot
Génération de scénarios de tests pour la vérification de systèmes répartis : application au système européen de signalisation ferroviaire (ERTMS)
inferred← citeshttps://doi.org/10.7146/brics.v3i43.20025openalex-snapshot
Weak Semantics Based on Lighted Button Pressing Experiments. An Alternative Characterization of the Readiness Semantics
inferred← citeshttps://doi.org/10.7146/brics.v4i29.18955openalex-snapshot
Model Checking via Reachability Testing for Timed Automata
inferred← citeshttps://doi.org/10.7146/brics.v6i30.20099openalex-snapshot
Structural Operational Semantics
inferred← citeshttps://doi.org/10.7146/dpb.v19i308.6558openalex-snapshot
True concurrency can be traced
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.