scientific article; zbMATH DE number 1114007

MaRDI QIDQ4375775zbMATH OpenFDO

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

Publication date 13 July 1998

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)

Recommendations

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

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)