A. Verdejo and N. Mart-Oliet. Implementing CCS in Maude 2. In Fabio Gadducci and Ugo Montanari, editors, Proceeding Fourth Int. Workshop on Rewriting Logic and its Applications, WRLA 2002.  Home/Search   Document Details and Download   Summary   Related Articles   Check

....and partial functions; all this is further explained in Section 1.2. We can illustrate the importance of generalizing along dimensions 2 and 3 with an example showing that, in essence, this brings RL and structural operational semantics (whose strong relationship had already been emphasized in [5,7,8]) closer than ever before. Consider for example a reactive process calculus with a nondeterministic choice operator specified by SOS rules of the form, P P P Q P 0 left choice Q Q P Q Q 0 right choice The corresponding rewrite theory R will then have two conditional rules, like ....

N. Mart-Oliet and A. Verdejo. Implementing CCS in Maude 2. Proc. WRLA'02, ENTCS 71. Elsevier, 2002.

....for each (m; l; m ) 2 T . Rewriting logic can naturally model many di erent kinds of concurrent systems. We have, for example, seen that Petri nets can be naturally formalized as rewrite theories. The same is true for many other 26 models of concurrency [33, 36] including, for example, CCS [44], the calculus [42] real time models [40] and so on. One of the most useful and important classes of concurrent systems is that of concurrent object systems, made out of concurrent objects which encapsulate their own local state and can interact with other objects in a variety of ways, ....

A. Verdejo and N. Mart-Oliet. Implementing CCS in Maude 2. In F. Gadducci and U. Montanari, editors, Proc. 4th. Intl. Workshop on Rewriting Logic and its Applications. ENTCS, Elsevier, 2002.

No context found.

A. Verdejo and N. Mart-Oliet. Implementing CCS in Maude. In T. Bolognesi and D. Latella, editors, Formal Methods For Distributed System Development. FORTE/PSTV 2000, pages 351--366. Kluwer Academic Publishers, 2000.

No context found.

A. Verdejo and N. Mart-Oliet. Implementing CCS in Maude 2. In Gadducci and Montanari [33], pages 239--257.

No context found.

A. Verdejo and N. Mart-Oliet. Implementing CCS in Maude. In T. Bolognesi and D. Latella, editors, Formal Methods For Distributed System Development. FORTE/PSTV 2000.

No context found.

A. Verdejo and N. Mart-Oliet. Implementing CCS in Maude 2. In F. Gadducci and U. Montanari, editors, Proceedings Fourth International Workshop on Rewriting Logic and its Applications, WRLA 2002.

No context found.

A. Verdejo and N. Mart-Oliet. Implementing CCS in Maude 2. In U. Montanari, editor, Proceedings Fourth International Workshop on Rewriting Logic and its Applications, WRLA 2002.

No context found.

A. Verdejo and N. Mart-Oliet. Implementing CCS in Maude. In T. Bolognesi and D. Latella, editors, Formal Methods For Distributed System Development. FORTE/PSTV 2000.

....situation) Even in this case, a number of problems had to be solved, namely the occurrence of new variables in righthand sides of rules, and how to control the nondeterminism in the application of rules. These problems were solved by means of Maude s re ective capabilities, as described in [20] and summarized below in Section 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 ....

....context used to keep the de nitions of the process identi ers used in each CCS speci cation. 3 Transitions as judgements We summarize here the main ideas used in our rst implementation of the CCS operational semantics where transitions become judgements and inference rules become rewrites [20]. The CCS transition judgement P is represented in Maude by the term P a P of sort Judgement, and the CCS operational semantics rules are translated into rewrite rules where the representation of the conclusion is rewritten to the set of representations of the premises, as the ....

[Article contains additional citation context not shown here]

A. Verdejo and N. Mart-Oliet. Implementing CCS in Maude. In T. Bolognesi and D. Latella, editors, Formal Methods For Distributed System Development. FORTE/PSTV 2000.

....and model checking are used to explore possible execution paths, and the new descent functions are used to analyze and visualize model checking results. The ascent functions are used to transform the Maude model into a Petri net model for further analysis of possible execution paths. Work on CCS [26] and the Pi Calculus [25] provides additional examples of the usefulness of new features of Maude 2.0, especially frozen arguments, enriched rule conditions, search, and metaSearch. Search, model checking, and rewrites in rule conditions have been used in a project to model and analyze a proposed ....

