Formal specification and verification

Merz, Stephan

doi:10.1145/3335772.3335780

Cited by 1 publication

(1 citation statement)

References 47 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…It may be noted that the input languages for model checkers such as SPIN are built on low‐level primitives deliberately chosen to facilitate efficient verification of finite‐state systems, but TLA

{}^{+}

harnesses the full power of Zermelo–Fraenkel set theory and is designed to model systems of any scale 41 …”

Section: Verification Using Tlc Model Checkermentioning

confidence: 99%

Formal specification and verification of a team formation protocol using TLA⁺

Niyogi,

Nath

2023

Softw Pract Exp

View full text Add to dashboard Cite

Team formation in an environment where some relevant parameters are not known in advance is a challenging problem. Communicating automata and distributed algorithms have been used to describe protocols for team formation. A high‐level specification provides a mathematical description of a protocol or a program. TLA is a formal specification language designed to provide high‐level specifications of concurrent and distributed systems. The associated model checker known as TLC is capable of model checking the TLA specifications. Recently, formal specification of a team formation protocol is given using TLA when there is a single initiator (an agent or a robot) that initiates the team formation. Using TLA, we examine the formal specification for the multiple initiator situation and demonstrate that a composition technique can yield a single monolithic specification for the multiple initiator situation from the single initiator situation specification. We have used models of varying sizes, and the TLC model checker has confirmed that the protocol's specifications meet certain desired characteristics in each case.

show abstract