In this paper we extend several results from Mazurkiewicz trace theory to the framework of cut-bounded languages. First the expressive power of shared-memory systems in terms of recognized sets of labeled partial orders is characterized by means of the notion of cut-bound plus the condition to be regular, or equivalently MSO-definable. Next weakly unambiguous systems with deterministic rules are proved to be as expressive as any system, contrary to deterministic or strongly unambiguous systems considered previously. Finally we extend the rational description of regular trace languages by loop-connected specifications within a new algebraic framework called shared-memory charts. In that way we present also several generalizations of results from the theory of regular sets of message sequence charts. © 2011 Springer-Verlag Berlin Heidelberg.
CITATION STYLE
Morin, R. (2011). Shared-memory systems and charts. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 6651 LNCS, pp. 317–330). https://doi.org/10.1007/978-3-642-20712-9_25
Mendeley helps you to discover research relevant for your work.