Failure-divergence semantics and refinement of long running transactions
DOI10.1016/J.TCS.2012.04.040zbMATH Open1279.68202OpenAlexW2072325835MaRDI QIDQ714877FDOQ714877
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
Recommendations
Specification and verification (program logics, model checking, etc.) (68Q60) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)
Cites Work
- A Calculus for Orchestration of Web Services
- Tools and Algorithms for the Construction and Analysis of Systems
- A theory of contracts for web services
- Modeling Long–Running Transactions with Communicating Hierarchical Timed Automata
- On the Expressive Power of Primitives for Compensation Handling
- Title not available (Why is that?)
- Theoretical foundations for compensations in flow composition languages
- Foundations of Software Science and Computational Structures
- Communicating Sequential Processes. The First 25 Years
- Coordination Models and Languages
- CONCUR 2005 – Concurrency Theory
- A calculus for long-running transactions.
- The Three Platonic Models of Divergence-Strict CSP
- Transformation of programs for fault-tolerance
- An Extended cCSP with Stable Failures Semantics
- UTP Semantics for Web Services
- On the expressive power of process interruption and compensation
- PVS embedding of cCSP semantic models and their relationship
Cited In (5)
Uses Software
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)
