The automatic detection of token structures and invariants using SAT checking
Many distributed systems rely on token structures for their correct operation. Often, these structures make sure that a fixed number of tokens exists at all times, or perhaps that tokens cannot be completely eliminated, to prevent systems from reaching undesired states. In this paper we show how a S...
मुख्य लेखकों: | Antonino, P, Gibson-Robinson, T, Roscoe, A |
---|---|
स्वरूप: | Conference item |
प्रकाशित: |
Springer, Berlin, Heidelberg
2017
|
समान संसाधन
-
Efficient deadlock freedom checking using local analysis and SAT checking
द्वारा: Antonio, P, और अन्य
प्रकाशित: (2016) -
Efficient verification of comcurrent systems using local analysis based approximations and SAT solving
द्वारा: Antonino, P, और अन्य
प्रकाशित: (2019) -
Efficient verification of concurrent systems using synchronisation analysis and SAT/SMT solving
द्वारा: Antonino, P, और अन्य
प्रकाशित: (2019) -
Graph-Based Token Replay for Online Conformance Checking
द्वारा: Indra Waspada, और अन्य
प्रकाशित: (2022-01-01) -
Conformance Checking of Dwelling Time Using a Token-based Method
द्वारा: Bambang Jokonowo, और अन्य
प्रकाशित: (2021-10-01)