Recommendations
Cites work
- scientific article; zbMATH DE number 3862473 (Why is no real title available?)
- scientific article; zbMATH DE number 3924161 (Why is no real title available?)
- scientific article; zbMATH DE number 4030996 (Why is no real title available?)
- scientific article; zbMATH DE number 4112050 (Why is no real title available?)
- scientific article; zbMATH DE number 176496 (Why is no real title available?)
- scientific article; zbMATH DE number 1142314 (Why is no real title available?)
- scientific article; zbMATH DE number 3237829 (Why is no real title available?)
- A syntactic congruence for rational \(\omega\)-languages
- An extension of Kleene's and Ochmański's theorems to infinite traces
- Asynchronous cellular automata for infinite traces
- Combinatorial problems of commutation and rearrangements
- Combinatorics on traces
- Deterministic asynchronous automata for infinite traces
- First-order logic and star-free sets
- Inhomogeneous sorting
- Notes on finite asynchronous automata
- On finite monoids having only trivial subgroups
- On the concatenation of infinite traces
- Star-free trace languages
- Theory of traces
- Une condition suffisante de reconnaissabilité dans un monoïde partiellement commutatif
Cited in
(24)- Muller message-passing automata and logics
- Recognizable and logically definable languages of infinite computations in concurrent automata
- LTL is expressively complete for Mazurkiewicz traces
- Logical definability on infinite traces
- From local to global temporal logics over Mazurkiewicz traces.
- A note on the logical definability of rational trace languages
- scientific article; zbMATH DE number 512855 (Why is no real title available?)
- A Kleene theorem and model checking algorithms for existentially bounded communicating automata
- Models for quantitative distributed systems and multi-valued logics
- Local temporal logic is expressively complete for cograph dependence alphabets
- Lemmaless induction in trace logic
- AN EXPRESSIVE EXTENSION OF TLC
- Pure future local temporal logics are expressively complete for Mazurkiewicz traces
- Generalized rational relations and their logical definability
- A Büchi-like theorem for weighted tree automata over multioperator monoids
- On Definitions in an Infinitary Language
- Regular sets of infinite message sequence charts
- scientific article; zbMATH DE number 7566078 (Why is no real title available?)
- Weighted Logics for Traces
- Local testability from words to traces, a suitable definition
- A theory of regular MSC languages
- An extension of the wreath product principle for finite Mazurkiewicz traces
- Solving word equations modulo partial commutations
- On the complementation of asynchronous cellular Büchi automata
This page was built for publication: Logical definability on infinite traces
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q672860)
