Open AccessThe Complexity of Diagnosability and Opacity Verification for Petri Nets
Author(s) -
Béatrice Bérard,
Stefan Haar,
Sylvain Schmitz,
Stefan Schwoon
Publication year - 2018
Publication title -
fundamenta informaticae
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.311
H-Index - 67
eISSN - 1875-8681
pISSN - 0169-2968
DOI - 10.3233/fi-2018-1706
Subject(s) - petri net , undecidable problem , reachability , process architecture , computer science , reachability problem , theoretical computer science , automaton , decidability , stochastic petri net , opacity , discrete mathematics , algorithm , mathematics , physics , optics
Diagnosability and opacity are two well-studied problems in discrete-event systems. We revisit these two problems with respect to expressiveness and complexity issues.
Accelerating Research
Robert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom
Address
John Eccles HouseRobert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom