Trajectory detectability of discrete-event systems (Q1729041): Difference between revisions

From MaRDI portal

Jump to:navigation, search

Latest revision as of 17:30, 14 September 2024

scientific article

Language	Label	Description	Also known as
English	Trajectory detectability of discrete-event systems	scientific article

Statements

scholarly article

0 references

Trajectory detectability of discrete-event systems (English)

0 references

0 references

0 references

0 references

Systems \& Control Letters

0 references

publication date

27 February 2019

0 references

zbMATH Keywords

discrete-event systems

0 references

trajectory estimation

0 references

detectability

0 references

describes a project that uses

0 references

MaRDI profile type

MaRDI publication profile

0 references

full work available at URL

https://doi.org/10.1016/j.sysconle.2018.07.008

0 references

Observability of discrete event dynamic systems

0 references

An algorithm for calculating indistinguishable states and clusters in finite-state automata with partially observable transitions

0 references

Detectability of Discrete Event Systems

0 references

Detectability of discrete event systems with dynamic event observation

0 references

On observability of discrete-event systems

0 references

Generalized detectability for discrete event systems

0 references

Detectability in stochastic discrete event systems

0 references

Initial-state detectability of stochastic discrete-event systems with probabilistic sensor failures

0 references

The problem of determining the weak (periodic) detectability of discrete event systems is PSPACE-complete

0 references

Complexity of deciding detectability in discrete event systems

0 references

Verification complexity of a class of observational properties for modular discrete events systems

0 references

Enforcing Detectability in Controlled Discrete Event Systems

0 references

A Uniform Approach for Synthesizing Property-Enforcing Supervisors for Partially-Observed Discrete-Event Systems

0 references

Observable graphs

0 references

A polynomial algorithm for testing diagnosability of discrete-event systems

0 references

Polynomial-time verification of diagnosability of partially observed discrete-event systems

0 references

Invertibility of discrete-event dynamic systems

0 references

Introduction to Discrete Event Systems

0 references

Opacity of discrete event systems and its applications

0 references

On the Decidability and Complexity of Diagnosability for Labeled Petri Nets

0 references

Codiagnosability and coobservability under dynamic observations: transformation and verification

0 references

Minimal sensor activation and minimal communication in discrete-event systems

0 references

Verification of Codiagnosability for Discrete Event Systems Modeled by Mealy Automata With Nondeterministic Output Functions

0 references

Nonblocking Supervisory Control of Discrete Event Systems Modeled by Mealy Automata With Nondeterministic Output Functions

0 references

Supervisor Synthesis for Mealy Automata With Output Functions: A Model Transformation Approach

0 references

Identifiers

zbMATH Open document ID

0 references

10.1016/j.sysconle.2018.07.008

0 references

Mathematics Subject Classification ID

0 references

0 references

zbMATH DE Number

0 references

0 references

0 references

Sitelinks

Mathematics(1 entry)

mardi Publication:1729041

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q1729041&oldid=37837551"