Pages that link to "Item:Q672860"
From MaRDI portal
The following pages link to Logical definability on infinite traces (Q672860):
Displaying 18 items.
- An extension of the wreath product principle for finite Mazurkiewicz traces (Q293379) (← links)
- A Büchi-like theorem for weighted tree automata over multioperator monoids (Q692910) (← links)
- Local testability from words to traces, a suitable definition (Q728279) (← links)
- Pure future local temporal logics are expressively complete for Mazurkiewicz traces (Q859824) (← links)
- Muller message-passing automata and logics (Q948076) (← links)
- On the complementation of asynchronous cellular Büchi automata (Q1349891) (← links)
- LTL is expressively complete for Mazurkiewicz traces (Q1608324) (← links)
- Local temporal logic is expressively complete for cograph dependence alphabets (Q1763374) (← links)
- Regular sets of infinite message sequence charts (Q1887140) (← links)
- Solving word equations modulo partial commutations (Q1960424) (← links)
- From local to global temporal logics over Mazurkiewicz traces. (Q2490814) (← links)
- A Kleene theorem and model checking algorithms for existentially bounded communicating automata (Q2496297) (← links)
- A theory of regular MSC languages (Q2573333) (← links)
- Models for quantitative distributed systems and multi-valued logics (Q2855751) (← links)
- AN EXPRESSIVE EXTENSION OF TLC (Q3021958) (← links)
- Generalized rational relations and their logical definability (Q5055929) (← links)
- (Q5094152) (← links)
- RECOGNIZABLE AND LOGICALLY DEFINABLE LANGUAGES OF INFINITE COMPUTATIONS IN CONCURRENT AUTOMATA (Q5248980) (← links)
