Trace and testing equivalence on asynchronous processes

DOI10.1006/inco.2001.3080zbMath1009.68079OpenAlexW1969418483WikidataQ57650904 ScholiaQ57650904MaRDI QIDQ1854499

Rocco De Nicola, Michele Boreale, 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) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85) Distributed systems (68M14)

Related Items (16)

A synchronous \(\pi\)-calculus ⋮ Asynchronous Traces and Open Petri Nets ⋮ Basic observables for a calculus for global computing ⋮ Determining asynchronous test equivalence for probabilistic processes ⋮ A model of actors and grey failures ⋮ A trace-based service semantics guaranteeing deadlock freedom ⋮ Unnamed Item ⋮ Verification of asynchronous systems with an unspecified component ⋮ An abstract framework for choreographic testing ⋮ Unnamed Item ⋮ A fully abstract may testing semantics for concurrent objects ⋮ The complexity of asynchronous model based testing ⋮ Contract-based discovery of Web services modulo simple orchestrators ⋮ Full Abstraction for Linda ⋮ A centralized and a decentralized method to automatically derive choreography-conforming web service systems ⋮ A Chart Semantics for the Pi-Calculus

Uses Software

• Linda

Cites Work

• Unnamed Item
• Unnamed Item
• A process algebraic view of input/output automata
• A process algebraic view of Linda coordination primitives
• A calculus of mobile processes. II
• On bisimulations for the asynchronous \(\pi\)-calculus
• A calculus for cryptographic protocols: The spi calculus
• Testing equivalences for processes
• Linda-based applicative and imperative process algebras
• A proof of the Kahn principle for input/output automata
• Testing equivalence for mobile processes
• Process algebra for synchronous communication
• The Semantics of Call-By-Value and Call-By-Name in a Nondeterministic Environment
• A foundation for actor computation
• Generative communication in Linda
• Bisimulations in the join-calculus
• First-order axioms for asynchrony

This page was built for publication: Trace and testing equivalence on asynchronous processes