Matrix approach to model matching of composite asynchronous sequential machines

DOI10.1049/IET-CTA.2016.1651MaRDI QIDQ6920067zbMATH OpenFDO

Authors Biao Wang, Jun-e Feng, Min Meng

Publication date 8 October 2025

Published in IET Control Theory \& Applications (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1049/IET-CTA.2016.1651

zbMATH Keywords

algebraic expressioncomposite ASMcomposite asynchronous sequential machinescontrol system synthesiscontroller designinput-state asynchronous machinesmatrix algebramatrix-based approachmodel matchingnecessary and sufficient conditionpattern matchingreachabilityreachability analysissemitensor product methodsequential machinestensors

Mathematics Subject Classification ID

Attainable sets, reachability (93B03) Algebraic methods (93B25)

Cites work

• A Linear Representation of Dynamics of Boolean Networks
• An introduction to semi-tensor product of matrices and its applications
• Analysis and control of Boolean networks. A semi-tensor product approach.
• Boolean derivative calculation with application to fault detection of combinational circuits via the semi-tensor product method
• Codes from incidence matrices of graphs
• Concurrent Error Detection Methods for Asynchronous Burst-Mode Machines
• Corrective Control of Composite Asynchronous Sequential Machines Under Partial Observation
• Formulation and optimization control of a class of networked evolutionary games with switched topologies
• scientific article; zbMATH DE number 3266653 (Why is no real title available?)
• scientific article; zbMATH DE number 3282328 (Why is no real title available?)
• Input-state incidence matrix of Boolean control networks and its applications
• Input/output control of asynchronous sequential machines
• Matrix Approach to Model Matching of Asynchronous Sequential Machines
• Model matching for finite-state machines
• Model matching inclusion for input/state asynchronous sequential machines
• Modeling, Analysis and Control of Networked Evolutionary Games
• On reachability and controllability of switched Boolean control networks
• On the control of asynchronous machines with races
• On the control of asynchronous sequential machines with infinite cycles
• On the existence of minimum asynchronous automata and on the equivalence problem for unambiguous regular trace languages
• Semi-tensor product of matrices and its application to Morgen's problem

Cited in

(1)

• Attack-resilient corrective control of nondeterministic asynchronous sequential machines and its application to a space-borne digital system

This page was built for publication: Matrix approach to model matching of composite asynchronous sequential machines

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