메뉴 건너뛰기




Volumn 3731 LNCS, Issue , 2005, Pages 443-457

Hierarchical decision diagrams to exploit model structure

Author keywords

[No Author keywords available]

Indexed keywords

DATA ACQUISITION; DATA STRUCTURES; DECISION MAKING; GRAPH THEORY; MATHEMATICAL MODELS; SYSTEMS ANALYSIS; ALGEBRA; BINS; BOOLEAN FUNCTIONS; DIRECTED GRAPHS; GRAPHIC METHODS; MODEL CHECKING;

EID: 33646419259     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/11562436_32     Document Type: Conference Paper
Times cited : (39)

References (15)
  • 1
    • 0022769976 scopus 로고
    • Graph-based algorithms for boolean function manipulation
    • August
    • R. Bryant. Graph-based algorithms for boolean function manipulation. IEEE Transactions on Computers, 35(8):677-691, August 1986.
    • (1986) IEEE Transactions on Computers , vol.35 , Issue.8 , pp. 677-691
    • Bryant, R.1
  • 3
    • 84947211257 scopus 로고    scopus 로고
    • Efficient symbolic state-space construction for asynchronous systems
    • Proc. of ICATPN'2000. Springer Verlag, June
    • G. Ciardo, G. Lüttgen, and R. Siminiceanu. Efficient symbolic state-space construction for asynchronous systems. In Proc. of ICATPN'2000, volume 1825 of Lecture Notes in Computer Science, pages 103-122. Springer Verlag, June 2000.
    • (2000) Lecture Notes in Computer Science , vol.1825 , pp. 103-122
    • Ciardo, G.1    Lüttgen, G.2    Siminiceanu, R.3
  • 5
    • 35048859431 scopus 로고    scopus 로고
    • Reachability set generation for petri nets: Can brute force be smart
    • J. Cortadella and W. Reisig, editors, Application and Theory of Petri Nets 2004. 25th International Conference, ICATPN 2004
    • Gianfranco Ciardo. Reachability set generation for petri nets: Can brute force be smart. In J. Cortadella and W. Reisig, editors, Application and Theory of Petri Nets 2004. 25th International Conference, ICATPN 2004., volume 3099 of LNCS, pages 17-34, 2004.
    • (2004) LNCS , vol.3099 , pp. 17-34
    • Ciardo, G.1
  • 6
    • 84937557946 scopus 로고    scopus 로고
    • NuSMV Version 2: An OpenSource Tool for Symbolic Model Checking
    • Proc. International Conference on Computer-Aided Verification (CAV2002), Copenhagen, Denmark, July. Springer
    • A. Cimatti, E. Clarke, E. Giunchiglia, F. Giunchiglia, M. Pistore, M. Roveri, R. Sebastiani, and A. Tacchella. NuSMV Version 2: An OpenSource Tool for Symbolic Model Checking. In Proc. International Conference on Computer-Aided Verification (CAV2002), volume 2404 of LNCS, Copenhagen, Denmark, July 2002. Springer.
    • (2002) LNCS , vol.2404
    • Cimatti, A.1    Clarke, E.2    Giunchiglia, E.3    Giunchiglia, F.4    Pistore, M.5    Roveri, M.6    Sebastiani, R.7    Tacchella, A.8
  • 8
    • 84929911320 scopus 로고    scopus 로고
    • PetriNets@daimi.au.dk mailing list., Posted 28/07/03 and follow-up with performance of 4 tools on 26/09/03
    • H. Garavel. A net generated from lotos by cadp (http://www.inrialpes.fr/ vasy/cadp). In PetriNets@daimi.au.dk mailing list., Posted 28/07/03 and follow-up with performance of 4 tools on 26/09/03.
    • A Net Generated from Lotos by cadp
    • Garavel, H.1
  • 9
    • 84944035199 scopus 로고    scopus 로고
    • Techniques for smaller intermediary bdds
    • CONCUR 2001 - Concurrency Theory, 12th International Conference, Aalborg, Denmark, 2001
    • J. Geldenhuys and A. Valmari. Techniques for smaller intermediary bdds. In CONCUR 2001 - Concurrency Theory, 12th International Conference, Aalborg, Denmark, 2001, volume 2154 of Lecture Notes in Computer Science, pages 233-247, 2001.
    • (2001) Lecture Notes in Computer Science , vol.2154 , pp. 233-247
    • Geldenhuys, J.1    Valmari, A.2
  • 10
    • 0028736053 scopus 로고
    • Representation and symbolic manipulation of linearly inductive boolean functions
    • A. Gupta and A. L. Fisher. Representation and symbolic manipulation of linearly inductive boolean functions. In ICCAD'93, pages 111-116, 1993.
    • (1993) ICCAD'93 , pp. 111-116
    • Gupta, A.1    Fisher, A.L.2
  • 11
    • 0003347456 scopus 로고
    • Symbolic model checking with partitioned transition relations
    • A. Halaas and P.B. Denyer, editors, Edinburgh, Scotland. North-Holland
    • J.R. Burch, E.M. Clarke, and D.E. Long. Symbolic model checking with partitioned transition relations. In A. Halaas and P.B. Denyer, editors, International Conference on Very Large Scale Integration, pages 49-58, Edinburgh, Scotland, 1991. North-Holland.
    • (1991) International Conference on Very Large Scale Integration , pp. 49-58
    • Burch, J.R.1    Clarke, E.M.2    Long, D.E.3
  • 13
    • 84958976289 scopus 로고    scopus 로고
    • Efficient reachability set generation and storage using decision diagrams
    • Proc. of ICATPN '99. Springer Verlag
    • A.S. Miner and G. Ciardo. Efficient reachability set generation and storage using decision diagrams. In Proc. of ICATPN '99, volume 1639 of Lecture Notes in Computer Science, pages 6-25. Springer Verlag, 1999.
    • (1999) Lecture Notes in Computer Science , vol.1639 , pp. 6-25
    • Miner, A.S.1    Ciardo, G.2
  • 15
    • 35048896475 scopus 로고    scopus 로고
    • A symbolic symbolic state space
    • Proc. of the 24th IFIP WG 6.1 Int. Conf. on Formal Techniques for Networked and Distributed Systems (FORTE'04), Madrid, Spain, September. Springer
    • Y. Thierry-Mieg, J-M. Hie, and D. Poitrenaud. A symbolic symbolic state space. In Proc. of the 24th IFIP WG 6.1 Int. Conf. on Formal Techniques for Networked and Distributed Systems (FORTE'04), volume 3235 of LNCS, pages 276-291, Madrid, Spain, September 2004. Springer.
    • (2004) LNCS , vol.3235 , pp. 276-291
    • Thierry-Mieg, Y.1    Hie, J.-M.2    Poitrenaud, D.3


* 이 정보는 Elsevier사의 SCOPUS DB에서 KISTI가 분석하여 추출한 것입니다.