V. Gehlot and C. Gunther. Normal process representatives. In Proceedings of the Fifth Annual IEEE Symposium on Logic in Computer Science | LICS'90, pages 200-207, Philadelphia, PA, 4-7 June 1990. IEEE Computer Society Press.  Home/Search   Document Not in Database   Summary   Related Articles   Check

....of a transition are not symmetric: the former is modeled as iterated linear implications while the latter as an asynchronous formula inside a monad. It would be tempting to represent both using the monadic encoding, which is akin to the way Petri nets are traditionally rendered in linear logic [Cer95, MOM91, GG90]. For example, transition t a would be represented as t a : b tok b tok ag f1 While this is not incorrect, the behavior of this declaration is not what we would expect: it is applicable not only in a linear context containing two declarations of type tok b and one of type tok a, but ....

V. Gehlot and C. Gunter. Normal process representatives. In Proceedings of the 5th Annual IEEE Symposium on Logic in Computer Science, pages 200-207, Philadelphia, PA, 1990. IEEE Computer Society Press.

....of a transition are not symmetric: the former is modeled as iterated linear implications while the latter as an asynchronous formula inside a monad. It would be tempting to represent both using the monadic encoding, which is akin to the way Petri nets are traditionally rendered in linear logic [Cer95, MOM91, GG90]. For example, transition t a would be represented as t a : b# tok b# tok a tok c . While this is not incorrect, the behavior of this declaration is not what we would expect: it is applicable not only in a linear context containing two declarations of type tok b and one of type tok a, ....

V. Gehlot and C. Gunter. Normal process representatives. In Proceedings of the 5th Annual IEEE Symposium on Logic in Computer Science, pages 200--207, Philadelphia, PA, 1990. IEEE Computer Society Press.

....It has been observed # Submitted to FCS 03 on 21 March 2003. various places (for example, 10, 5] that this abstract can be realized well using multiset rewriting. Given that it is well known that proof search in linear logic provides a declarative framework for specifying multiset rewriting [13, 16, 5], a rather transparent start at representing security primitives is available with proof search in linear logic. Proof theory comes with a primitive, declarative, and well understood notion of newness and freshness via the technical devices of eigenvariable (newness in proofs) 14] and ....

V. Gehlot and C. Gunter. Normal process representatives. In Proceedings of the Fifth Annual Symposium on Logic in Computer Science, pages 200--207, Philadelphia, Pennsylvania, June 1990. IEEE Computer Society Press.

.... existential quanti cation (MSR) may also be viewed as the existential Horn fragment of rst order linear logic [Gir87a] The close connection between standard multiset rewriting (without existential quanti cation) and simple fragments of linear logic has been studied extensively [Asp87, MOM91, GG90b, Kan94] and extended in [CDKS00] to include parameters and ex3 istential quanti cation. Under this correspondence, every MSR transition sequence corresponds to a linear logic derivation in normal form, and conversely. A linear logical framework automated tool LLF [CP96] may be used to simulate ....

V. Gehlot and C. Gunther. Normal process representatives. In Proceedings of the Fifth Annual IEEE Symposium on Logic in Computer Science | LICS'90, pages 200-207, Philadelphia, PA, 4-7 June 1990. IEEE Computer Society Press.

....duplicates. The second main di erence is that the formalism has a basic mechanism for choosing new symbols. This is important for modeling protocols that choose a new nonce or generate encryption keys. Our formalism can also be viewed as a Horn fragment of linear logic [Gir87b, Asp87, MOM89, GG90a, Kan94, Cer95] A similar fragment of linear logic is used in [KOS98] to represent real time nite state systems. Two other e orts using linear logic to model the state transition aspect of protocols (but not existential quanti cation for nonces) are [CD98, DMT98] The multi set rewriting ....

V. Gehlot and C. Gunter. Normal process representatives. In Proceedings of Fifth Symposium on Logic in Computer Science, pages 200-207, Philadelphia, Pennsylvania, June 1990.

....environment [18] need to be stated and one only has to deal with axioms about those objects which are involved in the action. Proof search in linear logic will therefore have many useful applications such as resource sensitive logic programming [14] modeling concurrent computation by petri nets [11], and planning [17] Because of the expressivity of logic, however, reasoning in linear logic is dif cult to automate. Propositional linear logic is already undecidable. In order to prove a linear logic formula syntactically one has to rely on either sequent calculi or proof nets [12,6] a kind ....

V. Gehlot, C. Gunter. Normal process representatives. In Proc. 5-th Annual IEEE Symposium on Logic in Computer Science, pp. 200-207, 1991.

