Trace and testing equivalence on asynchronous processes
DOI10.1006/INCO.2001.3080zbMATH Open1009.68079OpenAlexW1969418483WikidataQ57650904 ScholiaQ57650904MaRDI QIDQ1854499FDOQ1854499
Authors: Michele Boreale, Rocco De Nicola, Rosario Pugliese 
Publication date: 14 January 2003
Published in: Information and Computation (Search for Journal in Brave)
Full work available at URL: https://semanticscholar.org/paper/d350a6c44bbfb6614a8aafb0ae9e35a1a5e38d21
Recommendations
- Trace, failure and testing equivalences for communicating processes
- A theory of may testing for asynchronous calculi with locality and no name matching
- Asynchronous traces and open Petri nets
- A Fresh Look at Testing for Asynchronous Communication
- An executable specification of asynchronous pi-calculus semantics and may testing in Maude 2.0
Specification and verification (program logics, model checking, etc.) (68Q60) Distributed systems (68M14) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)
Cites Work
- Process algebra for synchronous communication
- Title not available (Why is that?)
- A calculus of mobile processes. II
- A calculus for cryptographic protocols: The spi calculus
- Generative communication in Linda
- Testing equivalences for processes
- A process algebraic view of input/output automata
- Title not available (Why is that?)
- A foundation for actor computation
- Bisimulations in the join-calculus
- A process algebraic view of Linda coordination primitives
- Linda-based applicative and imperative process algebras
- On bisimulations for the asynchronous \(\pi\)-calculus
- Testing equivalence for mobile processes
- The Semantics of Call-By-Value and Call-By-Name in a Nondeterministic Environment
- First-order axioms for asynchrony
- A proof of the Kahn principle for input/output automata
Cited In (20)
- A model of actors and grey failures
- Verification of asynchronous systems with an unspecified component
- An executable specification of asynchronous pi-calculus semantics and may testing in Maude 2.0
- A fully abstract may testing semantics for concurrent objects
- An abstract framework for choreographic testing
- An abstract framework for choreographic testing
- Contract-based discovery of Web services modulo simple orchestrators
- The complexity of asynchronous model based testing
- Full Abstraction for Linda
- Basic observables for a calculus for global computing
- A trace-based service semantics guaranteeing deadlock freedom
- Concurrency cannot be observed, asynchronously
- A theory of may testing for asynchronous calculi with locality and no name matching
- A synchronous \(\pi\)-calculus
- Determining asynchronous test equivalence for probabilistic processes
- A centralized and a decentralized method to automatically derive choreography-conforming web service systems
- Asynchronous traces and open Petri nets
- Experimenting with process equivalence
- A Fresh Look at Testing for Asynchronous Communication
- A chart semantics for the pi-calculus
Uses Software
This page was built for publication: Trace and testing equivalence on asynchronous processes
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1854499)
