Stubborn Sets, Frozen Actions, and Fair Testing

DOI10.3233/FI-2021-2001zbMath1478.68182WikidataQ109299326 ScholiaQ109299326MaRDI QIDQ4989170

Antti Valmari, Walter Vogler

Publication date: 21 May 2021

Published in: Fundamenta Informaticae (Search for Journal in Brave)

zbMATH Keywords

safety propertiespartial-order methodsstubborn setsignoring problemfair testing

Mathematics Subject Classification ID

Combinatorics of partially ordered sets (06A07) Specification and verification (program logics, model checking, etc.) (68Q60) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)

Uses Software

• SPIN

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Path-based depth-first search for strong and biconnected components
• Modular construction and partial order semantics of Petri nets
• Fair testing
• On computing the transitive closure of a relation
• Stubborn sets with frozen actions
• More stubborn set methods for process algebras
• Partial-order methods for the verification of concurrent systems. An approach to the state-explosion problem
• The inconsistent labelling problem of stutter-preserving partial-order reduction
• Computer aided verification. 31st international conference, CAV 2019, New York City, NY, USA, July 15--18, 2019. Proceedings. Part II
• Fair Testing and Stubborn Sets
• Depth-First Search and Linear Graph Algorithms

This page was built for publication: Stubborn Sets, Frozen Actions, and Fair Testing