Normal process representatives

Vijay Gehlot, Carl Gunter

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Abstract

The relevance of a form of cut elimination theorem for linear logic tensor theories to the concept of a process on a Petri net is discussed. The discussion is based on two definitions of processes given by E. Best and R. Devillers (1987). Their notions of process correspond to equivalence relations on linear logic proofs. It is noted that the cut reduced proofs form a process under the finer of these definitions. Using a strongly normalizing rewrite system and a weak Church-Rosser theorem, it is shown that each class of the coarser process definition contains exactly one of these finer classes which can therefore be viewed as a canonical or normal process representative. The relevance of these rewrite rules to the categorical approach of P. Degano et al. (1989) is also discussed.

Original languageEnglish (US)
Title of host publicationComputer Science
PublisherPubl by IEEE
Pages200-207
Number of pages8
ISBN (Print)0818620730
StatePublished - 1990
Externally publishedYes
EventProceedings of the Fifth Annual IEEE Symposium on Logic in Computer Science - Philadelphia, PA, USA
Duration: Jun 4 1990Jun 7 1990

Publication series

NameProceedings - Symposium on Logic in Computer Science

Other

OtherProceedings of the Fifth Annual IEEE Symposium on Logic in Computer Science
CityPhiladelphia, PA, USA
Period6/4/906/7/90

ASJC Scopus subject areas

  • Software
  • Mathematics(all)

Fingerprint

Dive into the research topics of 'Normal process representatives'. Together they form a unique fingerprint.

Cite this