M. Clavel, F. Duran, S. Eker, P. Lincoln, N. Mart-Oliet, J. Meseguer, and J. Quesada. Towards maude 2.0. In K. Futatsugi, editor, Electronic Notes in Theoretical Computer Science, volume 36. Elsevier, 2001.  Home/Search   Document Details and Download   Summary   Related Articles   Check

No context found.

M. Clavel, F. Duran, S. Eker, P. Lincoln, N. Mart-Oliet, J. Meseguer, and J. Quesada. Towards maude 2.0. In K. Futatsugi, editor, Electronic Notes in Theoretical Computer Science, volume 36. Elsevier, 2001.

No context found.

S. Eker P. Lincoln N. Mart-Oliet J. Meseguer M. Clavel, F. Duran and J.F. Quesada. Towards Maude 2.0. In 3rd International Workshop on Rewriting Logic and its Applications (WRLA'00), volume 36 of Electronic Notes in Theoretical Computer Science. Elsevier, 2000.

No context found.

M. Clavel, F. Duran, S. Eker, P. Lincoln, N. Mart-Oliet, J. Meseguer, and J. F. Quesada. Towards Maude 2.0. In K. Futatsugi, editor, Proceedings Third International Workshop on Rewriting Logic and its Applications, WRLA 2000.

No context found.

M. Clavel, F. Durn, S. Eker, P. Lincoln, N. Mart-Oliet, J. Meseguer, and J. F. Quesada. Towards Maude 2.0. In K. Futatsugi, editor, Proceedings Third International Workshop on Rewriting Logic and its Applications, WRLA 2000.

....models themselves. The idea of symbolic biological experiments opens up an exciting new world of challenging applications for formal methods in general and for rewriting logic based formalisms in particular. 1 Introduction In this paper we describe the use of the rewriting logic based Maude tool [7,6] to model and analyze mammalian signaling pathways. A preliminary report on this work appeared in [16] Here we present the Maude model in more detail, and describe the use of the new search and model checking capabilities of Maude 2.0 [6] to analyze the modeled network. We also discuss the use of ....

....describe the use of the rewriting logic based Maude tool [7,6] to model and analyze mammalian signaling pathways. A preliminary report on this work appeared in [16] Here we present the Maude model in more detail, and describe the use of the new search and model checking capabilities of Maude 2. 0 [6] to analyze the modeled network. We also discuss the use of Maude s reflective capability [4] for metamodeling and analyzing the models themselves. This turns out to be quite important for managing complex models. The naturalness and relative ease (for biologists) of building and using the Maude ....

M. Clavel, F. Duran, S. Eker, P. Lincoln, N. Marti-Oliet, J. Meseguer, and J. Quesada. Towards Maude 2.0. In Third International Workshop on Rewriting Logic and Its Applications (WRLA'00), Kanazawa, Japan, September 18 --- 20, 2000.

....3. Maude s metalevel features allowed us to bridge some important gaps between theory and practice in a fully executable implementation of CCS operational semantics, and later in some bigger implementations for more complex languages. Now, the recent availability of implementations for Maude 2. 0 [7] have made it possible to reconsider the approach based on transitions as rewrites, because Maude 2.0 allows indeed conditional rules with rewrites in the conditions, where those rewrites are solved at execution time by means of a built in Di erent uses of those re ective capabilities in yet ....

....rewrite rules. 4.1 Maude 2.0 Maude 2. 0 is the new version of Maude, whose key features are: greater generality and expressiveness; ecient support for a wider range of programming applications; and usability as a key component for developing internet programming and mobile computing systems [7]. We brie y summarize here the new features used in the following sections. Rewrite rules can take the most general possible form in the variant of rewriting logic built on top of membership equational logic. That is, they can be of the form t t if ( i u i = v i ) j w j : s j ) ....

[Article contains additional citation context not shown here]

M. Clavel, F. Duran, S. Eker, P. Lincoln, N. Mart-Oliet, J. Meseguer, and J. F. Quesada. Towards Maude 2.0. In K. Futatsugi, editor, Proceedings Third International Workshop on Rewriting Logic and its Applications, WRLA 2000.

....axioms in E C S are terminating, equational axioms in E C S are sort decreasing and satisfy the regularity condition. For formal details of 1 In its most recent version Maude imposes an even weaker restriction for executability due to the admissibility of conditions with matching equations [20]. these conditions we refer to [9] In particular, these conditions imply that each term M has a unique normal form w.r.t. which is denoted by NF(M ) 2.2 Rewriting Logic In the simpli ed setting of [48] a rewrite speci cation R consists of a singlesorted signature R , a set ER of equations ....

....t ; u t ] 2. Each place p has a duration d p . A token at place p cannot participate in a transition until it has been at p for at least time d p . 11 A more general transformation is possible if we use conditions with matching equations, a feature supported by the most recent version of Maude [20]. 3. Each transition t is associated with a time interval [l t ; u t ] and the transition t cannot re before it has been continuously enabled for at least time l t . Also, the transition t cannot have been enabled continuously for more than time u t without being taken. We will not treat the ....

