Pages that link to "Item:Q5887511"
From MaRDI portal
The following pages link to Connections between a concrete and an abstract model of concurrent systems (Q5887511):
Displaying 11 items.
- Recognizable languages in concurrency monoids (Q672317) (← links)
- Representation of computations in concurrent automata by dependence orders (Q1269906) (← links)
- Stable trace automata vs. full trace automata (Q1276249) (← links)
- Context-free event domains are recognizable (Q1286370) (← links)
- Labelled domains and automata with concurrency (Q1346626) (← links)
- A counterexample to Thiagarajan's conjecture on regular event structures (Q2186822) (← links)
- Twenty Years on: Reflections on the CEDISYS Project. Combining True Concurrency with Process Algebra (Q3507401) (← links)
- From domains to automata with concurrency (Q4630301) (← links)
- A kleene theorem for recognizable languages over concurrency monoids (Q4632442) (← links)
- On relating rewriting systems and graph grammars to event structures (Q5096291) (← links)
- Context-free event domains are recognizable (Q5096387) (← links)
