Posted: 21st December 2011

• Branching-Time Model Checking of Parametric One-Counter Automata. Stefan Göller, Christoph Haase, Joel Ouaknine and James Worrell.
• On the Complexity of the Equivalence Problem for Probabilistic Automata. Stefan Kiefer, Andrzej Murawski, Joel Ouaknine, Bjoern Wachter and James Worrell.
• On the Complexity of Computing Probabilistic Bisimilarity. Di Chen, Franck Van Breugel and James Worrell.

FoSSaCS is a member conference of the European Joint Conferences on Theory and Practice of Software (ETAPS), which is the primary European forum for academic and industrial researchers working on topics relating to Software Science.  This, the fifteenth conference will take place in Tallinn, Estonia in March.