Logical definability on infinite traces
From MaRDI portal
Publication:672860
DOI10.1016/0304-3975(95)00130-1zbMATH Open0871.68111OpenAlexW2034083679MaRDI QIDQ672860FDOQ672860
Authors: Werner Ebinger, Anca Muscholl 
Publication date: 28 February 1997
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0304-3975(95)00130-1
Recommendations
Cites Work
- Title not available (Why is that?)
- Combinatorics on traces
- Title not available (Why is that?)
- On finite monoids having only trivial subgroups
- An extension of Kleene's and Ochmański's theorems to infinite traces
- Combinatorial problems of commutation and rearrangements
- Notes on finite asynchronous automata
- Title not available (Why is that?)
- First-order logic and star-free sets
- A syntactic congruence for rational \(\omega\)-languages
- Title not available (Why is that?)
- Title not available (Why is that?)
- Theory of traces
- Star-free trace languages
- Deterministic asynchronous automata for infinite traces
- Title not available (Why is that?)
- Une condition suffisante de reconnaissabilité dans un monoïde partiellement commutatif
- Title not available (Why is that?)
- Asynchronous cellular automata for infinite traces
- Inhomogeneous sorting
- On the concatenation of infinite traces
Cited In (24)
- Logical definability on infinite traces
- Pure future local temporal logics are expressively complete for Mazurkiewicz traces
- Title not available (Why is that?)
- Lemmaless induction in trace logic
- A Büchi-like theorem for weighted tree automata over multioperator monoids
- Muller message-passing automata and logics
- An extension of the wreath product principle for finite Mazurkiewicz traces
- Local testability from words to traces, a suitable definition
- Regular sets of infinite message sequence charts
- LTL is expressively complete for Mazurkiewicz traces
- From local to global temporal logics over Mazurkiewicz traces.
- Local temporal logic is expressively complete for cograph dependence alphabets
- On Definitions in an Infinitary Language
- A note on the logical definability of rational trace languages
- A Kleene theorem and model checking algorithms for existentially bounded communicating automata
- A theory of regular MSC languages
- Generalized rational relations and their logical definability
- Recognizable and logically definable languages of infinite computations in concurrent automata
- Weighted Logics for Traces
- On the complementation of asynchronous cellular Büchi automata
- Models for quantitative distributed systems and multi-valued logics
- AN EXPRESSIVE EXTENSION OF TLC
- Title not available (Why is that?)
- Solving word equations modulo partial commutations
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)
