Semi-traces and Their Application in Concurrency Control Problem

Authors:
Hoang Chi Thanh
Affiliations:
Department of Informatics, Hanoi University of Science, VNUH, Hanoi, Vietnam
Venue:
ICCCI '09 Proceedings of the 1st International Conference on Computational Collective Intelligence. Semantic Web, Social Networks and Multiagent Systems
Year:
2009

Citing 4
Cited 0

Theory of traces

Theoretical Computer Science
Some behavioural aspects of net theory

Theoretical Computer Science - Special issue: Fifteenth international colloquium on automata, languages and programming, Tampere, Finland, July 1988
Pomsets for Local Trace Languages - Recognizability, Logic & Petri Nets

CONCUR '00 Proceedings of the 11th International Conference on Concurrency Theory
Transforming sequential processes of net systems into concurrent ones

International Journal of Knowledge-based and Intelligent Engineering Systems

Quantified Score

Hi-index	0.00

Visualization

Abstract

The theory of traces was originated by A. Mazurkiewicz to model non-sequential behaviour of a distributed system. The normal form of a trace shows us an optimal way to execute a process occurred on the system. Nevertheless, the independence of actions in many systems is not static and depends on the history of the systems. To describe this fact, D. Kuske and R. Morin proposed a notion of local independence. Basing on the local independence, we introduce a notion of semi-trace, analyze its structure and the relationship between traces and semi-traces. Furthermore, we investigate some applications of semi-traces in concurrency control problem.