A trace semantics for long-running transactions

DOI10.1007/11423348_8MaRDI QIDQ5709384zbMATH OpenOpenAlexFDO

Authors Michael J. Butler, C. A. R. Hoare, Carla Ferreira

Publication date 29 November 2005

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/b136154, https://eprints.soton.ac.uk/260080/1/comptraces.pdf

Mathematics Subject Classification ID

Semantics in the theory of computing (68Q55) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)

Recommendations

• Failure-divergence semantics and refinement of long running transactions
• Design and verification of long-running transactions in a timed framework
• Trace-oriented models of concurrency
• Abstract interpretation of trace semantics for concurrent calculi
• Fundamental Approaches to Software Engineering
• High-level small-step operational semantics for transactions
• A trace semantics for Petri nets

Cited in

(29)

• A formal approach to the engineering of domain-specific distributed systems
• True concurrency in long-running transactions for digital ecosystems
• Biological transactions for quantitative models
• Recovery within long-running transactions
• A new strategy for distributed compensations with interruption in long-running transactions
• High-level small-step operational semantics for transactions
• Event-Based Service Coordination
• Algebraic Semantics for Compensable Transactions
• Compensable Programs
• Transaction calculus (invited paper)
• Challenges in the Specification of Full Contracts
• Exploring the Connection of Choreography and Orchestration with Exception Handling and Finalization/Compensation
• On the expressive power of process interruption and compensation
• Flexible specification of interoperable transactions
• On the analysis of compensation correctness
• scientific article; zbMATH DE number 1438576 (Why is no real title available?)
• An empirical comparison of formalisms for modelling and analysis of dynamic reconfiguration of dependable systems
• Fundamental Approaches to Software Engineering
• Verifying Compensating Transactions
• The Conversation Calculus: A Model of Service-Oriented Computation
• An Observational Model for Transactional Calculus of Services Orchestration
• Security in a model for long-running transactions
• \textsf{cJoin}: \textsf{Join} with communicating transactions
• A calculus for long-running transactions.
• An accessible verification environment for UML models of services
• Failure-divergence semantics and refinement of long running transactions
• Compensation by design
• Service oriented computing from a process algebraic perspective
• Design and verification of long-running transactions in a timed framework

This page was built for publication: A trace semantics for long-running transactions

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