Reasoning about finite-state switched systems

Dana Fisman*, Orna Kupferman

*Corresponding author for this work

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

5 Scopus citations

Abstract

A switched system is composed of components. The components do not interact with one another. Rather, they all interact with the same environment, which switches one of them on at each moment in time. In standard concurrency, a component restricts the environment of the other components, thus the concurrent system has fewer behaviors than its components. On the other hand, in a switched system, a component suggests an alternative to the other components, thus the switched system has richer behaviors than its components. We study finite-state switched systems, where each of the underlying components is a finite-state transducer. While the main challenge, namely compositionality, is similar in standard concurrent systems and in switched systems, the problems and solutions are different. In the verification front, we suggest and study an assume-guarantee paradigm for switched systems, and study formalisms in which satisfaction of a specification in all components imply its satisfaction in the switched system. In the synthesis front, we show that while compositional synthesis and design are undecidable, the problem of synthesizing a switching rule with which a given switched system satisfies an LTL specification is decidable.

Original languageAmerican English
Title of host publicationHardware and Software
Subtitle of host publicationVerification and Testing - 5th International Haifa Verification Conference, HVC 2009, Revised Selected Papers
Pages71-86
Number of pages16
DOIs
StatePublished - 2011
Event5th International Haifa Verification Conference on Hardware and Software: Verification and Testing, HVC 2009 - Haifa, Israel
Duration: 19 Oct 200922 Oct 2009

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume6405 LNCS
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349

Conference

Conference5th International Haifa Verification Conference on Hardware and Software: Verification and Testing, HVC 2009
Country/TerritoryIsrael
CityHaifa
Period19/10/0922/10/09

Fingerprint

Dive into the research topics of 'Reasoning about finite-state switched systems'. Together they form a unique fingerprint.

Cite this