Show simple item record

dc.contributor.authorSaboori, A.en
dc.contributor.authorHadjicostis, Christoforos N.en
dc.creatorSaboori, A.en
dc.creatorHadjicostis, Christoforos N.en
dc.date.accessioned2019-04-08T07:48:14Z
dc.date.available2019-04-08T07:48:14Z
dc.date.issued2010
dc.identifier.isbn978-3-902661-79-1
dc.identifier.urihttp://gnosis.library.ucy.ac.cy/handle/7/44829
dc.description.abstractIn this paper, we propose and analyze reduced-complexity methodologies for verifying initial-state opacity in modular discrete event systems. Initial-state opacity requires that the membership of the system initial state to a given set of secret states S remains opaque (uncertain) to an intruder who has complete knowledge of the system model and observes system activity through some natural projection map. In the modular setting we consider, the given system is modeled as a composition (synchronous product) of M modules -G1,G 2,., GM} where each module Gi is a non-deterministic finite automaton with Ni states with the set of secret states S is of the form S = {(x1, x2,., xM)|x i ε Si}, where Si is the set of secret states for module Gi. Assuming that the pairwise shared events are pairwise observable and that the intruder observes events that are observable in at least one module, we provide a modular algorithm for verifying initial-state opacity with O(MNM-12N2) state and time complexity, where N = maxi Ni. This is a considerable reduction compared to the O(2(NM)2 ) state and time complexity of the centralized verification method, which verifies initial-state opacity by considering the composed system as a monolithic system.en
dc.sourceIFAC Proceedings Volumes (IFAC-PapersOnline)en
dc.sourceIFAC Proceedings Volumes (IFAC-PapersOnline)en
dc.source.urihttps://www.scopus.com/inward/record.uri?eid=2-s2.0-80051954253&partnerID=40&md5=11794e494ef5d4282afc44f22f82fa2c
dc.subjectDiscrete event systemsen
dc.subjectFinite automataen
dc.subjectInitial stateen
dc.subjectNatural projectionsen
dc.subjectNondeterministic finite automatonen
dc.subjectOpacityen
dc.subjectAutomataen
dc.subjectSystem modelsen
dc.subjectVerification methoden
dc.subjectManganese compoundsen
dc.subjectModular algorithmsen
dc.subjectModular methodsen
dc.subjectMonolithic systemsen
dc.subjectReduced-complexityen
dc.subjectSynchronous productsen
dc.subjectTime complexityen
dc.titleReduced-complexity verification for initial-state opacity in modular discrete event systemsen
dc.typeinfo:eu-repo/semantics/conferenceObject
dc.description.volume10
dc.description.startingpage78
dc.description.endingpage83
dc.author.facultyΠολυτεχνική Σχολή / Faculty of Engineering
dc.author.departmentΤμήμα Ηλεκτρολόγων Μηχανικών και Μηχανικών Υπολογιστών / Department of Electrical and Computer Engineering
dc.type.uhtypeConference Objecten
dc.contributor.orcidHadjicostis, Christoforos N. [0000-0002-1706-708X]
dc.gnosis.orcid0000-0002-1706-708X


Files in this item

FilesSizeFormatView

There are no files associated with this item.

This item appears in the following Collection(s)

Show simple item record