Compositionally Progressive Solutions of Synchronous FSM Equations

Authors:
Nina Yevtushenko;Tiziano Villa;Robert K. Brayton;Alex Petrenko;Alberto L. Sangiovanni-Vincentelli
Affiliations:
Department of EECS, Tomsk State University, Tomsk, Russia 634050;DI (Department of Computer Science), Universita' di Verona, Verona, Italy 37134 and PARADES, Rome, Italy 00186;Department of EECS, University of California, Berkeley, USA 94720;CRIM, Montreal, Canada H3A 1B9;PARADES, Rome, Italy 00186 and Department of EECS, University of California, Berkeley, USA 94720
Venue:
Discrete Event Dynamic Systems
Year:
2008

Citing 9
Cited 2

A Survey of Petri Net Methods for Controlled Discrete EventSystems

Discrete Event Dynamic Systems
A Discrete Event Systems Approach for Protocol Conversion

Discrete Event Dynamic Systems
Bisimulation, the Supervisory Control Problem and StrongModel Matching for Finite State Machines

Discrete Event Dynamic Systems
Submodule Construction and Supervisory Control: A Generalization

CIAA '01 Revised Papers from the 6th International Conference on Implementation and Application of Automata
Secure composition of untrusted code: box π, wrappers, and causality types

Journal of Computer Security - CSFW13
Efficient Solution of Language Equations Using Partitioned Representations

Proceedings of the conference on Design, Automation and Test in Europe - Volume 1
Introduction to Automata Theory, Languages, and Computation (3rd Edition)

Introduction to Automata Theory, Languages, and Computation (3rd Edition)
Introduction to Discrete Event Systems

Introduction to Discrete Event Systems
Progressive solutions to a parallel automata equation

Theoretical Computer Science

Progressive Solutions to FSM Equations

CIAA '08 Proceedings of the 13th international conference on Implementation and Applications of Automata
Using logic to solve the submodule construction problem

Discrete Event Dynamic Systems

Quantified Score

Hi-index	0.00

Visualization

Abstract

The paper addresses the problem of designing a component that combined with a known part of a system, called the context FSM, is a reduction of a given specification FSM. We study compositionally progressive solutions of synchronous FSM equations. Such solutions, when combined with the context, do not block any input that may occur in the specification, so they are of practical use. We show that, if a synchronous FSM equation has a compositionally progressive solution, then there is a largest regular compositionally progressive solution including all of them. We provide two different algorithms to compute a largest regular compositionally progressive solution: one deletes all compositionally non-progressive strings from a largest solution, the other splits states of a largest solution and then removes those inducing a non-progressive composition.