J. Meseguer, K. Futatsugi, and T. Winkler. Using rewriting logic to specify, program, integrate, and reuse open concurrent systems of cooperating agents. In Proceedings of the 1992 International Symposium on New Models for Software Architecture, November 1992, pages 61--106, 1992.  Home/Search   Document Not in Database   Summary   Related Articles   Check

....0 PnL ff Gamma P 0 nL ff 62 L [ L Definition: P ff Gamma P 0 I ff Gamma P 0 I = def P We now show how CCS can be described and given semantics in rewriting logic. The following modules have been motivated by, but are considerably different from, the corresponding examples in [78]. fth LABEL is sort Label . ordinary actions op : Label Label . var N : Label . eq N = N . endft an action is the silent action or a label fmod ACTION[X : LABEL] is sort Act . subsort Label Act . op tau : Act . silent action endfm fth PROCESSID is sort ProcessId . ....

J. Meseguer, K. Futatsugi, and T. Winkler, Using rewriting logic to specify, program, integrate, and reuse open concurrent systems of cooperating agents, in: Proc. IMSA'92, Int. Symp. on New Models for Software Architecture, Tokyo, 1992.

....computation. Refinement is the process of moving from one specification to another, more concrete, specification which displays the same behaviour. In this paper we investigate what this process is when we deal with rewrite specifications. 1 Introduction Rewriting logic (RWL) Mes92, Mes93, MFW92] differs from the standard logics, as first or higher order logics, by the fact that it is a logic of change whose models are concurrent systems, and whose deduction is concurrent computation in such systems. A concurrent system as model of the rewriting logic is formalized as a category ....

J. Meseguer, K. Futatsugi, and T. Winkler. Using rewriting logic to specify, program, integrate, and reuse open concurrent systems of cooperating agents. In IMSA'92 Intl. Symp. on New Models for Software Architecture. 1992.

No context found.

J. Meseguer, K. Futatsugi, and T. Winkler. Using rewriting logic to specify, program, integrate, and reuse open concurrent systems of cooperating agents. In Proceedings of the 1992 International Symposium on New Models for Software Architecture, November 1992, pages 61--106, 1992.

....with a partition R = Reaction ] Heating ] Cooling ] AirlockAx : The rules in R are subject to certain syntactic restrictions that guarantee an efficient form of matching modulo ACI . See [115] for some more discussion. 3. 6 CCS, LOTOS and the Calculus Kokichi Futatsugi, Timothy Winkler and I [121], and in a different later version Narciso Mart i Oliet and I [105] have shown two different ways in which Milner s CCS can be naturally represented in rewriting logic. One representation essentially treats the transitions as rewrite rules, with some syntactic care to record in the term the ....

....is a natural generalization of the 2 category models of rewriting logic has been proposed by Gadducci and Montanari [60] and is discussed in Section 3.13. LOTOS [72] is a specification language combining the two formalisms of algebraic data types and (an extension of) CCS. It is pointed out in [121] that writing an executable specification of LOTOS in rewriting logic that could be used as a LOTOS interpreter is both very natural and straightforward. In fact, an interpreter of this kind has been written by Futatsugi and his collaborators with very good results [137] The point is that the ....

[Article contains additional citation context not shown here]

J. Meseguer, K. Futatsugi, and T. Winkler. Using rewriting logic to specify, program, integrate, and reuse open concurrent systems of cooperating agents. In Proceedings of the

....reify translations between two di erent languages or logics L and L 0 as functions from Module L to Module L 0 . Rewriting logic de nitions of several languages have been given by di erent authors: lambda calculus and mini ML [24,25] Prolog and narrowing languages like BABEL [36] CCS (see [33,25], the work of Bruni and Clavel [8,6] and the tile rewrite rules in [20] the calculus [35] and sketches of UNITY [29] and Gamma [30] Similarly, many di erent logics have been shown to have a very natural conservative representation in rewriting logic [25] The point is that all such ....

J. Meseguer, K. Futatsugi, and T. Winkler. Using rewriting logic to specify, program, integrate, and reuse open concurrent systems of cooperating agents. In Proceedings of the

.... 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 ....

Jos'e Meseguer, Kokichi Futatsugi, and Timothy Winkler. Using rewriting logic to specify, program, integrate, and reuse open concurrent systems of cooperating agents. In Proceedings of the

....Our group wide architecture is based on the Actor model. All reflective operations are performed solely via y 15 Asahidai, Tatsunokuchi, Ishikawa 923 12, Japan. message sends, which are interpreted at the metalevel concurrently with interpretations of actors in the baselevel. Rewriting logic[4, 6, 7] can represent dynamic behaviors of concurrent and or reactive systems declaratively. Declarative descriptions in rewriting logic are expected to be amenable to analysis of interesting properties. In this paper, we propose some basic considerations on methods of modeling the groupwide reflection ....

....for S . Therefore, the causal connection between S and S is automatically guaranteed. In this way, it becomes clear that S is also an actor system, then a special configuration of S is called a meta configuration. 1. 4 Rewriting logic First, we introduce the definition of rewriting logic [4, 6, 7]. Definition 1 A (labelled) rewriting theory R is a 4 tuple R = 6; E ; L; R) where 6 is a ranked alphabet of function symbols, E is a set of 6 equations, L is a set of labels, and R is a set of pairs R ae L 2 (T6;E (X ) 2 whose first component is a label and whose second component is a pair ....

Jos'e Meseguer, Kokichi Futatsugi, and Timothy Winkler. Using Rewriting Logic to Specify, Program, Integrate, and Reuse Open Concurrent Systems of Cooperating Agents. Technical Report SRI-CSL-92-11, Computer Science Laboratory, SRI International, 1992.

No context found.

Jos'e Meseguer, Kokichi Futatsugi, and Timothy Winkler. (1992) Using Rewriting Logic to Specify, Program, Integrate, and Reuse Open Concurrent Systems of Cooperating Agents. Technical Report SRI-CSL-92-11, Computer Science Laboratory, SRI International.

....of search. This ongoing work helps motivate continued exploration of ideas of Mobile Maude, and the strategies to control this kind of distributed computing engine. Rewriting logic definitions of several languages have been developed experimentally: lambda calculus and (mini ) ML [20, 22] CCS [28, 22, 5, 4, 15] Tile Logic [15] the calculus [31] and sketches of UNITY [25] and Gamma [27] Since Maude is efficiently executable, such language definitions in Maude may be considered to be interpreters for these programming languages, and Maude s strategy language enables reasoning about arbitrarily ....

J. Meseguer, K. Futatsugi, and T. Winkler. Using rewriting logic to specify, program, integrate, and reuse open concurrent systems of cooperating agents. In Proceedings of the 1992 International Symposium on New Models for Software Architecture, Tokyo, Japan, November 1992, pages 61--106. Research Institute of Software Engineering, 1992.

No context found.

J. Meseguer, K. Futatsugi, and T. Winkler. Using rewriting logic to specify, program, integrate, and reuse open concurrent systems of cooperating agents. In Proceedings of the 1992.

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