On the undecidability of deadlock detection in families of nets

DOI10.1007/3-540-59042-0_98zbMath1379.68130OpenAlexW1496666854MaRDI QIDQ4596646

Anne-Cécile Fabret, Antoine 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)

Related Items (1)

On the complexity of deadlock detection in families of planar nets

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