Partially-shared zero-suppressed multi-terminal BDDs: concept, algorithms and applications-Reference-Cited by-同舟云学术

Partially-shared zero-suppressed multi-terminal BDDs: concept, algorithms and applications

Published:2010-06-10 Issue:3 Volume:36 Page:198-222
ISSN:0925-9856
Container-title:Formal Methods in System Design
language:en
Short-container-title:Form Methods Syst Des

Author:

Lampka Kai,Siegle Markus,Ossowski Joern,Baier Christel

Publisher

Springer Science and Business Media LLC

Subject

Hardware and Architecture,Theoretical Computer Science,Software

Link

http://link.springer.com/content/pdf/10.1007/s10703-010-0095-8.pdf

Reference27 articles.

1. Formal Methods in System Design (1997) 10(2–3). Special Issue on Multi-Terminal Binary Decision Diagrams

2. Akers SB (1978) Binary decision diagrams. IEEE Trans Comput C-27(6):509–516

3. Balbo G, Conte G, Donatelli S, Franceschinis G, Ajmone Marsan M, Ajmone Marsan M (1995) Modelling with generalized stochastic Petri nets. Wiley, New York

4. Bryant RE (1986) Graph-based algorithms for Boolean function manipulation. IEEE Trans Comput C-35(8):677–691

5. Ciardo G, Lüttgen G, Miner AS (2007) Exploiting interleaving semantics in symbolic state-space generation. Form Methods Syst Des 31(1):63–100

Cited by 5 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Transient Reward Approximation for Continuous-Time Markov Chains;IEEE Transactions on Reliability;2015-12

2. Extracting Co-Occurrence Relations from ZDDs;Algorithms;2012-12-13

3. Report on the Model Checking Contest at Petri Nets 2011;Transactions on Petri Nets and Other Models of Concurrency VI;2012

4. Compilation of References;Theory and Application of Multi-Formalism Modeling

5. A Symbolic Approach to the Analysis of Multi-Formalism Markov Reward Models;Advances in Systems Analysis, Software Engineering, and High Performance Computing