Progressive solutions to a parallel automata equation

Authors:
Khaled El-Fakih;Nina Yevtushenko;Sergey Buffalov;Gregor V. Bochmann
Affiliations:
Department of Computer Science, American University of Sharjah, Sharjah, United Arab Emirates;Tomsk State University, Tomsk, Russia;Tomsk State University, Tomsk, Russia;School of Information Technology and Engineering, University of Ottawa, Ottawa, Ont., Canada
Venue:
Theoretical Computer Science
Year:
2006

Citing 11
Cited 3

On the supermal controllable sublanguage of a given language

SIAM Journal on Control and Optimization
Submodule construction as equation solving in CCS

Theoretical Computer Science
A formal method for synthesizing optimized protocol converters and its application to mobile data networks

Mobile Networks and Applications - Special issue: protocols for mobile environments
On the Construction of Submodule Specifications and Communication Protocols

ACM Transactions on Programming Languages and Systems (TOPLAS)
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
Solution of parallel language equations for logic synthesis

Proceedings of the 2001 IEEE/ACM international conference on Computer-aided design
Synthesis of Protocols and Protocol Converters Using the Submodule Construcion Approach

Proceedings of the IFIP TC6/WG6.1 Thirteenth International Symposium on Protocol Specification, Testing and Verification XIII
Solving Asynchronous Equations

FORTE XI / PSTV XVIII '98 Proceedings of the FIP TC6 WG6.1 Joint International Conference on Formal Description Techniques for Distributed Systems and Communication Protocols (FORTE XI) and Protocol Specification, Testing and Verification (PSTV XVIII)
Introduction to Automata Theory, Languages, and Computation (3rd Edition)

Introduction to Automata Theory, Languages, and Computation (3rd Edition)
Testing in context: framework and test derivation

Computer Communications

Compositionally Progressive Solutions of Synchronous FSM Equations

Discrete Event Dynamic Systems
Residual for Component Specifications

Electronic Notes in Theoretical Computer Science (ENTCS)
Progressive Solutions to FSM Equations

CIAA '08 Proceedings of the 13th international conference on Implementation and Applications of Automata

Quantified Score

Hi-index	5.23

Visualization

Abstract

In this paper, we consider the problem of deriving a component X of a system knowing the behavior of the whole system C and the other components A. The component X is derived by solving the parallel automata equation A ⋄ X ≃ C. We present an algorithm for deriving a largest progressive solution to the equation that combined with A does not block any possible action in C and we establish conditions that allow us to characterize all progressive solutions.