Pages that link to "Item:Q1338892"
From MaRDI portal
The following pages link to Deterministic asynchronous automata for infinite traces (Q1338892):
Displaying 11 items.
- Logical definability on infinite traces (Q672860) (← links)
- Muller message-passing automata and logics (Q948076) (← links)
- On the complementation of asynchronous cellular Büchi automata (Q1349891) (← links)
- Regular sets of infinite message sequence charts (Q1887140) (← links)
- Classifying recognizable infinitary trace languages using word automata (Q2407086) (← links)
- Classifying Recognizable Infinitary Trace Languages Using Word Automata (Q2922012) (← links)
- Characterization of recognizable trace languages by distributed automata (Q3975164) (← links)
- (Q4721652) (← links)
- RECOGNIZABLE AND LOGICALLY DEFINABLE LANGUAGES OF INFINITE COMPUTATIONS IN CONCURRENT AUTOMATA (Q5248980) (← links)
- FSTTCS 2004: Foundations of Software Technology and Theoretical Computer Science (Q5465887) (← links)
- Process-commutative distributed objects: from cryptocurrencies to Byzantine-fault-tolerant CRDTs (Q6614029) (← links)