Entscheidbarkeit bei Petri Netzen

DOI10.1007/978-3-540-85471-5zbMath1169.68034OpenAlexW4247181604MaRDI QIDQ3521157

Harro Wimmel

Publication date: 28 August 2008

Published in: eXamen.press (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-540-85471-5

zbMATH Keywords

Petri netsreachability problem

Mathematics Subject Classification ID

Introductory exposition (textbooks, tutorial papers, etc.) pertaining to computer science (68-01) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85) Word problems, etc. in computability and recursion theory (03D40)

Related Items (3)

Existence of home states in Petri nets is decidable ⋮ Deciding Structural Liveness of Petri Nets ⋮ Finding a Witness Path for Non-liveness in Free-Choice Nets

This page was built for publication: Entscheidbarkeit bei Petri Netzen