....programming languages [4, 15, 27] abstract machines [16] and process calculi [26] Various recent papers suggest that linear logic [11] can be used as well to make this style of specification more expressive. For example, specifications of imperative and concurrent programming language features [5, 6, 9, 23, 24] and the sequential and concurrent (pipe line) semantics of a RISC processor [6] have been modeled using linear logic. A key property of such encodings is that there exists a computation in a certain system if and only if there is a proof of a certain judgment from the set of clauses that encodes ....

Vijay Gehlot and Carl Gunter. Normal process representatives. In Proceedings, Fifth Annual IEEE Symposium on Logic in Computer Science, pages 200--207, Philadelphia, Pennsylvania, June 1990. IEEE Computer Society Press.

....environment [17] need to be stated and one only has to deal with axioms about those objects which are involved in the action. Proof search in linear logic will therefore have many useful applications such as resource sensitive logic programming [13] modeling concurrent computation by petri nets [10], and planning [16] Because of the expressivity of logic, however, reasoning in linear logic is difficult to automate. Propositional linear logic is already undecidable. In order to prove a linear logic formula syntactically one has to rely on either sequent calculi or proof nets [11, 5] a kind ....

V. Gehlot, C. Gunter. Normal process representatives. In Proc. 5-th Annual IEEE Symposium on Logic in Computer Science, 200--207, 1991

....of linear logic [16] a re nement of modal logic with an intrinsic and natural accounting of process states and events. The choice of linear logic is natural because of the very close connection between multiset rewriting and simple fragments of linear logic, which has been studied extensively [3, 30, 15, 19, 5]. We extend this standard correspondence to include rst order parameters and existentially quanti ed variables. On the other hand, we also formally represent strand constructions as relatively simple formulas in rst order linear logic. This encoding is also shown to be sound and complete. As in ....

....eld of security protocol analysis in a similar way. As a speci cation language, linear logic has been used to provide elegant and e ective representations of many systems that share characteristics with cryptoprotocols [8, 9, 17, 18] The natural embedding of concurrent systems in linear logic [15, 20], in particular in its graphbased presentations [16] is also likely to be relevant, given the interpretation of security protocols as concurrent systems [1, 40] Work on meta reasoning in linear logic [32] promises to address protocol correctness [4, 35] e ectively and eciently. Finally, some of ....

[Article contains additional citation context not shown here]

Gehlot, V., and Gunter, C. Normal process representatives. In Proc. 5-th IEEE Symp. on Logic in Computer Science (Philadelphia, June 1990).

.... linear lambda calculus and memory allocation, investigated by Lincoln and Mitchell [70] Chirimar et al. 33, 34] Wadler [90] Mackie [77] and Benton et al. 24] A strong relationship of the multiplicative fragment of linear logic to Petri nets has been demonstrated by Gehlot and Gunter [57, 44, 43], Asperti et al. 12, 14] Engberg and Winskel [41] Marti Oliet and Meseguer [79] and Brown and Gurr [30] Interpretations of linear logic proofs in concurrent paradigms such as the chemical abstract machine or Milner s calculus are given by Abramsky [1] and by Bellin and P.J. Scott [23] With ....

V. Gehlot and C.A. Gunter. Normal process representatives. In Proc. 5th IEEE Symp. on Logic in Computer Science, Philadelphia, June 1990.

....of linear logic [16] a refinement of modal logic with an intrinsic and natural accounting of process states and events. The choice of linear logic is natural because of the very close connection between multiset rewriting and simple fragments of linear logic, which has been studied extensively [3, 30, 15, 19, 5]. We extend this standard correspondence to include first order parameters and existentially quantified variables. On the other hand, we also formally represent strand constructions as relatively simple formulas in first order linear logic. This encoding is also shown to be sound and complete. As ....

....field of security protocol analysis in a similar way. As a specification language, linear logic has been used to provide elegant and effective representations of many systems that share characteristics with cryptoprotocols [8, 9, 17, 18] The natural embedding of concurrent systems in linear logic [15, 20], in particular in its graphbased presentations [16] is also likely to be relevant, given the interpretation of security protocols as concurrent systems [1, 40] Work on meta reasoning in linear logic [32] promises to address protocol correctness [4, 35] effectively and efficiently. Finally, some ....

[Article contains additional citation context not shown here]

Gehlot, V., and Gunter, C. Normal process representatives. In Proc. 5-th IEEE Symp. on Logic in Computer Science (Philadelphia, June 1990).

....eld of security protocol analysis in a similar way. As a speci cation language, linear logic has been used to provide elegant and e ective repre1 sentations of many systems that share characteristics with crypto protocols [6, 7, 15, 16] The natural embedding of concurrent systems in linear logic [13, 18], in particular in its graph based presentations [14] is also likely to be relevant, given the interpretation of security protocols as concurrent systems [1, 31] Work on meta reasoning in linear logic [25] promises to address protocol correctness [3, 28] e ectively and e ciently. Finally, some ....

V. Gehlot and C. Gunter. Normal process representatives. In Proc. 5-th IEEE Symp. on Logic in Computer Science, Philadelphia, June 1990.

.... ( a Omega c) Gammaffi b) b Omega d Omega d) Gammaffi (c Omega d) a; c; d; d c; d This sequent is provable in linear logic if and only if there is a sequence of Petri net rule applications that transform the token set fa; c; d; dg to fc; dg. This connection has been well studied [5, 14, 30, 6, 9], and extended to cover other models of concurrency [22, 2, 35] Linear logic has also been applied to several other areas of computer science. One key application of the resource sensitive aspect of the logic was the development of a functional programming language implementation in which garbage ....

V. Gehlot and C.A. Gunter. Normal process representatives. In Proc. 5-th IEEE Symp. on Logic in Computer Science, Philadelphia, June 1990.

....In precise technical terms, the target of our translation is an intuitionistic version of mall, presented by two sided sequents with at most one consequent formula. Similar intuitionistic versions of various fragment of linear logic are considered in relationship to computer science, e.g. in [14, 23, 6, 11, 16, 1, 24]. Apart from the foundational interest, we believe that the result of this paper, which is theoretical in nature, contributes to the understanding of the role of linear logic as an expressive and natural framework for describing control structure of logic programs. This logic programming ....

V. Gehlot and C.A. Gunter. Normal process representatives. In Proc. 5-th IEEE Symp. on Logic in Computer Science, Philadelphia, June 1990.

....a Petri net transition which takes a token from place a and another from place c and replaces them with one token on place b. This encoding enforces a kind of interleaving model of concurrency for the Petri net. This and other connections between linear logic and Petri nets have been well studied [Asp87,GG89,MOM89,AFG90,GG90], and extended in various ways to cover other models of concurrency [Laf90,Pra92] In fact, the Lcc languages can be seen as a first order version of Petri nets augmented with constraints, and HLcc as a Higher order version. In the above encoding, the atoms a, b, and c contain no internal ....

V. Gehlot and C.A. Gunter. Normal process representatives. In Proc. 5-th IEEE Symp. on Logic in Computer Science, Philadelphia, June 1990.

No context found.

V. Gehlot and C. Gunther. Normal process representatives. In Proceedings of the Fifth Annual IEEE Symposium on Logic in Computer Science | LICS'90, pages 200-207, Philadelphia, PA, 4-7 June 1990. IEEE Computer Society Press.

No context found.

V. Gehlot and C. Gunter. Normal process representatives. In Proceedings of Fifth Symposium on Logic in Computer Science, pages 200-207, Philadelphia, Pennsylvania, June 1990.

No context found.

V. Gehlot and C.A. Gunter. Normal process representatives. In Proc. 5-th IEEE Symp. on Logic in Computer Science, Philadelphia, June 1990.

No context found.

V. Gehlot and C.A. Gunter. Normal process representatives. In Proc. 5-th IEEE Symp. on Logic in Computer Science, Philadelphia, June 1990.

No context found.

V. Gehlot and C.A. Gunter. Normal process representatives. In Proc. 5-th IEEE Symp. on Logic in Computer Science, Philadelphia, June 1990.

No context found.

V. Gehlot and C.A. Gunter. Normal process representatives. In Proc. 5-th IEEE Symp. on Logic in Computer Science, Philadelphia, June 1990.

No context found.

V. Gehlot and C. Gunter. Normal process representatives. Fifth IEEE Sym. on Logic in Computer Science, pages 200-207, Philadelphia, June 1990. 17

No context found.

V. Gehlot and C. Gunther. Normal process representatives. In Proceedings of the Fifth Annual IEEE Symposium on Logic in Computer Science | LICS'90, pages 200-207, Philadelphia, PA, 4-7 June 1990. IEEE Computer Society Press.

No context found.

V. Gehlot and C. Gunter. Normal process representatives. In Proceedings of Fifth Symposium on Logic in Computer Science, pages 200-207, Philadelphia, Pennsylvania, June 1990.

First 50 documents

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