Covering step graph preserving failure semantics

DOI10.1007/3-540-63139-9_40MaRDI QIDQ6487379zbMATH OpenFDO

Authors François Vernadat, François Michel

Publication date 9 December 2022

Full work available at URL https://doi.org/10.1007/3-540-63139-9_40

Mathematics Subject Classification ID

Semantics in the theory of computing (68Q55) Specification and verification (program logics, model checking, etc.) (68Q60) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)

Recommendations

• Covering step graph
• scientific article; zbMATH DE number 1973993
• Partial-order methods for the verification of concurrent systems. An approach to the state-explosion problem
• scientific article; zbMATH DE number 1497783
• Applying Step Coverability Trees to Communicating Component-Based Systems

Cites work

• Covering step graph
• Specification-oriented semantics for communicating processes

Cited in

(3)

• LTL under reductions with weaker conditions than stutter invariance
• Applying Step Coverability Trees to Communicating Component-Based Systems
• Structural reductions and stutter sensitive properties

This page was built for publication: Covering step graph preserving failure semantics

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