On the undecidability of deadlock detection in families of nets

DOI10.1007/3-540-59042-0_98MaRDI QIDQ4596646zbMATH OpenOpenAlexFDO

Authors Anne-Cécile Fabret, A. Petit

Publication date 4 December 2017

Published in STACS 95 (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/3-540-59042-0_98

Mathematics Subject Classification ID

Network design and communication in computer systems (68M10) Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10)

Recommendations

• scientific article; zbMATH DE number 176516
• On the complexity of deadlock detection in families of planar nets
• Deadlock detection-oriented unfolding of unbounded Petri nets
• scientific article; zbMATH DE number 177520
• scientific article; zbMATH DE number 177258
• Deadlock analysis of unbounded process networks
• Deadlock analysis of unbounded process networks
• Publication:4727428
• scientific article; zbMATH DE number 4043216
• Deadlock Analysis of Parameterized-Chain Networks

Cited in

(4)

• On the complexity of deadlock detection in families of planar nets
• scientific article; zbMATH DE number 176516 (Why is no real title available?)
• DNA Computing
• Deadlock analysis of unbounded process networks

This page was built for publication: On the undecidability of deadlock detection in families of nets

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4596646)