Trace and testing equivalence on asynchronous processes

DOI10.1006/INCO.2001.3080MaRDI QIDQ1854499zbMATH OpenOpenAlexWikidataFDO

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

Mathematics Subject Classification ID

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)

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

Cites work

• scientific article; zbMATH DE number 42752 (Why is no real title available?)
• scientific article; zbMATH DE number 1223738 (Why is no real title available?)
• A calculus for cryptographic protocols: The spi calculus
• A calculus of mobile processes. II
• A foundation for actor computation
• A process algebraic view of Linda coordination primitives
• A process algebraic view of input/output automata
• A proof of the Kahn principle for input/output automata
• Bisimulations in the join-calculus
• First-order axioms for asynchrony
• Generative communication in Linda
• Linda-based applicative and imperative process algebras
• On bisimulations for the asynchronous -calculus
• Process algebra for synchronous communication
• Testing equivalence for mobile processes
• Testing equivalences for processes
• The Semantics of Call-By-Value and Call-By-Name in a Nondeterministic Environment

Cited in

(20)

• A model of actors and grey failures
• Verification of asynchronous systems with an unspecified component
• A fully abstract may testing semantics for concurrent objects
• An executable specification of asynchronous pi-calculus semantics and may testing in Maude 2.0
• An abstract framework for choreographic testing
• Contract-based discovery of Web services modulo simple orchestrators
• The complexity of asynchronous model based testing
• An abstract framework for choreographic testing
• Basic observables for a calculus for global computing
• Full Abstraction for Linda
• A trace-based service semantics guaranteeing deadlock freedom
• A theory of may testing for asynchronous calculi with locality and no name matching
• Concurrency cannot be observed, asynchronously
• A synchronous -calculus
• A centralized and a decentralized method to automatically derive choreography-conforming web service systems
• Determining asynchronous test equivalence for probabilistic processes
• 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

Describes a project that uses

Uses Software

• Linda

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)