Supervisory control of software systems

Vir V. Phoha, Amit U. Nadgar, Asok Ray, Shashi Phoha

Research output: Contribution to journalArticle

19 Citations (Scopus)

Abstract

We present a new paradigm to control software systems based on the Supervisory Control Theory (SCT). Our method uses the SCT to model the execution of a software application by restricting the actions of the OS with little or no modifications in the underlying OS. Our approach can be generalized to any software application as the interactions of the application with the OS are modeled at a process level as a Deterministic Finite State Automaton (DFSA) termed as a "plant." A "supervisor" that controls the plant is a DFSA synthesized from a set of control specifications. The supervisor operates synchronously with the plant to restrict the language accepted by the plant to satisfy the control specifications. Using the above method of control to mitigate faults, as a proof-of-concept, we implement two supervisors under the Redhat Linux 7.2 OS to mitigate overflow and segmentation faults in five different programs. We quantify the performance of the unsupervised and supervised plant by using a Language Measure and give methods to compute the measure using state transition cost matrix and characteristic vector.

Original languageEnglish (US)
Pages (from-to)1187-1199
Number of pages13
JournalIEEE Transactions on Computers
Volume53
Issue number9
DOIs
StatePublished - Sep 1 2004

Fingerprint

Supervisory Control
Software System
Supervisory personnel
Finite State Automata
Control Theory
Finite automata
Fault
Control theory
Application programs
Specification
Control Software
Software
Overflow
Specifications
Linux
State Transition
Quantify
Segmentation
Paradigm
Control System

All Science Journal Classification (ASJC) codes

  • Software
  • Theoretical Computer Science
  • Hardware and Architecture
  • Computational Theory and Mathematics

Cite this

Phoha, Vir V. ; Nadgar, Amit U. ; Ray, Asok ; Phoha, Shashi. / Supervisory control of software systems. In: IEEE Transactions on Computers. 2004 ; Vol. 53, No. 9. pp. 1187-1199.
@article{a41dd1e8a13e4c7b808b0f68ea4319be,
title = "Supervisory control of software systems",
abstract = "We present a new paradigm to control software systems based on the Supervisory Control Theory (SCT). Our method uses the SCT to model the execution of a software application by restricting the actions of the OS with little or no modifications in the underlying OS. Our approach can be generalized to any software application as the interactions of the application with the OS are modeled at a process level as a Deterministic Finite State Automaton (DFSA) termed as a {"}plant.{"} A {"}supervisor{"} that controls the plant is a DFSA synthesized from a set of control specifications. The supervisor operates synchronously with the plant to restrict the language accepted by the plant to satisfy the control specifications. Using the above method of control to mitigate faults, as a proof-of-concept, we implement two supervisors under the Redhat Linux 7.2 OS to mitigate overflow and segmentation faults in five different programs. We quantify the performance of the unsupervised and supervised plant by using a Language Measure and give methods to compute the measure using state transition cost matrix and characteristic vector.",
author = "Phoha, {Vir V.} and Nadgar, {Amit U.} and Asok Ray and Shashi Phoha",
year = "2004",
month = "9",
day = "1",
doi = "10.1109/TC.2004.67",
language = "English (US)",
volume = "53",
pages = "1187--1199",
journal = "IEEE Transactions on Computers",
issn = "0018-9340",
publisher = "IEEE Computer Society",
number = "9",

}

Supervisory control of software systems. / Phoha, Vir V.; Nadgar, Amit U.; Ray, Asok; Phoha, Shashi.

In: IEEE Transactions on Computers, Vol. 53, No. 9, 01.09.2004, p. 1187-1199.

Research output: Contribution to journalArticle

TY - JOUR

T1 - Supervisory control of software systems

AU - Phoha, Vir V.

AU - Nadgar, Amit U.

AU - Ray, Asok

AU - Phoha, Shashi

PY - 2004/9/1

Y1 - 2004/9/1

N2 - We present a new paradigm to control software systems based on the Supervisory Control Theory (SCT). Our method uses the SCT to model the execution of a software application by restricting the actions of the OS with little or no modifications in the underlying OS. Our approach can be generalized to any software application as the interactions of the application with the OS are modeled at a process level as a Deterministic Finite State Automaton (DFSA) termed as a "plant." A "supervisor" that controls the plant is a DFSA synthesized from a set of control specifications. The supervisor operates synchronously with the plant to restrict the language accepted by the plant to satisfy the control specifications. Using the above method of control to mitigate faults, as a proof-of-concept, we implement two supervisors under the Redhat Linux 7.2 OS to mitigate overflow and segmentation faults in five different programs. We quantify the performance of the unsupervised and supervised plant by using a Language Measure and give methods to compute the measure using state transition cost matrix and characteristic vector.

AB - We present a new paradigm to control software systems based on the Supervisory Control Theory (SCT). Our method uses the SCT to model the execution of a software application by restricting the actions of the OS with little or no modifications in the underlying OS. Our approach can be generalized to any software application as the interactions of the application with the OS are modeled at a process level as a Deterministic Finite State Automaton (DFSA) termed as a "plant." A "supervisor" that controls the plant is a DFSA synthesized from a set of control specifications. The supervisor operates synchronously with the plant to restrict the language accepted by the plant to satisfy the control specifications. Using the above method of control to mitigate faults, as a proof-of-concept, we implement two supervisors under the Redhat Linux 7.2 OS to mitigate overflow and segmentation faults in five different programs. We quantify the performance of the unsupervised and supervised plant by using a Language Measure and give methods to compute the measure using state transition cost matrix and characteristic vector.

UR - http://www.scopus.com/inward/record.url?scp=4644274042&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=4644274042&partnerID=8YFLogxK

U2 - 10.1109/TC.2004.67

DO - 10.1109/TC.2004.67

M3 - Article

VL - 53

SP - 1187

EP - 1199

JO - IEEE Transactions on Computers

JF - IEEE Transactions on Computers

SN - 0018-9340

IS - 9

ER -