Stable trace automata vs. full trace automata
V Schmitt - Theoretical computer science, 1998 - Elsevier
Trace automata provide a well-studied model for systems with concurrent behavior, which is
usually given by associated domains of finite or infinite computation systems. Several …
usually given by associated domains of finite or infinite computation systems. Several …
Topology for computations of concurrent automata
D Kuske, RM Shortt - International Journal of Algebra and …, 1998 - World Scientific
We generalize the results on α-complex traces from [14, 16] to the realm of concurrent
automata. We show that the α-complex computations can be defined as elements of a …
automata. We show that the α-complex computations can be defined as elements of a …
CR-structures
V Schmitt - Fundamenta Informaticae, 1998 - content.iospress.com
In this paper CR-structures are introduced. They consist of a slight generalization of general
event structures [16], and supply a representation theorem for concurrency domains,–which …
event structures [16], and supply a representation theorem for concurrency domains,–which …