Infinite Product of Traces Represented by Projections

Authors:
Roman R. Redziejowski
Affiliations:
(Address for correspondence: Ceremonimästarvägen 10, SE-181 40 Lidingö, Sweden) Giraf’s Research, roman.redz@swipnet.se
Venue:
Fundamenta Informaticae - Concurrency Specification and Programming (CS&P)
Year:
2010

Citing 10
Cited 0

Event fairness and non-interleaving concurrency

Formal Aspects of Computing
Combinatorics on traces

Combinatorics on traces
An asychronous model for distributed systems (French)

Theoretical Computer Science
Infinite traces

Proceedings of the LITP spring school on theoretical computer science on Semantics of systems of concurrent processes
Defining Process Fairness for Non-Interleaving Concurrency

Proceedings of the Tenth Conference on Foundations of Software Technology and Theoretical Computer Science
Adequate Path Expressions

Proceedings of the International Sympoisum on Semantics of Concurrent Computation
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-products of Traces

Fundamenta Informaticae - Concurrency Specification and Programming (CS&P 2004)
Projection Representation of Mazurkiewicz Traces

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

Quantified Score

Hi-index	0.00

Visualization

Abstract

The construction of an associative ω-product of traces from an earlier paper is revisited using projection representation of traces. Using projections instead of trace prefixes results in very simple definitions and proofs.