Verification of Detectability for Unambiguous Weighted Automata

DOI10.1109/TAC.2020.2995173MaRDI QIDQ4990197zbMATH OpenOpenAlexFDO

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

(7)

• Behaviour equivalent max-plus automata for timed Petri nets under open-loop race-policy semantics
• Detectability of labeled weighted automata over monoids
• Initial-state detectability and initial-state opacity of unambiguous weighted automata
• scientific article; zbMATH DE number 1564050 (Why is no real title available?)
• On the verification of detectability for timed discrete event systems
• State estimation for constant-time labeled automata under dense time
• A unified algebraic construction for observer of nondeterministic finite state machines with ϵ -transitions

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)