Sumit Nain

Yoad Lustig

Log. Methods Comput. Sci., 2014

The Complexity of Partial-Observation Stochastic Parity Games with Finite-Memory Strategies.

[BibT_eX]

[DOI]

Krishnendu Chatterjee

Laurent Doyen

Proceedings of the Foundations of Software Science and Computation Structures, 2014

2013

Solving Partial-Information Stochastic Parity Games.

[BibT_eX]

[DOI]

Proceedings of the 28th Annual ACM/IEEE Symposium on Logic in Computer Science, 2013

2012

Synthesizing Probabilistic Composers.

[BibT_eX]

[DOI]

Proceedings of the Foundations of Software Science and Computational Structures, 2012

2009

Trace Semantics is Fully Abstract.

[BibT_eX]

[DOI]

Proceedings of the 24th Annual IEEE Symposium on Logic in Computer Science, 2009

2008

On finite alphabets and infinite bases.

[BibT_eX]

[DOI]

Inf. Comput., 2008

2007

Branching vs. Linear Time: Semantical Perspective.

[BibT_eX]

[DOI]

Proceedings of the Automated Technology for Verification and Analysis, 2007

2006

Bisimilarity is not finitely based over BPA with interrupt.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2006

On Finite Alphabets and Infinite Bases II: Completed and Ready Simulation.

[BibT_eX]

[DOI]

Taolue Chen

Proceedings of the Foundations of Software Science and Computation Structures, 2006

2005

A Finite Basis for Failure Semantics.

[BibT_eX]

[DOI]

Proceedings of the Automata, Languages and Programming, 32nd International Colloquium, 2005

2004

On Finite Alphabets and Infinite Bases: From Ready Pairs to Possible Worlds.

[BibT_eX]

[DOI]

Proceedings of the Foundations of Software Science and Computation Structures, 2004

2003

On the Axiomatizability of Ready Traces, Ready Simulation, and Failure Traces.

[BibT_eX]

[DOI]

Stefan Blom