Trace- and failure-based semantics for responsiveness

DOI10.1007/s00236-014-0205-yzbMath1304.68033OpenAlexW1979648478MaRDI QIDQ478516

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

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

Related Items (3)

Undecidability of accordance for open systems with unbounded message queues ⋮ Trace- and failure-based semantics for responsiveness ⋮ Observable liveness of Petri nets

Uses Software

• BPEL2oWFN

Cites Work

• Unnamed Item
• Unnamed Item
• Modular construction and partial order semantics of Petri nets
• An algebraic theory of interface automata
• Undecidability of accordance for open systems with unbounded message queues
• Trace- and failure-based semantics for responsiveness
• Fair testing
• Responsiveness in process calculi
• Relating fair testing and accordance for service replaceability
• Basic observables for processes
• Impossible futures and determinism
• A trace-based service semantics guaranteeing deadlock freedom
• A type system for lock-free processes
• Responsiveness and stable revivals
• Synchronizability for Verification of Asynchronously Communicating Systems
• A Compositional Specification Theory for Component Behaviours
• Compact Representations and Efficient Algorithms for Operating Guidelines
• The Coarsest Precongruences Respecting Safety and Liveness Properties
• Operating Guidelines for Finite-State Services
• Does My Service Have Partners?
• Deciding Substitutability of Services with Operating Guidelines
• On Communicating Finite-State Machines
• A Theory of Communicating Sequential Processes
• Divergence and fair testing
• Channel Properties of Asynchronously Composed Petri Nets
• CONFLICTS AND FAIR TESTING

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