State Identification and Verification with Satisfaction

Joshua Moerman*, Thorsten Wißmann

*Corresponding author for this work

Research output: Chapter in Book/Report/Conference proceedingChapterAcademicpeer-review

Abstract

We use SAT-solving to construct adaptive distinguishing sequences and unique input/output sequences for finite state machines in the flavour of Mealy machines. These sequences solve the state identification and state verification problems respectively. Preliminary experiments evaluate our implementation and show that this approach via SAT-solving works well and is able to find many short sequences.
Original languageEnglish
Title of host publicationA Journey from Process Algebra via Timed Automata to Model Learning
Subtitle of host publicationEssays Dedicated to Frits Vaandrager on the Occasion of His 60th Birthday
Editors Nils Jansen, Mariëlle Stoelinga, Petra van den Bos
PublisherSpringer
Pages450-466
Number of pages17
Volume13560
Edition1
ISBN (Electronic)978-3-031-15629-8
ISBN (Print)978-3-031-15628-1
DOIs
Publication statusPublished - 7 Sep 2022

Publication series

SeriesLecture Notes in Computer Science
Volume13560
ISSN0302-9743

Fingerprint

Dive into the research topics of 'State Identification and Verification with Satisfaction'. Together they form a unique fingerprint.

Cite this