Verification of Detectability for Unambiguous Weighted Automata

DOI10.1109/TAC.2020.2995173OpenAlexW3027342766MaRDI QIDQ4990197FDOQ4990197

Authors: Aiwen Lai, Sébastien Lahaye, Alessandro Giua 

Publication date: 28 May 2021

Published in: IEEE Transactions on Automatic Control (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1109/tac.2020.2995173

Mathematics Subject Classification ID

Systems theory; control (93-XX)

Cited In (6)

• State estimation for constant-time labeled automata under dense time
• Behaviour equivalent max-plus automata for timed Petri nets under open-loop race-policy semantics
• Initial-state detectability and initial-state opacity of unambiguous weighted automata
• Detectability of labeled weighted automata over monoids
• Title not available (Why is that?)
• On the verification of detectability for timed discrete event systems

This page was built for publication: Verification of Detectability for Unambiguous Weighted Automata

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