scientific article
From MaRDI portal
Publication:3766867
zbMath0629.68065MaRDI QIDQ3766867
Publication date: 1987
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
boundednessreachabilitylivenesslower boundsPetri net languagecoverabilitycomplexity of decision problemscomplete problemscomplexity classweak Petri net computer
Analysis of algorithms and problem complexity (68Q25) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)
Related Items (7)
Forward analysis and model checking for trace bounded WSTS ⋮ Deadlocks and traps in Petri nets as Horn-satisfiability solutions and some related polynomially solvable problems ⋮ On selective unboundedness of VASS ⋮ Regular marked Petri nets ⋮ Some behavioural aspects of net theory ⋮ Proving nonreachability by modulo-invariants ⋮ Unnamed Item
This page was built for publication:
