Rewriting with conditional rewrite rules modulo a set E of structural axioms provides a
general framework for unifying a wide variety of models of concurrency. Concurrent rewriting …

Linear logic, introduced in 1986 by J.-Y. Girard, is based upon a fine grain analysis of the
main proof-theoretical notions of logic. The subject develops along the lines of denotational …

Go back to An-fang, the Peace Square at An-Fang, the Beginning Place at An-Fang, where
all things start (…) An-Fang was near a city, the only living city with a pre-atomic name (…) …

Linear logic, introduced by Girard, is a refinement of classical logic with a natural, intrinsic
accounting of resources. This accounting is made possible by removing the 'structural'rules …

A Chu space is a binary relation from a set A to an antiset X defined as a set which
transforms via converse functions. Chu spaces admit a great many interpretations by virtue …

We present the linear type theory λΠ⊸ &⊤ as the formal basis for LLF, a conservative
extension of the logical framework LF. LLF combines the expressive power of dependent …

Rewriting logic expresses an essential equivalence between logic and computation. System
states are in bijective correspondence with formulas, and concurrent computations are in …

Abstract We formalize the Dolev–Yao model of security protocols, using a notation based on
multiset rewriting with existentials. The goals are to provide a simple formal notation for …

We propose rewriting logic as a unifying framework for a wide range of Petri nets models.
We treat in detail place/transition nets and important extensions of the basic model by …

We present the propositional fragment CLF 0 of the Concurrent Logical Framework (CLF).
CLF extends the Linear Logical Framework to allow the natural representation of concurrent …