The following pages link to (Q3835040):
Displaying 13 items.
- Undecidability of partial order logics (Q294640) (← links)
- A quadratic construction for Zielonka automata with acyclic communication structure (Q407518) (← links)
- Compositional synthesis of asynchronous automata (Q551202) (← links)
- Logical definability on infinite traces (Q672860) (← links)
- Recognizable trace languages, distributed automata and the distribution problem (Q1323363) (← links)
- Asynchronous automata versus asynchronous cellular automata (Q1334661) (← links)
- Asynchronous cellular automata for pomsets (Q1583242) (← links)
- MSO Logic for Unambiguous Shared-Memory Systems (Q3533037) (← links)
- Semantics of Deterministic Shared-Memory Systems (Q3541010) (← links)
- Determinizing asynchronous automata (Q4632421) (← links)
- Subclasses of recognizable trace languages (Q5096371) (← links)
- Asynchronous cellular automata for infinite traces (Q5204349) (← links)
- Synthesis of Safe Message-Passing Systems (Q5458841) (← links)
