scientific article; zbMATH DE number 1232246

MaRDI QIDQ4223072zbMATH OpenFDO

Authors Jitka Stříbrná

Publication date 3 January 1999

zbMATH Keywords

decidabilityGröbner basesHilbert's basis theorem

Mathematics Subject Classification ID

Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20)

Recommendations

• scientific article; zbMATH DE number 1701362
• scientific article; zbMATH DE number 1670835
• A polynomial-time algorithm for deciding bisimulation equivalence of normed Basic Parallel Processes
• Non-interleaving bisimulation equivalences on basic parallel processes
• Approximating weak bisimilarity of basic parallel processes
• Strong bisimilarity of simple process algebras: Complexity lower bounds
• scientific article; zbMATH DE number 2086414
• A short proof of the decidability of bisimulation for normed BPA- processes
• On the parallel complexity of bisimulation on finite systems
• Decidability of bisimulation equivalence for normed pushdown processes

Cited in

(4)

• Non-interleaving bisimulation equivalences on basic parallel processes
• More on Weak Bisimilarity of Normed Basic Parallel Processes
• scientific article; zbMATH DE number 2086414 (Why is no real title available?)
• Equivariant ideals of polynomials

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 Q4223072)