Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

136

Voted

BIRTHDAY
2003
Springer

103views Applied Computing» more BIRTHDAY 2003»

On the Computational Complexity of Bisimulation, Redux

16 years 19 days ago

On the Computational Complexity of Bisimulation, Redux

Download www.cs.sunysb.edu

Faron Moller, Scott A. Smolka

Real-time Traffic

Applied Computing | BIRTHDAY 2003 |

claim paper

Related Content

» On the complexity of checking semantic equivalences between pushdown processes and finites...

» Pfaffian Hybrid Systems

» Weak Bisimulation for Probabilistic Systems

» Decomposition and Complexity of Hereditary History Preserving Bisimulation on BPP

» On the Computational Complexity of Verifying OneCounter Processes

» Distributed Markovian Bisimulation Reduction aimed at CSL Model Checking

» Recursive Petri nets

» Linear and Branching Metrics for Quantitative Transition Systems

» PartiallyCommutative ContextFree Processes

Post Info
More Details (n/a)

Added	06 Jul 2010
Updated	06 Jul 2010
Type	Conference
Year	2003
Where	BIRTHDAY
Authors	Faron Moller, Scott A. Smolka

Comments (0)