Dai Tri Man Le
On Three Alternative Characterizations of Combined Traces.
Fri, 11/05/2010 - 16:01 — SomNambulAuthors: Dai Tri Man Le
Subjects: Formal Languages and Automata Theory
AbstractCombined traces (i.e., comtraces), a generalization of Mazurkiewicz traces,
were introduced by Janicki and Koutny in 1995 as congruence classes of step
sequences, where the congruence relation is induced by two relations
simultaneity and serializability on events. They also showed that comtraces
corresponds to some class of labeled stratified order structures, but the
question "what class of labeled stratified orders represent comtraces?" was
left open. In this work, we proposed a class of labeled stratified order
structures that captures exactly the comtrace notion.A Characterization of Combined Traces Using Labeled Stratified Order Structures.
Fri, 04/02/2010 - 15:01 — SomNambulAuthors: Dai Tri Man Le
Subjects: and Cluster Computing, Distributed, Parallel
AbstractThis paper defines a class of labeled stratified order structures that
characterizes exactly the notion of combined traces (i.e., comtraces) proposed
by Janicki and Koutny in 1995. Our main technical contributions are the
representation theorems showing that comtrace quotient monoid, combined
dependency graph (Kleijn and Koutny 2008) and our labeled stratified order
structure characterization are three different and yet equivalent ways to
represent comtraces.Combining Partial Order Alignment and Progressive Near-Optimal Alignment.
Wed, 12/16/2009 - 16:01 — SomNambulAuthors: Dai Tri Man Le
Subjects: Data Structures and Algorithms
AbstractIn this paper, I proposed to utilize partial-order alignment technique as a
heuristic method to cope with the state-space explosion problem in progressive
near-optimal alignment. The key idea of my approach is a formal treatment of
progressive partial order alignment based on the graph product construction.
User login
