✦ LIBER ✦

Automated verification of responsive protocols modeled by extended finite state machines

✍ Scribed by Yoshiaki Kakuda; Tohru Kikuno; Kenichi Kawashima

Publisher: Springer US
Year: 1994
Tongue: English
Weight: 940 KB
Volume: 7
Category: Article
ISSN: 0922-6443
DOI: 10.1007/bf01088522

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

The temporal Boolean derivative applied

The temporal Boolean derivative applied to verification of extended finite state machines

✍ E. Vandermeulen; H.A. Donegan; M. Larnac; J. Magnier 📂 Article 📅 1995 🏛 Elsevier Science 🌐 English ⚖ 544 KB

Extended finite state machines are an important feature of modern computers. Their verification, unlike sequential system testing, is very complex and has received little attention in literature. This paper suggests a model based on a symbolic representation to describe the temporal behavior of sequ

Symbolic model checking of extended fini

Symbolic model checking of extended finite state machines with linear constraints over integer variables

✍ Takashi Takenaka; Kozo Okano; Teruo Higashino; Kenichi Taniguchi 📂 Article 📅 2006 🏛 John Wiley and Sons 🌐 English ⚖ 338 KB

## Abstract We propose a symbolic model checking algorithm for a class of extended finite state machines equipped with integer variables (FSM/int). An FSM/int has several constraints on variable assignments, such as a variable of FSM/int keeps its value until the control visits at the definition tr