The Complexity of Codiagnosability for Discrete Event and Timed Systems
From MaRDI portal
Publication:4931284
DOI10.1007/978-3-642-15643-4_8zbMath1305.68111arXiv1004.2550OpenAlexW1490074134MaRDI QIDQ4931284
Publication date: 4 October 2010
Published in: Automated Technology for Verification and Analysis (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1004.2550
Formal languages and automata (68Q45) Discrete event control/observation systems (93C65) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Reliability, testing and fault tolerance of networks and computer systems (68M15)
Related Items (1)
This page was built for publication: The Complexity of Codiagnosability for Discrete Event and Timed Systems