M. Clavel, F. Duran, S. Eker, P. Lincoln, N. Mart-Oliet, J. Meseguer, and J. Quesada. Towards Maude 2.0. In K. Futatsugi, editor, Third International Workshop on Rewriting Logic and its Applications (WRLA'

....i; where R, t, and t 0 are terms representing, respectively, R, t, and t 0 as data elements of U . Maude s design and implementation [7] systematically exploits the re ective capabilities of rewriting logic, providing key features of the universal theory U in its built in module META LEVEL [8]. In particular, META LEVEL has sorts 5 Term and Module, so that the representations of a term t and of a module R are, respectively, a term t of sort Term and a term R of sort Module. For example, the basic cases in the representation of terms are obtained by subsorts Constant and Variable of ....

....metarepresented as [ 0.Nat, s [ 0. Nat] The module META LEVEL also provides key metalevel functions for rewriting and evaluating terms at the metalevel, namely, meta apply, meta reduce, and meta rewrite, and also generic parsing and pretty printing functions meta parse and meta pretty print [7,8]. Re ection, together with the good properties of rewriting logic as a logical framework [36,40] make it quite easy to develop formal tools in Maude for any logic L of interest, including as in the case of Full Maude s module algebra rewriting logic itself. Suppose, for example, that we want to ....

M. Clavel, F. Duran, S. Eker, P. Lincoln, N. Mart-Oliet, J. Meseguer, and J. Quesada. Towards Maude 2.0. In K. Futatsugi, editor, Proceedings of 3rd International Workshop on Rewriting Logic and its Applications (WRLA'00), volume 36 of Electronic Notes in Theoretical Computer Science. Elsevier, 2000.

....by the Maude proxies, which build the Maude responses from them. The communication between the Maude proxies and the SOAP objects they represent is done by using SOAP over HTTP (proxies can be seen as clients of their SOAP implementations) making use of the TCP features available in Maude 2. 0 [5]. Thus, clients can continue interoperating with their servers, no matter whether they are Maude objects or their SOAP implementations. As an example of this, Figure 2 shows a transition by which a Maude specification of an object is replaced by its SOAP implementation in a transparent way to ....

....interact with it. Therefore, we need a proxy of the calculator in the Maude world, which is given in the module CALCULATOR PROXY below. In it, TCPHandler is the Maude module providing TCP communication, with messages sendTCP and receivedTCP for sending and receiving messages, respectively (see [5]) Note that in addition to the predefined System object s reference and the sender and addressee objects references, the HTTP message to be sent by TCP itself is given as a string. Note also that we give the rules for the messages related to the plus method only. There are similar rules for ....

M. Clavel, F. Durn, S. Eker, P. Lincoln, N. Mart-Oliet, J. Meseguer, and J. Quesada. Towards Maude 2.0. In K. Futatsugi, editor, Proceedings of 3rd International Workshop on Rewriting Logic and its Applications (WRLA'00), volume 36 of Electronic Notes in Theoretical Computer Science. Elsevier, 2000.

....and then passes it back to the first proxy, which builds the final reply from it. Communication between objects and proxies is by using the natural communication mechanisms available in each world, and communication between proxies is implemented via TCP, using the features available in Maude 2. 0 [4]. Figure 1 shows a gradual transition from a Maude specification into a running CORBA system. The three Maude components in the left are replaced by their corresponding implementations step by step. All objects are of course unaware of the replacement process, since we use proxies that substitute ....

M. Clavel, F. Duran, S. Eker, P. Lincoln, N. Mart-Oliet, J. Meseguer, and J. Quesada. Towards Maude 2.0. In K. Futatsugi, editor, Proceedings of 3rd International Workshop on Rewriting Logic and its Applications (WRLA'00), volume 36 of Electronic Notes in Theoretical Computer Science. Elsevier, 2000.

No context found.

M. Clavel, F. Duran, S. Eker, P. Lincoln, N. Marti-Oliet, J. Meseguer, and J.F. Quesada. Towards Maude 2.0. In Proceedings of WRLA'01, volume 36 of ENTCS.

No context found.

M. Clavel, F. Duran, S. Eker, P. Lincoln, N. Mart-Oliet, J. Meseguer, and J. F. Quesada. Towards Maude 2.0. In 3rd International Workshop on Rewriting Logic and its Applications (WRLA'00), volume 36 of Electronic Notes in Theoretical Computer Science. Elsevier, 2000. 17

No context found.

M. Clavel, F. Duran, S. Eker, P. Lincoln, N. Mart-Oliet, J. Meseguer, and J.F. Quesada. Towards Maude 2.0. In K. Futatsugi, editor, WRLA2000, the 3rd International Workshop on Rewriting Logic and its Applications, September 2000, Kanazawa, Japon. Electronic Notes in Theoretical Computer Science, 2000.

Online articles have much greater impact   More about CiteSeer.IST   Add search form to your site   Submit documents   Feedback  

CiteSeer.IST - Copyright Penn State and NEC