Meseguer, J., Conditional rewriting logic as a uni ed model of concurrency, Theo. Comp. Sci. 96 (1992), pp. 73-155.  Home/Search   Document Not in Database   Summary   Related Articles   Check

....be described in other publications. We expect our process ontology to serve as the basis for specifying a wide array of services. In developing the ontology, we drew from a variety of sources, including work in AI on planning languages [8] work in programming languages and distributed systems [16, 17], emerging standards in process modeling and work ow technology such as the NIST s Process Speci cation Language (PSL) 20] and the Work ow Management Coalition e ort , work on modeling verb semantics and event structure [18] work in AI on modeling complex actions [11] work in agent ....

J. Meseguer. Conditional Rewriting Logic as a Uni ed Model of Concurrency. Theoretical Computer Science, 96(1):73-155, 1992.

....be solved by exploiting the re ective properties of rewriting logic, which allow controlling the rewriting process. This executable speci cation plus the re ective control of the rewriting process can be used to analyze CCS processes. 1. INTRODUCTION Rewriting logic was introduced by Meseguer [8] as a uni ed model of concurrency in which several well known models of concurrent systems can be represented in a common framework. This goal was further extended by Mart Oliet and Meseguer [7] to the idea of rewriting logic as a logical and semantic framework. It was shown that many other ....

....of formulas into other patterns modulo the given structural axioms. Similar techniques can be used to naturally specify and prototype many languages and systems in rewriting logic. In particular, the similarities between rewriting logic and structural operational semantics were noted by Meseguer [8] and further explored by Mart Oliet and Meseguer [7] As an illustrative example, Mart Oliet and Meseguer [7] completely developed a representation of Milner s CCS [9] in rewriting logic. However, this representation cannot be directly executed in the default interpreter of Maude [3] a ....

[Article contains additional citation context not shown here]

J. Meseguer. Conditional rewriting logic as a uni ed model of concurrency. Theoretical Computer Science, 96:73-155, 1992.

....used to relate Petri nets in a uniform way to automata. In [BD95,BD98] non algebraic parameterizations of Petri nets have been achieved by a characterization of automata determined by di erent Petri net types. The use of rewriting logic for the uni cation of Petri nets has been investigated in [Mes92] Another line of research follows the idea to present abstract description of Petri nets and their semantics, for example [GR83,Win87,MM90,Sas98] The classi cation of Petri nets and their extensions as investigated in [BDC92,DA94,KW98] is an important basis for the identi cation of further ....

J. Meseguer. Conditional rewriting logic as a uni ed model of concurrency. Theoretical Computer Science, 96:73-155, 1992.

