Parameterized Complexity and Approximability of Coverability Problems in Weighted Petri Nets

Lecture Notes in Computer Science - Germany
doi 10.1007/978-3-319-57861-3_19
Full Text
Abstract

Available in full text

Date
Authors
Publisher

Springer International Publishing

Related search

Parameterized Complexity and Approximability of Directed Odd Cycle Transversal

2020English

Complexity Analysis of Continuous Petri Nets

Fundamenta Informaticae
Information SystemsAlgebraNumber TheoryMathematicsComputational TheoryTheoretical Computer Science
2015English

Petri Nets Properties Related to the Unboundness and Analyzed Using Coverability Multigraph

Journal of Applied Mathematics, Statistics and Informatics
2014English

Minimal Coverability Set for Petri Nets: Karp and Miller Algorithm With Pruning

Fundamenta Informaticae
Information SystemsAlgebraNumber TheoryMathematicsComputational TheoryTheoretical Computer Science
2013English

Correction To: Weighted Upper Edge Cover: Complexity and Approximability

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2019English

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

Fundamenta Informaticae
Information SystemsAlgebraNumber TheoryMathematicsComputational TheoryTheoretical Computer Science
2018English

The Complexity of Diagnosability and Opacity Verification for Petri Nets

Fundamenta Informaticae
Information SystemsAlgebraNumber TheoryMathematicsComputational TheoryTheoretical Computer Science
2018English

On Miniaturized Problems in Parameterized Complexity Theory

Theoretical Computer Science
Computer ScienceTheoretical Computer Science
2006English

On the Space Complexity of Parameterized Problems

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2012English

Amanote Research

Note-taking for researchers

Follow Amanote

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

Privacy PolicyRefund Policy