Solving asynchronous equations

Petrenko, Alexandre; Yevtushenko, Nina

doi:10.1007/978-0-387-35394-4_15

Cited by 20 publications

(14 citation statements)

References 15 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…If the given system has "a single message in transit", (see, e.g., [16]) then the slow asynchronous product is output-deterministic and the inference method of Section 3 directly applies. If, however, several actions can concurrently be executed in the system, the product becomes output-nondeterministic.…”

Section: The Approachmentioning

confidence: 99%

Modular System Verification by Inference, Testing and Reachability Analysis

Groz

Li²,

Petrenko

et al. 2008

Testing of Software and Communicating Systems

Self Cite

View full text Add to dashboard Cite

Abstract. Verification of a modular system composed of communicating components is a difficult problem, especially when the models of the components are not available. Conventional testing techniques are not efficient in detecting erroneous interactions of components because such interactions often occur as interleavings of events that are difficult to reproduce in a modular system. The problem of detecting intermittent errors in the absence of models of components is addressed in this paper. A method to infer a controllable approximation of components through testing is elaborated. The inferred finite state models of components are used to detect intermittent errors and other compositional problems in the system through reachability analysis. The models are refined at each analysis step thus making the approach iterative.

show abstract

Section: The Approachmentioning

confidence: 99%

Modular System Verification by Inference, Testing and Reachability Analysis

Groz

Li²,

Petrenko

et al. 2008

Testing of Software and Communicating Systems

Self Cite

View full text Add to dashboard Cite

show abstract

“…In [12], the composition of FSMs is defined as follows. A system of two components includes interconnected FSMs M and N, and an environment E that submits a next external input to the system only after the system has produced an external output in response to the previous input.…”

Section: Test Generation Based On Composition Of Fsmsmentioning

confidence: 99%

“…Given the LTS L M ||L N ||L E without livelocks in the sense of [12], we determine the external projection of the LTS L M ||L N ||L E onto the external alphabets and transform the projection into an FSM, denoted M◊N, by pairing each input with a subsequent output and replacing the pair of corresponding transitions by a single transition.…”

Section: Test Generation Based On Composition Of Fsmsmentioning

confidence: 99%

Integration Testing of Components Guided by Incremental State Machine Learning

Li¹,

Groz²,

Shahbaz

Testing: Academic &Amp; Industrial Conference - Practice and Research Techniques (TAIC PART'06)

View full text Add to dashboard Cite

show abstract

“…For references on parallel equations see [8] on "asynchronous equations". In process algebra parallel equations have been solved for processes, which are described by prefix-closed regular languages, over various conformance relations [7,9,6].…”

mentioning

confidence: 99%

“…In this paper we introduce parallel equations over arbitrary languages under language containment, and propose effective procedures for regular languages and languages of FSMs. Some procedures in this paper are based on those proposed in [8] for "asynchronous equations". Solution of synchronous equations in the context of logic synthesis are surveyed in [4], Chap.…”

mentioning

confidence: 99%

Solution of parallel language equations for logic synthesis

Yevtushenko¹,

Villa²,

Brayton³

et al.

IEEE/ACM International Conference on Computer Aided Design. ICCAD 2001. IEEE/ACM Digest of Technical Papers (Cat. No.01CH37281)

View full text Add to dashboard Cite

The problem of designing a component that combined with a known part of a system, conforms to a given overall specification arises in several applications ranging from logic synthesis to the design of discrete controllers. We cast the problem as solving abstract equations over languages. Language equations can be defined with respect to several language composition operators such as synchronous composition, ¤, and parallel composition, ¥; conformity can be checked by language containment. In this paper we address parallel language equations.Parallel composition arises in the context of modeling delayinsensitive processes and their environments. The parallel composition operator models an exchange protocol by which an input is followed by an output after a finite exchange of internal signals. It abstracts a system with two components with a single message in transit, such that at each instance either the components exchange messages or one of them communicates with its environment, which submits the next external input to the system only after the system has produced an external output in response to the previous input.We study the most general solutions of the language equation ¦ § ¥ ©, and define the language operators needed to express them. Then we specialize such equations to languages associated with important classes of automata used for modeling systems, e.g., regular languages and FSM languages. In particular, for ¦ ¥ , we give algorithms for computing: the largest FSM language solution, the largest complete solution, and the largest solution whose composition with ¦ yields a complete FSM language. We solve also FSM equations under bounded parallel composition.In this paper, we give concrete algorithms for computing such solutions, and state and prove their correctness.

show abstract

Solving asynchronous equations

Cited by 20 publications

References 15 publications

Modular System Verification by Inference, Testing and Reachability Analysis

Modular System Verification by Inference, Testing and Reachability Analysis

Integration Testing of Components Guided by Incremental State Machine Learning

Solution of parallel language equations for logic synthesis

Contact Info

Product

Resources

About