....is devoted to the static structure of system con gurations, while the vertical dimension is devoted to the observational dynamics of the system. Moreover, the operational rules are designed for open con gurations, which may interact through their interfaces. In fact, unlike rewriting logic (rl) [23], where rewrite rules can be freely instantiated and contextualized (e.g. if f(x) g(x) is a rule, then C[f(t) can be rewritten to C[g(t) for any context C[ and any 4 Bruni et al. initial input interface (i :i :i ) initial output interface (i :o:i) nal input interface (f :i :i ....

Meseguer, J., Conditional rewriting logic as a uni ed model of concurrency, Theoret. Comput. Sci. 96 (1992), pp. 73-155.

....thinking this way, an inference rule of the form P 1 Q 1 : P n Q n P 0 Q 0 becomes a conditional rewrite rule of the form P 0 Q 0 if P 1 Q 1 : P n Q n ; where the condition includes rewrites. Rules of this form were already considered by Meseguer in the seminal paper [11] on rewriting logic. At the logical level, this mapping is again correct, but one must be careful to take into account in the mapping additional information appearing in the transitions of the operational semantics. For example, in structural operational semantics for process algebras it is ....

J. Meseguer. Conditional rewriting logic as a uni ed model of concurrency. Theoretical Computer Science, 96(1):73-155, 1992.

....rewriting (extended with quanti cation) can be embedded into LO. This connection represents a natural entry point in the world of concurrency. In fact, the relationship between multiset rewriting, Colored) Petri Nets, and process calculi has been extensively studied in the literature (see e.g. [11, 36, 34]) In Section 5, we will introduce a non e ective xpoint semantics for linear logic programs. To simplify the manipulation of non ground terms, we will rst lift the top down (proof theoretical) semantics of LO to the non ground level, by introducing a new proof system in which sequents may have ....

....Pareschi and Castagnetti de ne an improved top down strategy for propositional LO based on the Karp Miller s covering graph of Petri Nets, i.e. a forward exploration with accelerations. The relation between Rewriting, Petri Nets and Linear Logic has been investigated in previous works like [11, 18, 36, 34]. Our point of view is based on the proof as computation metaphor proposed in [4, 3, 38] our connection with models for concurrency is inspired to works in this eld like [11, 13, 27, 37, 38] As an example, in [11] Cervesato shows how to encode Petri Nets in di erent fragments of linear logic ....

Meseguer, J. (1992). Conditional Rewriting Logic as a Uni ed Model of Concurrency. Theoretical Computer Science, 96(1), 73-155.

....part must be integrated in a single integrated formalism. 2.1. 2 Actions description models The analysis of di erent formalisms [36] that were introduced by AI researchers to help reasoning about actions and producing explanations (Qpt [12] the evolving algebras [16] rewriting logics [29] and Golog [22] led us to propose a speci c programming language. This model is based on rewriting a recursive structure (a tree) at each execution step. It is thus based on a discrete temporal model. Each node of the tree models both structural or procedural notions and NLP elements. We thus ....

J. MESEGUER. Conditional rewriting logic as a unied model of concurrency. Theoretical Computer Science, 96(1):73155, 1992. 42

....with a consideration for the backgrounds and interests of the readers. So, if the reader is someone who wants to write a compiler, the description should ease somehow the implementation. In this paper we propose a method for producing such an adequate description. The method uses rewriting logic [11], and the categorical nature of the models of rewriting logic is exploited. The description so obtained is executable, so that it is possible to get an intuitive understanding of it. The question of the re nement of descriptions is also discussed. 1 Introduction It is generally admitted that ....

....are not clear about how the compiler incorporates these indications, tuning the program through the directives is not easy. So, the aim in this article is to obtain a framework where it is possible to express the amount of liberty of the compiler w.r.t. the ocial semantics. Rewriting logic [11] is used for that purpose. Besides being an adequate semantic framework for our purpose, rewriting logic allows to run the speci cations. In this article, the well de ned notation CafeOBJ [3] is used for writing the speci cation. They can thus be run with the CafeOBJ system [13] 1.1 Overview ....

Jose Meseguer. Conditional rewriting logic as a uni ed model of concurrency. Theoretical Computer Science, 96:73-155, 1992.

....as hidden and some other as visible, treats states as values of hidden sorts. Visible sorts are used to represent values which can be observed in a given state. States are explicitly described in the speci cation in contrast to our approach. This work combined with Meseguer s rewriting logic [22] has served as the basis of the dynamic aspects of the language CafeOBJ [23] In this language states and transitions are modeled, respectively, as objects and arrows belonging to the same rewrite model which is a categorical extension of the algebraic structure. Meseguer s rewriting logic is also ....

J. Meseguer. Conditional rewriting logic as a uni ed model of concurrency. Theoretical Computer Science, vol. 96, No 1 (April 1992), pp. 73-155.

....That is the reason why most of the tools ignore or restrict the use of data types. Calder and Shankland [3] have de ned a symbolic semantics for LOTOS which gives meaning to symbolic, or data parameterised processes (see below) and avoids in nite branching. In this paper we use rewriting logic [13, 14] and Maude [6] to implement a formal tool based on this symbolic semantics where LOTOS speci cations without restrictions in their data types can be executed. The implementation given here is entirely based on the work presented in [2, 3] A symbolic semantics for LOTOS is given by ....

....In [3] the intuition and key features of this semantics are presented, together with axioms and rules of transition for each LOTOS operator. We will see them, together with their representation in Maude, in Section 2.2. 1. 2 Rewriting logic and Maude Rewriting logic was introduced by Meseguer [13] as a uni ed model of concurrency in which several well known models of concurrent systems can be represented in a common framework. Since then much work has been done on the use of rewriting logic as a logical and semantic framework [12] in which many di erent logics, models of computation, and ....

[Article contains additional citation context not shown here]

J. Meseguer. Conditional rewriting logic as a uni ed model of concurrency. Theoretical Computer Science, 96:73-155, 1992.

....communication description . 28 A.3 Search strategy . 34 A.4 Examples . 36 1 Introduction Rewriting logic [Mes92, Mes98] and Maude [CDE 99, CDE 00b] have emerged as an excellent framework where communication protocols can be speci ed and analyzed [DMT98, DMT00] Rewriting logic was rst proposed by Meseguer as a uni ed framework for concurrency in 1990. Since then much work has been done on the use of ....

....controls the possible rewritings of a term by means of the metalevel function meta apply. The operation meta apply returns one of the possible one step rewritings at the top level of a given term. We rst de ne an operation allRew that returns all the possible one step sequential rewritings [Mes92] of a given term T by using rewrite rules with labels in the list labels. The operations needed to nd all the possible rewritings are as follows: op allRew : Term QidList TermList . op topRew : Term Qid MachineInt TermList . op lowerRew : Term Qid TermList . var T : Term . var L : ....

Jos Meseguer. Conditional rewriting logic as a unied model of concurrency. Theoretical Computer Science, 96:73155, 1992.

....di erent processes in di erent locations, and can communicate asynchronously with each other by means of messages. Mobile Maude s key novel characteristics include: Based on rewriting logic, a simple rst order formalism that is intrinsically concurrent and has a clear mathematical semantics [11]. Extends Maude, a high performance interpreter (1.66 million rewrites per second on a 500Mhz Alpha) and compiler (13 million rewrites per second on a 500MHz Pentium) implementation of rewriting logic. Object oriented and asynchronous, with (mobile) objects as rst class entities in the ....

....(Section 3) and discuss a simple mobile phone application (Section 4) Section 5 then discusses the design of Mobile Maude s security infrastructure; and Section 6 outlines our implementation plans. We end with some concluding remarks. 2 Rewriting Logic, Maude and Re ection Rewriting logic [11] is a very simple logic in which the state space of a distributed system is formally speci ed as an algebraic data type by means of an equational speci cation consisting of a signature of types and operations and a collection of conditional equations E. The dynamics of such a distributed ....

[Article contains additional citation context not shown here]

J. Meseguer. Conditional rewriting logic as a uni ed model of concurrency. Theoretical Computer Science, 96(1):73-155, 1992.

.... properties we will allow more expressive logics, such as full rst order logic (enriched with induction principles to reason about initial models) or even temporal logic (for concurrent programs) Maude [6] is a declarative language and high performance interpreter based on rewriting logic [33, 3] that is very well suited for concurrent speci cation and programming. Since equational logic is a sublogic of rewriting logic, Maude has a functional programming sublanguage that generalizes the OBJ3 language [21] We will use Maude and its tools in these lectures to experiment with and verify ....

....the rst question to ask is: what is a suitable logic to write concurrent programs in a declarative style This is of course an open ended question, in that a variety of answers are possible at present, and new answers may be proposed in the future. In these lectures, we will use rewriting logic [33] as a speci c logic that is indeed suitable for concurrent declarative programming. This is in full harmony with our use of equational logic for deterministic declarative programming. In fact, rewriting logic generalizes equational logic in a natural way and makes possible a seamless extension ....

[Article contains additional citation context not shown here]

J. Meseguer. Conditional rewriting logic as a uni ed model of concurrency. Theoretical Computer Science, 96(1):73-155, 1992.

....the set of states, A is a total binary relation on A, called the transition relation, and L : A P(AP ) is a function, called the labeling function associating to each state a 2 A the set L(a) of those atomic propositions in AP that hold in the state a. Let R = E; R) be a rewrite theory [16], with ( E) its underlying membership equational theory [17] and let State be a sort in such that, for each [t] 2 T =E;State , if [ t] t ] is a rewrite proof in TR , then [t ] 2 T =E;State . We can then associate to R and State the Kripke structure K(R; State) T =E;State ; ....

..... We can then associate to R and State the Kripke structure K(R; State) T =E;State ; R ; LR ) where R is the one step sequential R rewriting relation on T =E;State , that is, the set of all pairs ( t] t ] 2 T =E;State such that there is a one step sequential rewrite proof (see [16]) t] t ] in TR ; its associated total relation R adds a self loop for each deadlock state, that is, for each [t] 2 T =E;State that cannot be further rewritten. The labeling function LR is of the form LR : T =E;State P(SP red 0 ( State) where SP red 0 ( State) is the set ....

Meseguer, J., Conditional rewriting logic as a uni ed model of concurrency, Theoretical Computer Science 96 (1992), pp. 73-155.

No context found.

Meseguer, J., Conditional rewriting logic as a uni ed model of concurrency, Theo. Comp. Sci. 96 (1992), pp. 73-155.

No context found.

J.Meseguer, Conditional rewriting logic as a uni ed model of concurrency. TCS, 96(1):73-155. Amsterdam: Elsevier, 1992.

No context found.

J. Meseguer. Conditional rewriting logic as a uni ed model of concurrency. Theoret. Comput. Sci., 96:73-155, 1992.

No context found.

J. Meseguer. Conditional rewriting logic as a uni ed model of concurrency. Theoretical Computer Science, 96(1):73-155, April 1992.

No context found.

MESEGUER, J. Conditional rewriting logic as a unied model of concurrency. Theoret. Comput. Sci. 96 (1992), 73--155.

No context found.

frm-eJose Meseguer. Conditional rewriting logic as a uni ed model of concurrency. Theoretical Computer Science, 96(1):73-155, 1992.

No context found.

Jose Meseguer. Conditional rewriting logic as an uni ed model of concurrency. Theoretical Computer Science, 96:73-155, 1992.

No context found.

J. Meseguer. Conditional Rewriting Logic as a Uni ed Model of Concurrency. Theoretical Computer Science, 96(1):73-155, 1992.

No context found.

J. Meseguer. Conditional rewriting logic as a uni ed model of concurrency. Theoretical Computer Science, 96:73-155, 1992.

No context found.

J. Meseguer. Conditional rewriting logic as a unied model of concurrency. Theoretical Computer Science, 96(1):73155, 1992.

No context found.

J. Meseguer. Conditional rewriting logic as a uni ed model of concurrency. Theoretical Computer Science, 96:73-155, 1992.

First 50 documents  Next 50

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