scientific article; zbMATH DE number 1560298

zbMATH Open0964.03040MaRDI QIDQ4527145

Zakaria Bouziane, Alain Finkel

Publication date: 16 July 2001

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

zbMATH Keywords

word problemlower boundThue systemsemigroup presentationEXPSPACE-completecommutative semigroups and reversible Petri nets equivalence problem

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Commutative semigroups (20M14) Free semigroups, generators and relations, word problems (20M05) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85) Complexity of computation (including implicit computational complexity) (03D15) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Word problems, etc. in computability and recursion theory (03D40) Thue and Post systems, etc. (03D03)

Recommendations

• Completeness results for linear logic on Petri nets 👍 👎
• Semi-commutations and Petri nets 👍 👎
• The completeness of linear logic for Petri net models 👍 👎
• Complexity results for problems of communication-free Petri nets and related formalisms 👍 👎
• Petri Nets and Semilinear Sets (Extended Abstract) 👍 👎
• On the reachability and reversibility problems in a class of Petri nets 👍 👎
• Nonprimitive recursive complexity and undecidability for Petri net equivalences 👍 👎
• Title not available (Why is that?) 👍 👎
• Title not available (Why is that?) 👍 👎
• Title not available (Why is that?) 👍 👎

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