Results 31 to 40 of about 9,112 (162)
A Recursive Framework for Evaluating Moments Using Zero-Suppressed Binary Decision Diagrams
IEEE AccessThe zero-suppressed binary decision diagram (ZDD) is a compact data structure widely used for the efficient representation of families of sparse subsets.
Brian Godwin Lim +4 more
doaj +1 more source
Lex-Partitioning: A New Option for BDD Search [PDF]
Electronic Proceedings in Theoretical Computer Science, 2012 For the exploration of large state spaces, symbolic search using binary decision diagrams (BDDs) can save huge amounts of memory and computation time. State sets are represented and modified by accessing and manipulating their characteristic functions ...
Stefan Edelkamp +2 more
doaj +1 more source
Frontiers in Plant Science, 2012 Model checking is a well-established technique for automaticallyverifying complex systems. Recently, model checkers have appearedin computer tools for the analysis of biochemical (and generegulatory) networks.
Miguel eCarrillo +2 more
doaj +1 more source
Survey of machine learning methods for detecting false data injection attacks in power systems
IET Smart Grid, 2020 Over the last decade, the number of cyber attacks targeting power systems and causing physical and economic damages has increased rapidly. Among them, false data injection attacks (FDIAs) are a class of cyber-attacks against power grid monitoring systems.
Ali Sayghe +7 more
doaj +1 more source
Symblicit algorithms for optimal strategy synthesis in monotonic Markov decision processes [PDF]
Electronic Proceedings in Theoretical Computer Science, 2014 When treating Markov decision processes (MDPs) with large state spaces, using explicit representations quickly becomes unfeasible. Lately, Wimmer et al. have proposed a so-called symblicit algorithm for the synthesis of optimal strategies in MDPs, in the
Aaron Bohy +2 more
doaj +1 more source
Journal on Interactive SystemsBackground: Programmable Logic Controllers (PLCs) are widely used to implement automation systems based on sequential control. For such systems, Ladder and Grafcet diagrams are standardized, respectively used as programming and specification formalisms.
Paulo André Sperandio Giacomin
doaj +1 more source
A parallel algorithm for constructing binary decision diagrams [PDF]
Proceedings., 1990 IEEE International Conference on Computer Design: VLSI in Computers and Processors, 2002 A parallel algorithm for constructing binary decision diagrams is described. The algorithms treats binary decision graphs as minimal finite automata. The automation for a Boolean function with AND as its main operation (OR operation) is obtained by forming the intersection (union) of the regular sets associated with its operands.
Shinji Kimura, Edmund M. Clarke
openaire +1 more source
IEEE AccessWe study the enumeration of all d-minimal paths in a multistate two-terminal network, where each arc has a specific capacity limit. Classical approaches based on generating functions or incremental enumeration tend to suffer from severe combinatorial ...
Yasser Lamalem +2 more
doaj +1 more source
Symbolic vs. Bounded Synthesis for Petri Games [PDF]
Electronic Proceedings in Theoretical Computer Science, 2017 Petri games are a multiplayer game model for the automatic synthesis of distributed systems. We compare two fundamentally different approaches for solving Petri games. The symbolic approach decides the existence of a winning strategy via a reduction to a
Bernd Finkbeiner +3 more
doaj +1 more source
Storing Set Families More Compactly with Top ZDDs
Algorithms, 2021 Zero-suppressed Binary Decision Diagrams (ZDDs) are data structures for representing set families in a compressed form. With ZDDs, many valuable operations on set families can be done in time polynomial in ZDD size.
Kotaro Matsuda +2 more
doaj +1 more source