Please use this identifier to cite or link to this item:
http://dspace.bits-pilani.ac.in:8080/jspui/handle/123456789/8388
Full metadata record
DC Field | Value | Language |
---|---|---|
dc.contributor.author | Kumar, Rajesh | - |
dc.date.accessioned | 2023-01-09T07:08:19Z | - |
dc.date.available | 2023-01-09T07:08:19Z | - |
dc.date.issued | 2022-06 | - |
dc.identifier.uri | https://link.springer.com/chapter/10.1007/978-3-031-08679-3_6 | - |
dc.identifier.uri | http://dspace.bits-pilani.ac.in:8080/xmlui/handle/123456789/8388 | - |
dc.description.abstract | In this journal-first paper, we present an overview of our novel formalism of Attack-Fault-Maintenance Trees (AFMTs). Detailed version of work is available in [3]. AFMTs enable practitioners to quantify the disruption scenarios by answering several safety-security metrics. Alongside, it provides an informed decision on optimal maintenance policies by suggesting preventive component repairs and inspection frequencies. We answer the aforementioned metrics through “what-if” and “scenario analysis”. The models are supported by a graphical friendly tool of PASST. The tool’s front-end is a drawing canvas that provides the different syntactic elements used to design a well-formed AFMT model. The back-end of the tool is based on the statistical-model checking techniques. From the practitioner perspective, once the AFMT is designed and input parameters on component failure, detection rates, inspection rates are provided, the entire analysis can be then done as push-button technology using model-checking techniques | en_US |
dc.language.iso | en | en_US |
dc.publisher | Springer | en_US |
dc.subject | Computer Science | en_US |
dc.subject | Attack-Fault-Maintenance Trees (AFMTs) | en_US |
dc.title | Co-engineering Safety-Security Using Statistical Model Checking | en_US |
dc.type | Article | en_US |
Appears in Collections: | Department of Computer Science and Information Systems |
Files in This Item:
There are no files associated with this item.
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.