Linearity in process languages

The meaning and mathematical consequences of linearity (managing without a presumed ability to copy) are studied for a path-based model of processes which is also a model of affine-linear logic. This connection yields an affine-linear language for processes, automatically respecting open-map bisimulation, in which a range of process operations can be expressed. An operational semantics is provided for the tensor fragment of the language. Different ways to make assemblies of processes lead to different choices of exponential, some of which respect bisimulation.

[1]  Zoltán Ésik,et al.  Higher Dimensional Automata , 2002, J. Autom. Lang. Comb..

[2]  Zoltán Ésik,et al.  Axiomatizing omega and omega-op powers of words , 2004, RAIRO Theor. Informatics Appl..

[3]  Luca Aceto,et al.  A note on an expressiveness hierarchy for multi-exit iteration , 2002, Inf. Process. Lett..

[4]  Jesper Makholm Byskov.  Chromatic Number in Time O(2.4023^n) Using Maximal Independent Sets , 2002 .

[5]  Emmanuel Fleury,et al.  Using IDDs for Packet Filtering , 2002 .

[6]  Anna Ingólfsdóttir,et al.  Checking Consistency of Pedigree Information is NP-complete , 2002 .

[7]  Zoltán Ésik,et al.  Greibach Normal Form in Algebraically Complete Semirings , 2002, CSL.

[8]  Zoltán Ésik.  Extended Temporal Logic on Finite Words and Wreath Product of Monoids with Distinguished Generators , 2002, Developments in Language Theory.

[9]  Mikkel Nygaard.  Towards an Operational Understanding of Presheaf Models , 2001 .

[10]  Luca Cardelli,et al.  Anytime, anywhere: modal logics for mobile ambients , 2000, POPL '00.

[11]  Luca Cardelli,et al.  A Commitment Relation for the Ambient Calculus , 2000 .

[12]  Glynn Winskel,et al.  A Linear Metalanguage for Concurrency , 1998, AMAST.

[13]  Glynn Winskel,et al.  A Categorical Axiomatics for Bisimulation , 1998, CONCUR.

[14]  Glynn Winskel,et al.  A theory of recursive domains with applications to concurrency , 1997, Proceedings. Thirteenth Annual IEEE Symposium on Logic in Computer Science (Cat. No.98CB36226).

[15]  Glynn Winskel,et al.  Presheaf Models for Concurrency , 1996, CSL.

[16]  Glynn Winskel,et al.  Bisimulation from Open Maps , 1994, Inf. Comput..

[17]  Torben Braüner,et al.  An Axiomatic Approach to Adequacy , 1996 .

[18]  S. Lane,et al.  Sheaves In Geometry And Logic , 1992 .

[19]  Mogens Nielsen,et al.  Models for Concurrency , 1992 .

[20]  S. Shelah,et al.  Annals of Pure and Applied Logic , 1991 .

[21]  Robin Milner,et al.  Communication and concurrency , 1989, PHI Series in computer science.

[22]  Glynn Winskel,et al.  Categories of Models for Concurrency , 1984, Seminar on Concurrency.

[23]  Glynn Winskel,et al.  Using Information Systems to Solve Recursive Domain Equations Effectively , 1984, Semantics of Data Types.

[24]  William B. Ackerman,et al.  Scenarios: A Model of Non-Determinate Computation , 1981, ICFPC.

[25]  Robin Milner,et al.  A Calculus of Communicating Systems , 1980, Lecture Notes in Computer Science.

[26]  C. A. R. Hoare,et al.  A Model for Communicating Sequential Processes , 1980, On the Construction of Programs.