Failure-divergence semantics and refinement of long running transactions

DOI10.1016/j.tcs.2012.04.040zbMath1279.68202OpenAlexW2072325835MaRDI QIDQ714877

Ji Wang, Zhenbang Chen, Zhi-Ming 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)

Uses Software

• rCOS
• COWS
• CSP-prover

Cites Work

• Unnamed Item
• Transformation of programs for fault-tolerance
• A theory of contracts for web services
• On the Expressive Power of Primitives for Compensation Handling
• An Extended cCSP with Stable Failures Semantics
• UTP Semantics for Web Services
• On the expressive power of process interruption and compensation
• Modeling Long–Running Transactions with Communicating Hierarchical Timed Automata
• PVS Embedding of cCSP Semantic Models and Their Relationship
• Theoretical foundations for compensations in flow composition languages
• The Three Platonic Models of Divergence-Strict CSP
• Tools and Algorithms for the Construction and Analysis of Systems
• Foundations of Software Science and Computational Structures
• Communicating Sequential Processes. The First 25 Years
• Coordination Models and Languages
• A Calculus for Orchestration of Web Services
• CONCUR 2005 – Concurrency Theory
• Formal Methods for Open Object-Based Distributed Systems

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