Facilitating the Transformation of State Machines from Equations into Rewrite Rules
نویسندگان
چکیده
The multiplicity of formalisms and corresponding verification systems makes the transformation useful for interoperations among them. We have proposed an approach to the transformation of state machines from a syntax-constrained class of equational theories into rewrite theories, which can be verified by Maude’s model checking facilities. However, the efficiency of model checking generated rewrite theories varies, depending on the forms of original equational theories. This paper serves as a practical guide for developing equational theories to facilitate the transformation, aiming at generating efficiently model-checkable rewrite theories. Three case studies are conducted, and experimental results show that the efficiency is significantly improved.
منابع مشابه
An Invariant-preserved Transformation of State Machines from Equations into Rewrite Rules
We present an approach to the transformation of state machines from a restricted subclass of equational theories into rewrite theories, and show the transformation preserves invariant properties. Invariantpreservation of the transformation guarantees that a counterexample that is found to an invariant by model checking a generated rewrite theory is also the counterexample to the corresponding i...
متن کاملCentrum Voor Wiskunde En Informatica within Arm's Reach: Compilation of Left-linear Rewrite Systems via Minimal Rewrite Systems within Arm's Reach: Compilation of Left-linear Rewrite Systems via Minimal Rewrite Systems
A new compilation technique for left-linear term rewriting systems is presented, where rewrite rules are transformed into so-called minimal rewrite rules. These minimal rules have such a simple form that they can be viewed as instructions for an abstract rewriting machine (ARM). Keywords and Phrases: minimal term rewriting systems, abstract machines, program transformations Note: Part of this w...
متن کاملAn Efficient Compiler for Weighted Rewrite Rules
Context-dependent rewrite rules are used in many areas of natural language and speech processing. Work in computational phonology has demonstrated that, given certain conditions, such rewrite rules can be represented as finite-state transducers (FSTs). We describe a new algorithm for compiling rewrite rules into FSTs. We show the algorithm to be simpler and more efficient than existing algorith...
متن کاملAn E cient Compiler for Weighted Rewrite Rules
Context-dependent rewrite rules are used in many areas of natural language and speech processing. Work in computational phonology has demonstrated that, given certain conditions, such rewrite rules can be represented as nite-state transducers (FSTs). We describe a new algorithm for compiling rewrite rules into FSTs. We show the algorithm to be simpler and more eecient than existing algorithms. ...
متن کاملMulti-Tiered Nonlinear Morphology Using Multi-Tape Finite Automata: A Case Study on Syriac and Arabic
This paper presents a computational model for nonlinear morphology with illustrations from Syriac and Arabic. The model is a multitiered one in that it allows for multiple lexical representations corresponding to the multiple tiers of autosegmental phonology. The model consists of three main components: (i) a lexicon, which is made of sublexica, with each sublexicon representing lexical materia...
متن کامل