Associative Omega-products of Traces

Authors:
Roman R. Redziejowski
Affiliations:
Giraf's Research. E-mail: roman.redz@swipnet.se
Venue:
Fundamenta Informaticae - Concurrency Specification and Programming (CS&P 2004)
Year:
2005

Citing 6
Cited 4

On the domain of traces and sequential composition

TAPSOFT '91 Proceedings of the international joint conference on theory and practice of software development on Colloquium on trees in algebra and programming (CAAP '91): vol 1
Infinite traces

Proceedings of the LITP spring school on theoretical computer science on Semantics of systems of concurrent processes
Domain theory

Handbook of logic in computer science (vol. 3)
The Book of Traces

The Book of Traces
Fairness for non-interleaving concurrency

Fairness for non-interleaving concurrency
On Associative Omega-Products

Fundamenta Informaticae - Concurrency Specification and Programming (CS&P 2003)

Associative Omega-product of Processes

Fundamenta Informaticae - SPECIAL ISSUE ON CONCURRENCY SPECIFICATION AND PROGRAMMING (CS&P 2005) Ruciane-Nide, Poland, 28-30 September 2005
Infinite unfair shuffles and associativity

Theoretical Computer Science
Associativity of Infinite Synchronized Shuffles and Team Automata

Fundamenta Informaticae
Infinite Product of Traces Represented by Projections

Fundamenta Informaticae - Concurrency Specification and Programming (CS&P)

Quantified Score

Hi-index	0.00

Visualization

Abstract

The notion of associative infinite product is applied to traces, resulting in an alternative approach to introducing infinite traces. Four different versions of product are explored, two of them identical to known definitions of infinite trace.