Logic of trace languages

Alexander Rabinovich*

*Corresponding author for this work

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

2 Scopus citations


Usually, laws established in process calculi have the format of equations and/or inequations between process-terms. Though such set of laws captures important properties of the underlying algebra it cannot reveal some basic logical properties of the algebra. From the logical point of view, the consequence relation associated with an algebra is much more fundamental than the set of laws valid in it. That is why in this paper our main concern is about consequence relation which provides the answer to questions in the following format (the formalization is in terms of sequents): what terms are equal under the assumption that some other pairs of terms are equal. We compare two algebras: algebra of linear trace languages and algebra of relations. The fundamental operations in trace algebra are synchronization (parallel composition) of two trace languages, nondeterministic choice and hiding of a port in a language. The corresponding operations in relational algebra are join, union and projection. We show that these algebras have the same laws, i.e. two terms have the same meaning in all trace interpretations iff they have the same meaning in all relational interpretations. Moreover, we show that these algebras have the same consequence relations. We embed both algebras into first order logic and through this embedding obtain sound and complete proof systems for reasoning about the consequence relations in these algebras.

Original languageEnglish
Title of host publicationCONCUR 1992 - 3rd International Conference on Concurrency Theory, Proceedings
EditorsW. Rance Cleaveland
PublisherSpringer Verlag
Number of pages14
ISBN (Print)9783540558224
StatePublished - 1992
Externally publishedYes
Event3rd International Conference on Concurrency Theory, CONCUR 1992 - Stony Brook, United States
Duration: 24 Aug 199227 Aug 1992

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume630 LNCS
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349


Conference3rd International Conference on Concurrency Theory, CONCUR 1992
Country/TerritoryUnited States
CityStony Brook


Dive into the research topics of 'Logic of trace languages'. Together they form a unique fingerprint.

Cite this