Sciweavers

141 search results - page 13 / 29
» Boolean Function Representation Using Parallel-Access Diagra...
Sort
View
ENTCS
2006
142views more  ENTCS 2006»
13 years 6 months ago
Predicate Diagrams for the Verification of Real-Time Systems
We propose a format of predicate diagrams for the verification of real-time systems. We consider systems that are defined as extended timed graphs, a format that combines timed au...
Eun-Young Kang, Stephan Merz
ACRI
2008
Springer
14 years 1 months ago
On the Representation of Gliders in Rule 54 by De Bruijn and Cycle Diagrams
Abstract. Rule 54, in Wolfram’s notation, is one of elementary yet complexly behaving one-dimensional cellular automata. The automaton supports gliders, glider guns and other non...
Genaro Juárez Martínez, Andrew Adama...
ISSTA
1998
ACM
13 years 11 months ago
Verifying Systems with Integer Constraints and Boolean Predicates: A Composite Approach
Symbolic model checking has proved highly successful for large nite-state systems, in which states can be compactly encoded using binary decision diagrams (BDDs) or their variants...
Tevfik Bultan, Richard Gerber, Christopher League
DAC
1997
ACM
13 years 11 months ago
Safe BDD Minimization Using Don't Cares
In many computer-aided design tools, binary decision diagrams (BDDs) are used to represent Boolean functions. To increase the efficiency and capability of these tools, many algor...
Youpyo Hong, Peter A. Beerel, Jerry R. Burch, Kenn...
ECSQARU
2007
Springer
14 years 27 days ago
Shared Ordered Binary Decision Diagrams for Dempster-Shafer Theory
The binary representation is widely used for representing focal sets of Dempster-Shafer belief functions because it allows to compute efficiently all relevant operations. However, ...
Norbert Lehmann