Deadlocks and traps in Petri nets as Horn-satisfiability solutions and some related polynomially solvable problems
From MaRDI portal
Publication:2641226
Recommendations
Cites work
- A linear-time algorithm for testing the truth of certain quantified Boolean formulas
- A switching algorithm for the solution of quadratic Boolean equations
- Complete problems for deterministic polynomial time
- Complexity of some problems in Petri nets
- Composantes préconservatives minimales d'un réseau de Petri : étude structurelle
- Deterministic buffer synchronization of sequential processes
- HORNLOG: A graph-based interpreter for general Horn clauses
- scientific article; zbMATH DE number 3921988 (Why is no real title available?)
- scientific article; zbMATH DE number 3934416 (Why is no real title available?)
- scientific article; zbMATH DE number 4024802 (Why is no real title available?)
- scientific article; zbMATH DE number 4024806 (Why is no real title available?)
- scientific article; zbMATH DE number 3722109 (Why is no real title available?)
- scientific article; zbMATH DE number 3744562 (Why is no real title available?)
- scientific article; zbMATH DE number 3783030 (Why is no real title available?)
- scientific article; zbMATH DE number 3789841 (Why is no real title available?)
- scientific article; zbMATH DE number 3469993 (Why is no real title available?)
- scientific article; zbMATH DE number 3557247 (Why is no real title available?)
- scientific article; zbMATH DE number 3571502 (Why is no real title available?)
- scientific article; zbMATH DE number 3612450 (Why is no real title available?)
- scientific article; zbMATH DE number 3449757 (Why is no real title available?)
- scientific article; zbMATH DE number 3338381 (Why is no real title available?)
- Linear-time algorithms for testing the satisfiability of propositional horn formulae
- LTUR: A simplified linear-time unit resolution algorithm for Horn formulae and computer implementation
- Marked directed graphs
- On the Complexity of Timetable and Multicommodity Flow Problems
- The complexity of theorem-proving procedures
- The equality problem for vector addition systems is undecidable
- Unit Refutations and Horn Sets
Cited in
(12)- A polynomial-time algorithm to decide liveness of bounded free choice nets
- Efficient algorithms for three reachability problems in safe Petri nets
- On enumerating minimal siphons in Petri nets using CLP and SAT solvers: theoretical and practical complexity
- Detection of deadlocks and traps in Petri netsby means of Thelen's prime implicant method
- New algorithms for deciding the siphon-trap property
- scientific article; zbMATH DE number 3905852 (Why is no real title available?)
- scientific article; zbMATH DE number 3934416 (Why is no real title available?)
- scientific article; zbMATH DE number 1332966 (Why is no real title available?)
- scientific article; zbMATH DE number 1354143 (Why is no real title available?)
- scientific article; zbMATH DE number 867675 (Why is no real title available?)
- On liveness in extended non self-controlling nets
- Trapping mutual exclusion in the box calculus
This page was built for publication: Deadlocks and traps in Petri nets as Horn-satisfiability solutions and some related polynomially solvable problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2641226)
