Pages that link to "Item:Q5180826"
From MaRDI portal
The following pages link to Parallel Program Schemata and Maximal Parallelism I. Fundamental Results (Q5180826):
Displayed 16 items.
- Pure future local temporal logics are expressively complete for Mazurkiewicz traces (Q859824) (← links)
- Polynomials, fragments of temporal logic and the variety DA over traces (Q880176) (← links)
- Maximal serializability of iterated transactions (Q1062471) (← links)
- Serialization of concurrent programs (Q1124386) (← links)
- Methods and means of parallel processing of information (Q1155954) (← links)
- Functional behavior in data spaces (Q1244988) (← links)
- Local temporal logic is expressively complete for cograph dependence alphabets (Q1763374) (← links)
- Solving word equations modulo partial commutations (Q1960424) (← links)
- From local to global temporal logics over Mazurkiewicz traces. (Q2490814) (← links)
- Efficient solution of some problems in free partially commutative monoids (Q2640345) (← links)
- SOLVABILITY OF EQUATIONS IN GRAPH GROUPS IS DECIDABLE (Q3430310) (← links)
- Une approche quantitative de l'exclusion mutuelle (Q3738552) (← links)
- Encoding of parallel program schemata by vector addition systems (Q3854605) (← links)
- (Q3856087) (← links)
- Functional systems: Theoretical and practical aspects (Q3886853) (← links)
- Livelocks in parallel programs (Q5904921) (← links)
