On combining the persistent sets method with the covering steps graph method

DOI10.1007/3-540-36135-9_22MaRDI QIDQ4422090zbMATH OpenFDO

Authors Pierre-Olivier Ribet, François Vernadat, Bernard Berthomieu

Publication date 3 September 2003

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

Full work available at URL http://link.springer.de/link/service/series/0558/bibs/2529/25290344.htm

zbMATH Keywords

Concurrent systemscovering steps graphpartial-orderpersistent setsstate space explorationverification methods

Mathematics Subject Classification ID

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

• Graph theoretic relaxations of set covering and set partitioning problems
• Steady and ranging sets in graph persistence
• A partially persistent data structure for the set-union problem
• A rough set method for the vertex cover problem in graph theory
• Approximation of set multi-cover via hypergraph matching
• scientific article; zbMATH DE number 5773533
• Sets approach algorithms for determination of component minimal complete subgraph
• scientific article; zbMATH DE number 1092952
• An optimal path cover algorithm for cographs
• Covering graphs with convex sets and partitioning graphs into convex sets

Cited in

(2)

• A persistent-set approach to abstract state-space construction in verification
• Covering step graph preserving failure semantics

This page was built for publication: On combining the persistent sets method with the covering steps graph method

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