The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
It is proposed to compare strategies in a parity game by comparing the sets of behaviours they allow. For such a game, there may be no winning strategy that encompasses all the behaviours of all winning strategies. It is shown, however, that there always exists a permissive strategy that encompasses all the behaviours of all memoryless strategies. An algorithm for finding such a permissive strategy is presented. Its complexity matches currently known upper bounds for the simpler problem of finding...
It is proposed to compare strategies in a parity game by comparing
the sets of behaviours they allow. For such a game, there may be no
winning strategy that encompasses all the behaviours of all winning
strategies. It is shown, however, that there always exists a
permissive strategy that encompasses all the behaviours of all
memoryless strategies. An algorithm for finding such a permissive
strategy is presented. Its complexity matches currently known upper
bounds for the simpler problem...
Download Results (CSV)