A new polynomial-time algorithm for linear programming
Combinatorica
Model checking and modular verification
ACM Transactions on Programming Languages and Systems (TOPLAS)
Modeling and verification of randomized distributed real-time systems
Modeling and verification of randomized distributed real-time systems
Deciding bisimilarity and similarity for probabilistic processes
Journal of Computer and System Sciences
Alternating-time temporal logic
Journal of the ACM (JACM)
ACM Transactions on Computational Logic (TOCL)
Probabilistic simulations for probabilistic processes
Nordic Journal of Computing
TACAS 2001 Proceedings of the 7th International Conference on Tools and Algorithms for the Construction and Analysis of Systems
Decision Algorithms for Probabilistic Bisimulation
CONCUR '02 Proceedings of the 13th International Conference on Concurrency Theory
Design and Synthesis of Synchronization Skeletons Using Branching-Time Temporal Logic
Logic of Programs, Workshop
Alternating Refinement Relations
CONCUR '98 Proceedings of the 9th International Conference on Concurrency Theory
Computing simulations on finite and infinite graphs
FOCS '95 Proceedings of the 36th Annual Symposium on Foundations of Computer Science
FOCS '98 Proceedings of the 39th Annual Symposium on Foundations of Computer Science
From Bisimulation to Simulation: Coarsest Partition Problems
Journal of Automated Reasoning
Quantitative solution of omega-regular games
Journal of Computer and System Sciences - STOC 2001
The complexity of quantitative concurrent parity games
SODA '06 Proceedings of the seventeenth annual ACM-SIAM symposium on Discrete algorithm
A New Efficient Simulation Equivalence Algorithm
LICS '07 Proceedings of the 22nd Annual IEEE Symposium on Logic in Computer Science
Correcting a Space-Efficient Simulation Algorithm
CAV '08 Proceedings of the 20th international conference on Computer Aided Verification
A Space-Efficient Probabilistic Simulation Algorithm
CONCUR '08 Proceedings of the 19th international conference on Concurrency Theory
| Hi-index | 0.00 |
In probabilistic game structures, probabilistic alternating simulation (PA-simulation) relations preserve formulas defined in probabilistic alternating-time temporal logic with respect to the behaviour of a subset of players. We propose a partition based algorithm for computing the largest PA-simulation. It is to our knowledge the first such algorithm that works in polynomial time. Our solution extends the generalised coarsest partition problem (GCPP) to a game-based setting with mixed strategies. The algorithm has higher complexities than those in the literature for non-probabilistic simulation and probabilistic simulation without mixed actions, but slightly improves the existing result for computing probabilistic simulation with respect to mixed actions.