Trace- and failure-based semantics for responsiveness

DOI10.1007/S00236-014-0205-YMaRDI QIDQ478516zbMATHOpenAlexFDO

Authors Yong-Cai Geng, Sumit K. Garg

Publication date 3 December 2014

Published in Acta Informatica (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/s00236-014-0205-y

Mathematics Subject Classification ID

Mathematical aspects of software engineering (specification, verification, metrics, requirements, etc.) (68N30) Semantics in the theory of computing (68Q55) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)

Recommendations

• Failure trace semantics for a process algebra with time-outs
• Trace, failure and testing equivalences for communicating processes
• scientific article; zbMATH DE number 2038703
• Advances in Computing Science – ASIAN 2003. Progamming Languages and Distributed Computation Programming Languages and Distributed Computation
• Revisiting Semantics of Interactions for Trace Validity Analysis
• Failure-aware runtime verification of distributed systems
• Failure-divergence semantics and refinement of long running transactions
• Compositional failure-based semantic models for basic LOTOS
• Automata, Languages and Programming

Cites work

• scientific article; zbMATH DE number 42752 (Why is no real title available?)
• A Theory of Communicating Sequential Processes
• A compositional specification theory for component behaviours
• A foundational theory of contracts for multi-party service composition
• A trace-based service semantics guaranteeing deadlock freedom
• A type system for lock-free processes
• An algebraic theory of interface automata
• Basic observables for processes
• CONFLICTS AND FAIR TESTING
• Channel Properties of Asynchronously Composed Petri Nets
• Compact representations and efficient algorithms for operating guidelines
• Deciding Substitutability of Services with Operating Guidelines
• Divergence and fair testing
• Does My Service Have Partners?
• Fair testing
• Impossible futures and determinism
• Modular construction and partial order semantics of Petri nets
• On Communicating Finite-State Machines
• Operating Guidelines for Finite-State Services
• Relating fair testing and accordance for service replaceability
• Responsiveness and stable revivals
• Responsiveness in process calculi
• Synchronizability for Verification of Asynchronously Communicating Systems
• The coarsest precongruences respecting safety and liveness properties
• Trace- and failure-based semantics for responsiveness
• Undecidability of accordance for open systems with unbounded message queues

Cited in

(5)

• Trace- and failure-based semantics for responsiveness
• Machine-verifiable responsiveness
• Undecidability of accordance for open systems with unbounded message queues
• A trace-based service semantics guaranteeing deadlock freedom
• Observable liveness of Petri nets

Describes a project that uses

Uses Software

• BPEL2oWFN

This page was built for publication: Trace- and failure-based semantics for responsiveness

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