Pages that link to "Item:Q1269906"
From MaRDI portal
The following pages link to Representation of computations in concurrent automata by dependence orders (Q1269906):
Displaying 11 items.
- Recognizable languages in concurrency monoids (Q672317) (← links)
- Synchronization expressions with extended join operation (Q1274985) (← links)
- Labelled domains and automata with concurrency (Q1346626) (← links)
- Exposing latent mutual exclusion by work automata (Q1698757) (← links)
- Shared-Memory Systems and Charts (Q3007636) (← links)
- MSO Logic for Unambiguous Shared-Memory Systems (Q3533037) (← links)
- (Q3768388) (← links)
- CONCURRENT AUTOMATA AND DOMAINS (Q4032921) (← links)
- Topology for Computations of Concurrent Automata (Q4354233) (← links)
- RECOGNIZABLE AND LOGICALLY DEFINABLE LANGUAGES OF INFINITE COMPUTATIONS IN CONCURRENT AUTOMATA (Q5248980) (← links)
- Synthesis of Safe Message-Passing Systems (Q5458841) (← links)