• Article  

      Energy-based model reduction methodology for automated modeling 

      Louca, Loucas S.; Stein, J. L.; Hulbert, G. M. (2010)
      In recent years, algorithms have been developed to help automate the production of dynamic system models. Part of this effort has been the development of algorithms that use modeling metrics for generating minimum complexity ...
    • Conference Object  

      A model accuracy and validation algorithm 

      Sendur, P.; Stein, J. L.; Peng, H.; Louca, Loucas S. (American Society of Mechanical Engineers (ASME), 2002)
      Dynamic models of physical systems with physically meaningful states and parameters have become increasingly important, for design, control and even procurement decisions. The successful use of models in these contexts ...
    • Conference Object  

      Reachability analysis for a class of petri nets 

      Ru, Y.; Hadjicostis, Christoforos N. (2009)
      In this paper, we study the reachability problem for the class of (strictly) monotone Petri nets that we define based on algebraic conditions. More specifically, given a (strictly) monotone Petri net, an initial marking ...
    • 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 ...
    • Conference Object  

      Verification of infinite-step opacity and analysis of its complexity 

      Saboori, A.; Hadjicostis, Christoforos N. (2009)
      In this paper, we formulate, analyze, and devise methodologies to verify the notion of infinite-step opacity in discrete event systems that are modeled as (possibly non-deterministic) finite automata with partial observation ...
    • Conference Object  

      Verification of K-step opacity and analysis of its complexity 

      Saboori, A.; Hadjicostis, Christoforos N. (2009)
      In this paper, we analyze the verification of K-step opacity in discrete event systems that are modeled as (possibly non-deterministic) finite automata with partial observation on their transitions. A system is K-step ...
    • Article  

      Verification of K-step opacity and analysis of its complexity 

      Saboori, A.; Hadjicostis, Christoforos N. (2011)
      Motivated by security and privacy considerations in a variety of applications of discrete event systems, we describe and analyze the computational complexity required for verifying the notion of K-step opacity for systems ...