The following pages link to CONCURRENT AUTOMATA AND DOMAINS (Q4032921):
Displaying 13 items.
- Model-checking games for fixpoint logics with partial order models (Q532389) (← links)
- Models for concurrency: Towards a classification (Q672053) (← links)
- Recognizable languages in concurrency monoids (Q672317) (← links)
- A Nice labelling for tree-like event structures of degree 3 (Q979077) (← links)
- Representation of computations in concurrent automata by dependence orders (Q1269906) (← links)
- Labelled domains and automata with concurrency (Q1346626) (← links)
- The topology of Mazurkiewicz traces. (Q1427782) (← links)
- Automata for true concurrency properties (Q1652979) (← links)
- Concurrent semantics for fusions: weak prime domains and connected event structures (Q2051794) (← links)
- From domains to automata with concurrency (Q4630301) (← links)
- A kleene theorem for recognizable languages over concurrency monoids (Q4632442) (← links)
- RECOGNIZABLE AND LOGICALLY DEFINABLE LANGUAGES OF INFINITE COMPUTATIONS IN CONCURRENT AUTOMATA (Q5248980) (← links)
- Languages and logical definability in concurrency monoids (Q6560171) (← links)
