On Supervisory Policies That Enforce Liveness in a Class of Completely Controlled Petri Nets Obtained via Refinement

IEEE Transactions on Automatic Control - United States
doi 10.1109/9.739118
Full Text
Abstract

Available in full text

Date
Authors
Publisher

Institute of Electrical and Electronics Engineers (IEEE)

Related search

Time-Independent Liveness in Time Petri Nets

Fundamenta Informaticae
Information SystemsAlgebraNumber TheoryMathematicsComputational TheoryTheoretical Computer Science
2010English

On Deadlockability, Liveness and Reversibility in Subclasses of Weighted Petri Nets

Fundamenta Informaticae
Information SystemsAlgebraNumber TheoryMathematicsComputational TheoryTheoretical Computer Science
2018English

Properties of Continuous Petri Nets Controlled via Model Predictive Control

2008English

A Class of Petri Nets That a Necessary and Sufficient Condition for Reachability Is Obtainable

Transactions of the Society of Instrument and Control Engineers
1988English

Stochastic Petri Nets Sensitivity to Token Scheduling Policies

Operations Research Proceedings 2010
2011English

Counterexamples to “Liveness-Enforcing Supervision of Bounded Ordinary Petri Nets Using Partial-Order Methods”

IEEE Transactions on Automatic Control
ControlSystems EngineeringComputer Science ApplicationsElectricalElectronic Engineering
2004English

From Many Places to Few: Automatic Abstraction Refinement for Petri Nets

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2007English

On Categories of Fuzzy Petri Nets

Advances in Fuzzy Systems
ControlComputational MathematicsOptimizationSystems Engineering
2011English

Supervisors of Petri Nets

Research Papers Faculty of Materials Science and Technology Slovak University of Technology
2019English

Amanote Research

Note-taking for researchers

Follow Amanote

© 2024 Amaplex Software S.P.R.L. All rights reserved.

Privacy PolicyRefund Policy