scientific article; zbMATH DE number 1114007

zbMATH Open0891.68059MaRDI QIDQ4375775FDOQ4375775

Authors: Sandeep Kumar Shukla, R. E. Stearns, Daniel J. Rosenkrantz, H. B. III Hunt 

Publication date: 13 July 1998

Title of this publication is not available (Why is that?)

Recommendations

• scientific article; zbMATH DE number 1927588
• Simulation preorder over simple process algebras
• Item:QQ2453984
• Bisimulation equivalence of a BPP and a finite-state system can be decided in polynomial time
• An efficient simulation algorithm based on abstract interpretation

zbMATH Keywords

bisimulation equivalencebottom-up algorithmpolynomial time decidability

Mathematics Subject Classification ID

Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10) Classical propositional logic (03B05) Specification and verification (program logics, model checking, etc.) (68Q60)

Cited In (1)

• Nested semantics over finite trees are equationally hard

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4375775)