| | |
Summary: Compression of Partially Ordered Strings
Rajeev Alur, Swarat Chaudhuri, Kousha Etessami, Sudipto Guha, and Mihalis
Yannakakis
1 Department of Computer and Information Science, University of Pennsylvania
2 Department of Computer and Information Science, University of Pennsylvania
3 School of Informatics, University of Edinburgh
4 Department of Computer and Information Science, University of Pennsylvania
5 Department of Computer Science, Stanford University
Abstract. We introduce the problem of compressing partially ordered
strings: given string 2 and a binary independence relation I over ,
how can we compactly represent an input if the decompressor is allowed
to reconstruct any string that can be obtained from by repeatedly
swapping adjacent independent symbols? Such partially ordered strings
are also known as Mazurkiewicz traces, and naturally model executions
of concurrent programs. Compression techniques have been applied with
much success to sequential program traces not only to store them com-
pactly but to discover important pro ling patterns within them. For
compression to achieve similar aims for concurrent program traces we
should exploit the extra freedom provided by the independence relation.
Many popular string compression schemes are grammar-based schemes
|
