✦ LIBER ✦

A New Algorithm for Partitioned Symbolic Reachability Analysis

✍ Scribed by Kai Lampka

Book ID: 111712929
Publisher: Elsevier Science
Year: 2008
Tongue: English
Weight: 391 KB
Volume: 223
Category: Article
ISSN: 1571-0661
DOI: 10.1016/j.entcs.2008.12.036

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

A Note on `A New Algorithm for Symbolic

A Note on `A New Algorithm for Symbolic Reliability Analysis'

✍ Satyanarayana, A.; Sivaramakrishnan, H. 📂 Article 📅 1977 🏛 IEEE 🌐 English ⚖ 280 KB

A Scalable Parallel Algorithm for Reacha

A Scalable Parallel Algorithm for Reachability Analysis of Very Large Circuits

✍ Tamir Heyman; Danny Geist; Orna Grumberg; Assaf Schuster 📂 Article 📅 2002 🏛 Springer 🌐 English ⚖ 716 KB

An improved algorithm for symbolic relia

An improved algorithm for symbolic reliability analysis

✍ Veeraraghavan, M.; Trivedi, K.S. 📂 Article 📅 1991 🏛 IEEE 🌐 English ⚖ 960 KB

MacMahon's Partition Analysis VI: A New

MacMahon's Partition Analysis VI: A New Reduction Algorithm

✍ George E. Andrews, Peter Paule, Axel Riese 📂 Article 📅 2001 🏛 Springer 🌐 English ⚖ 147 KB

A new symbolic substitution based additi

A new symbolic substitution based addition algorithm

✍ T. Imam; M. Kaykobad 📂 Article 📅 2005 🏛 Elsevier Science 🌐 English ⚖ 561 KB

## Symbolic substitution, a parallel processing technique, has been proposed in computing literature to perform fast, carry-free addition of numbers. Several algorithms and corresponding symbolic substitution tables have been developed for addition of two numbers represented in binary, modified sig

Symbolic analysis of linear networks usi

Symbolic analysis of linear networks using matrix partition method and FFT algorithm

✍ Hideo Takamura; Yuzo Ohta; Tadashi Matsumoto 📂 Article 📅 1982 🏛 John Wiley and Sons 🌐 English ⚖ 582 KB