## Modelling Relaxed Accesses

### Adwait Godbole

Work at IIT Bombay and Uppsala University, Sweden
under guidance of Profs. Krishna S., Parosh Abdulla and Faouzi Atig

### Concurrent Programs

A concurrent program has a set of processes $\mathcal{P}$ operating parallely

The processes have a local state and share a set of global variables $\mathcal{X}$

Processes may switch in and out of context (take turns on the CPU) possibly non-deterministically

**Population control problem** - can Controller synchronize $m$-Agents for arbitrary $m$; irrespective of choice of (non-deterministic) transitions Agents chooses?

## Possible Future Work

Probabilistic extensions of these systems - MDPs- may be used to model agents

NFAs are polynomial-time synchronizable. An interesting problem is to identify MDPs which are sub-polynomial - polylog-time synchronizable