- Delta-Complete Analysis for Bounded Reachability of Hybrid Systems
2014/04/28 by Sicun Gao, Gao, Sicun, Soonho Kong +5 · 1 citation
Computer Science · Engineering · Mathematics · #Advanced Control Systems Optimization #Bounded function #Computer science #FOS: Computer and information sciences #FOS: Electrical engineering #Formal Methods in Verification #Hybrid system #Logic in Computer Science (cs.LO) #Machine learning #Mathematical optimization #Mathematics #Model checking #Nonlinear system #Petri Nets in System Modeling #Reachability #Reachability problem #Robustness (evolution) #Systems and Control (eess.SY) #Theoretical computer science #electronic engineering #information engineering
- New problems complete for nondeterministic log space
1976/12/01 by Neil D. Jones, Y. Edmund Lien, William T. Laaser · 1 citation
Computer Science · Mathematics · #Associative property #Combinatorics #Discrete mathematics #Equivalence (formal languages) #Logic, Reasoning, and Knowledge #Mathematics #Natural Language Processing Techniques #Nondeterministic algorithm #Pure mathematics #Reachability #Reachability problem #Satisfiability #Semantic Web and Ontologies
- Some decision problems related to the reachability problem for Petri nets
1976/10/01 by Toshiro Araki, Tadao Kasami · 1 citation
Computer Science · Mathematics · #Algorithm #Computer science #Decidability #Decision problem #Discrete mathematics #Equivalence (formal languages) #Formal Methods in Verification #Mathematics #Petri Nets in System Modeling #Petri net #Process architecture #Reachability #Reachability problem #Stochastic Petri net #Theoretical computer science #Undecidable problem #semigroups and automata theory