Probabilistic Marking Estimation in Labeled Petri Nets

DOI10.1109/TAC.2014.2343373MaRDI QIDQ2982861zbMATH OpenOpenAlexFDO

Authors Maria Paola Cabasino, Christoforos N. Hadjicostis, C. Seatzu

Publication date 16 May 2017

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

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

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Discrete event control/observation systems (93C65)

Recommendations

• Marking Estimation in a Class of Time Labeled Petri Nets
• Marking Predictability and Prediction in Labeled Petri Nets
• Marking Estimation in Petri Nets Using Hierarchical Basis Reachability Graphs
• Minimum Initial Marking Estimation in Labeled Petri Nets
• Marking diagnosability verification in labeled Petri nets
• Marking Estimation of Petri Nets With Silent Transitions
• scientific article; zbMATH DE number 6936874
• Probabilistic model checking of labelled Markov processes via finite approximate bisimulations
• Marking Observer in Labeled Petri Nets With Application to Supervisory Control
• scientific article; zbMATH DE number 5033888

Cited in

(6)

• Design of supervisors for linear marking specifications in labeled Petri nets
• Modeling, simulation, estimation and boundedness analysis of discrete event systems
• Initial-state detectability of stochastic discrete-event systems with probabilistic sensor failures
• Marking diagnosability verification in labeled Petri nets
• State estimation in labeled time Petri net systems using observed modified state class graph
• Quantifying opacity of discrete event systems modeled with probabilistic Petri nets

This page was built for publication: Probabilistic Marking Estimation in Labeled Petri Nets

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