Trace- and failure-based semantics for responsiveness
DOI10.1007/S00236-014-0205-YzbMATH Open1304.68033OpenAlexW1979648478MaRDI QIDQ478516FDOQ478516
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
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
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)
Cites Work
- Title not available (Why is that?)
- CONFLICTS AND FAIR TESTING
- On Communicating Finite-State Machines
- A Theory of Communicating Sequential Processes
- Synchronizability for Verification of Asynchronously Communicating Systems
- Fair testing
- A trace-based service semantics guaranteeing deadlock freedom
- A compositional specification theory for component behaviours
- Does My Service Have Partners?
- Deciding Substitutability of Services with Operating Guidelines
- 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
- Relating fair testing and accordance for service replaceability
- A foundational theory of contracts for multi-party service composition
- A type system for lock-free processes
- Basic observables for processes
- Impossible futures and determinism
- Responsiveness and stable revivals
- Compact representations and efficient algorithms for operating guidelines
- The coarsest precongruences respecting safety and liveness properties
- Operating Guidelines for Finite-State Services
- Divergence and fair testing
- Channel Properties of Asynchronously Composed Petri Nets
- Responsiveness in process calculi
Cited In (5)
Uses Software
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)
