The following pages link to Theory of traces (Q1107296):
Displayed 47 items.
- A remark on the representation of trace monoids (Q584429) (← links)
- Recognizable languages in concurrency monoids (Q672317) (← links)
- On some decision problems for trace codings (Q672324) (← links)
- Logical definability on infinite traces (Q672860) (← links)
- On the concatenation of infinite traces (Q685439) (← links)
- Möbius functions and confluent semi-commutations (Q685454) (← links)
- The poset of infinitary traces (Q689293) (← links)
- The complexity of regular DNLC graph languages (Q909473) (← links)
- Word problems over traces which are solvable in linear time (Q914395) (← links)
- Shuffle on trajectories: Syntactic constraints (Q1128661) (← links)
- Trace monoids with some invertible generators: Two decision problems (Q1179186) (← links)
- Executions: A new partial-order semantics of Petri nets (Q1183595) (← links)
- Event structures and trace monoids (Q1183599) (← links)
- Probabilistic estimation of the number of prefixes of a trace (Q1184996) (← links)
- A denotational theory of synchronous reactive systems (Q1193599) (← links)
- Star-free trace languages (Q1193878) (← links)
- The expressive power of indeterminate dataflow primitives (Q1201292) (← links)
- Decidability of the star problem in \(A^*\times{}\{ b\}^*\) (Q1201865) (← links)
- The shuffle algebra and its derivations (Q1261473) (← links)
- Representation of computations in concurrent automata by dependence orders (Q1269906) (← links)
- Synchronization expressions with extended join operation (Q1274985) (← links)
- Nonexpressibility of fairness and signaling (Q1309386) (← links)
- \(\Pi_ 1^ 1\)-universality of some propositional logics of concurrent programs (Q1311976) (← links)
- An extension of Kleene's and Ochmański's theorems to infinite traces (Q1318685) (← links)
- Recognizable trace languages, distributed automata and the distribution problem (Q1323363) (← links)
- Asynchronous automata versus asynchronous cellular automata (Q1334661) (← links)
- Lyndon traces and shuffle algebras (Q1334807) (← links)
- A note on the construction of marked graphs (Q1350366) (← links)
- The monadic second-order logic of graphs. X: Linear orderings (Q1366538) (← links)
- The word problem for \(1\mathcal{LC}\) congruences is NP-hard. (Q1426452) (← links)
- Resource traces: A domain for processes sharing exclusive resources. (Q1605180) (← links)
- The lattices of prefixes and overlaps of traces (Q1815323) (← links)
- Algebra and theory of order-deterministic pomsets (Q1815430) (← links)
- Semi-commutations and Petri nets (Q1822948) (← links)
- The Kleene-Schützenberger theorem for formal power series in partially commuting variables. (Q1854303) (← links)
- Compositionality in dataflow synchronous languages: Specification and distributed code generation (Q1854388) (← links)
- Lyndon heaps: An analogue of Lyndon words in free partially commutative monoids (Q1901039) (← links)
- Net models of discrete information transducers. I (Q1910973) (← links)
- Efficient solution of some problems in free partially commutative monoids (Q2640345) (← links)
- A generalization of traces (Q3357559) (← links)
- On a subclass of context-free groups (Q3978768) (← links)
- Characterizations of the decidability of some problems for regular trace languages (Q4729376) (← links)
- On the synchronization of traces (Q4733415) (← links)
- Logical definability of some rational trace languages (Q4850330) (← links)
- Probabilistic asynchronous automata (Q4864443) (← links)
- On the structure of recognizable languages of dependence graphs (Q5286052) (← links)
- Partially abelian squarefree words (Q5751950) (← links)