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

Fundamenta Informaticae - Netherlands
doi 10.3233/fi-2018-1708
Full Text
Abstract

Available in full text

Date
Authors
Publisher

IOS Press

Related search

Time-Independent Liveness in Time Petri Nets

Fundamenta Informaticae
Information SystemsAlgebraNumber TheoryMathematicsComputational TheoryTheoretical Computer Science
2010English

On the Reversibility of Live Equal-Conflict Petri Nets

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2015English

Parameterized Complexity and Approximability of Coverability Problems in Weighted Petri Nets

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2017English

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

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

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

On Minimality and Equivalence of Petri Nets

Fundamenta Informaticae
Information SystemsAlgebraNumber TheoryMathematicsComputational TheoryTheoretical Computer Science
2013English

On Categories of Fuzzy Petri Nets

Advances in Fuzzy Systems
ControlComputational MathematicsOptimizationSystems Engineering
2011English

The Recursive Equivalence of the Reachability Problem and the Liveness Problem for Petri Nets and Vector Addition Systems

1974English

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