• English
    • Ελληνικά
  • English 
    • English
    • Ελληνικά
  • Login
Browsing by Subject 
  •   Home
  • Browsing by Subject
  •   Home
  • Browsing by Subject
JavaScript is disabled for your browser. Some features of this site may not work without it.

Browsing by Subject "Automata"

  • 0-9
  • Α
  • Β
  • Γ
  • Δ
  • Ε
  • Ζ
  • Η
  • Θ
  • Ι
  • Κ
  • Λ
  • Μ
  • Ν
  • Ξ
  • Ο
  • Π
  • Ρ
  • Σ
  • Τ
  • Υ
  • Φ
  • Χ
  • Ψ
  • Ω
  • A
  • B
  • C
  • D
  • E
  • F
  • G
  • H
  • I
  • J
  • K
  • L
  • M
  • N
  • O
  • P
  • Q
  • R
  • S
  • T
  • U
  • V
  • W
  • X
  • Y
  • Z

Sort by:

Order:

Results:

Now showing items 1-6 of 6

  • title
  • submit date
  • accessioned date
  • ascending
  • descending
  • 5
  • 10
  • 20
  • 40
  • 60
  • 80
  • 100
    • Article  

      Current-state opacity formulations in probabilistic finite automata 

      Saboori, A.; Hadjicostis, Christoforos N. (2014)
      A system is said to be current-state opaque if the entrance of the system state to a set of secret states remains opaque (uncertain) to an intruder - at least until the system leaves the set of secret states. This notion ...

    • Article  

      Distributed Fault Diagnosis in Discrete Event Systems via Set Intersection Refinements 

      Keroglou, C.; Hadjicostis, Christoforos N. (2018)
      We extend and verify diagnosability for a class of set intersection refinement strategies, which can be used for distributed state estimation and fault diagnosis in nondeterministic finite automata that are observed at ...

    • Article  

      Fault-tolerant computation in groups and semigroups: Applications to automata, dynamic systems and Petri nets 

      Hadjicostis, Christoforos N.; Verghese, G. C. (2002)
      The traditional approach to fault-tolerant computation has been via modular hardware redundancy. Although universal and simple, modular redundancy is inherently expensive and inefficient. By exploiting particular structural ...

    • Article  

      A multiply hierarchical automaton semantics for the IWIM coordination model 

      Banach, Richard; Arbab, Farhad; Papadopoulos, George Angelos; Glauert, J. R. W. (2003)
      The drawbacks of programming coordination activities directly within the applications software that needs them are briefly reviewed. Coordination programming helps to separate concerns, making complex coordination protocols ...

    • Conference Object  

      Opacity formulations and verification in discrete event systems 

      Hadjicostis, Christoforos N.; Keroglou, C. (Institute of Electrical and Electronics Engineers Inc., 2014)
      In many emerging security applications, a property of a system, that may reveal important details about its behaviour, needs to be kept secret (opaque) to outside observers (intruders). Motivated by such applications, ...

    • Conference Object  

      Reduced-complexity verification for initial-state opacity in modular discrete event systems 

      Saboori, A.; Hadjicostis, Christoforos N. (2010)
      In 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 ...

      Browse

      EverywhereCommunities & CollectionsBy Submission DateAuthorsTitlesSubjectsBy TypeBy DepartmentBy Faculty

      My Account

      Login
      Πνευματικά δικαιώματα ©  Βιβλιοθήκη Πανεπιστημίου Κύπρου
      Contact Us | Send Feedback
      Οδηγίες κατάθεσης διδακτορικής διατριβής
      Open Access
      ORCiD