The Complexity of Diagnosability and Opacity Verification for Petri Nets

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

Available in full text

Date
Authors
Publisher

IOS Press

Related search

Optimal Sensor Selection for Ensuring Diagnosability in Labeled Bounded Petri Nets

IFAC Proceedings Volumes
2012English

Complexity Analysis of Continuous Petri Nets

Fundamenta Informaticae
Information SystemsAlgebraNumber TheoryMathematicsComputational TheoryTheoretical Computer Science
2015English

Towards Automated fUML Model Verification With Petri Nets

2019English

Petri Nets Compositional Modeling and Verification of Flexible Manufacturing Systems

2011English

Advances in Verification of Time Petri Nets and Timed Automata

Studies in Computational Intelligence
Artificial Intelligence
2006English

Timing Constraint Petri Nets and Their Schedulability Analysis and Verification

Ruan Jian Xue Bao/Journal of Software
Software
2007English

Parameterized Complexity and Approximability of Coverability Problems in Weighted Petri Nets

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2017English

Verification of Cloud Based Information Integration Architecture Using Colored Petri Nets

International Journal of Computer Network and Information Security
2018English

Verification of Analog/Mixed-Signal Circuits Using Labeled Hybrid Petri Nets

IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems
ElectricalSoftwareComputer GraphicsComputer-Aided DesignElectronic Engineering
2011English

Amanote Research

Note-taking for researchers

Follow Amanote

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

Privacy PolicyRefund Policy