Failure-divergence semantics and refinement of long running transactions

DOI10.1016/J.TCS.2012.04.040MaRDI QIDQ714877zbMATHOpenAlexFDO

Authors Zhenbang Chen, Ji Wang, Zhiming Liu

Publication date 11 October 2012

Published in Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.tcs.2012.04.040

zbMATH Keywords

recursionrefinementcompensationnon-determinismlivelockdeadlockfailure-divergence model

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)

Recommendations

• An Extended cCSP with Stable Failures Semantics
• Communicating Sequential Processes. The First 25 Years
• A calculus for long-running transactions.
• Transaction calculus (invited paper)
• \textsf{cJoin}: \textsf{Join} with communicating transactions

Cites work

• scientific article; zbMATH DE number 2163046 (Why is no real title available?)
• A Calculus for Orchestration of Web Services
• A calculus for long-running transactions.
• A theory of contracts for web services
• An Extended cCSP with Stable Failures Semantics
• CONCUR 2005 – Concurrency Theory
• Communicating Sequential Processes. The First 25 Years
• Coordination Models and Languages
• Foundations of Software Science and Computational Structures
• Modeling Long–Running Transactions with Communicating Hierarchical Timed Automata
• On the Expressive Power of Primitives for Compensation Handling
• On the expressive power of process interruption and compensation
• PVS embedding of cCSP semantic models and their relationship
• The Three Platonic Models of Divergence-Strict CSP
• Theoretical foundations for compensations in flow composition languages
• Tools and Algorithms for the Construction and Analysis of Systems
• Transformation of programs for fault-tolerance
• UTP Semantics for Web Services

Cited in

(5)

• Trace- and failure-based semantics for responsiveness
• A calculus for long-running transactions.
• A probabilistic BPEL-like language
• Communicating Sequential Processes. The First 25 Years
• On the expressive power of process interruption and compensation

Describes a project that uses

Uses Software

• rCOS
• COWS
• CSP-prover

This page was built for publication: Failure-divergence semantics and refinement of long running transactions

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q714877)