A. Verdejo and N. Mart-Oliet. Implementing CCS in Maude 2. In Procs. of WRLA'02. ENTCS 71. Elsevier, 2002.

....Symbolic Semantics in Maude Alberto Verdejo Technical Report 122 02 Dpto. Sistemas Inform aticos y Programaci on Universidad Complutense de Madrid. Spain January 2002 Research supported by CICYT project Desarrollo Formal de Sistemas Basados en Agentes M oviles (TIC2000 0701 C02 01) Abstract We present a formal tool where LOTOS speci cations without restrictions in their data types can be executed. The re ective feature of rewriting logic and the metalanguage capabilities of Maude make it possible to implement the whole tool in the same semantic framework, ....

....we would like to execute that representation. That is when re ection and the module META LEVEL are at work. We will show in Sections 2.3 and 2.4 how a search strategy can be de ned and how it can be used to execute the LOTOS symbolic semantics. This part of the paper is based on previous work [18, 19] although with important modi cations to adapt it to the LOTOS semantics characteristics. But if we want to build a usable formal tool we need more. We have to build an environment for it, including not only the execution aspect just described, but parsing, pretty printing, and input output. ....

[Article contains additional citation context not shown here]

A. Verdejo and N. Mart-Oliet. Implementing CCS in Maude. In T. Bolognesi and D. Latella, editors, Formal Methods For Distributed System Development. FORTE/PSTV 2000.

.... labeled transition systems [218] 4) grammars and string rewriting systems [218] 5) Petri nets, including place transition nets, contextual nets, algebraic nets, colored nets, and timed Petri nets [218,223,293,297,268,289] 6) Gamma and the Chemical Abstract Machine [218] 7) CCS and LOTOS [230,208,314,45,89,311,309,201]; 8) the calculus [316,292] 9) concurrent objects and actors [218,220,300,302,304] 10) the UNITY language [218] 11) concurrent graph rewriting [223] 12) dataflow [223] 13) neural networks [223] 14) real time systems, including timed automata, timed transition systems, hybrid ....

.... to specify program evaluations has been clearly demonstrated in ELAN specifications, for example of Prolog and of the functional logic programming language Babel [320] and also in the Maude executable specifications for CCS developed by Bruni and Clavel [63,34] and by Verdejo and Mart i Oliet [311,310]. Thirdly, the fact that rewriting logic naturally supports concurrent objects has proved very useful in formally specifying a number of novel concurrent and mobile languages. For example, Ishikawa et al. have given a Maude specification of a representative subset of GAEA, a reflective concurrent ....

[Article contains additional citation context not shown here]

Alberto Verdejo and Narciso Mart'i-Oliet. Implementing CCS in Maude. In T. Bolognesi and D. Latella, editors, Formal Methods For Distributed System Development. FORTE/PSTV

No context found.

A. Verdejo and N. Mart-Oliet. Implementing CCS in Maude 2. In Fabio Gadducci and Ugo Montanari, editors, Proceeding Fourth Int. Workshop on Rewriting Logic and its Applications, WRLA 2002.

No context found.

A. Verdejo and N. Mart-Oliet. Implementing CCS in Maude 2. In Fabio Gadducci and Ugo Montanari, editors, Proceeding Fourth Int. Workshop on Rewriting Logic and its Applications, WRLA 2002.

No context found.

A. Verdejo and N. Mart-Oliet. Implementing CCS in Maude 2. In F. Gadducci, U. Montanari (Eds.), Proc. WRLA, Electronic Notes in Theoretical Computer Science, vol. 71, pp. 239-257, Elsevier, 2002.

No context found.

A. Verdejo, and N. Mart-Oliet. Implementing CCS in Maude 2. In 4th WRLA, Electronic Notes in Theoretical Computer Science, vol.71, Elsevier, pp. 239-257, 2002. 19

No context found.

A. Verdejo and N. Mart-Oliet. Implementing CCS in Maude 2. In Proc. 4th. WRLA. ENTCS, Elsevier, 2002.

No context found.

A. Verdejo and N. Mart-Oliet. Implementing CCS in Maude. In Formal Methods For Distributed System Development. FORTE/PSTV 2000 IFIP TC6 WG6. October 10--13, 2000, volume 183 of IFIP, pages 351--366, 2000.

No context found.

Alberto Verdejo and Narciso Mart'i-Oliet. Implementing CCS in Maude. In Tommaso Bolognesi and Diego Latella, editors, Formal Methods For Distributed System Development. FORTE/PSTV 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