메뉴 건너뛰기




Volumn 62, Issue 2, 2004, Pages 221-241

Detecting state encoding conflicts in STG unfoldings using SAT

Author keywords

Asynchronous circuits; Automated synthesis; Complete state coding; CSC; Net unfoldings; Partial order techniques; Petri nets; SAT; Signal transition graphs; STG

Indexed keywords

APPROXIMATION THEORY; BOOLEAN ALGEBRA; COMPUTER PROGRAMMING; CONSTRAINT THEORY; GRAPH THEORY; LOGIC GATES; MATHEMATICAL TRANSFORMATIONS; PETRI NETS; SEMANTICS;

EID: 4644247681     PISSN: 01692968     EISSN: None     Source Type: Journal    
DOI: None     Document Type: Conference Paper
Times cited : (27)

References (38)
  • 1
    • 0022769976 scopus 로고
    • Graph-based algorithms for boolean function manipulation
    • Bryant, R.: Graph-Based Algorithms for Boolean Function Manipulation, IEEE Transactions on Computers, C-35-8, 1986, 677-691.
    • (1986) IEEE Transactions on Computers , vol.C-35-8 , pp. 677-691
    • Bryant, R.1
  • 3
    • 4644356656 scopus 로고    scopus 로고
    • Design and evaluation of two asynchronous token ring adapters
    • Department of Computing Science, University of Newcastle upon Tyne
    • Carrion, C., Yakovlev, A.: Design and Evaluation of Two Asynchronous Token Ring Adapters, Technical Report CS-TR-562, Department of Computing Science, University of Newcastle upon Tyne, 1996.
    • (1996) Technical Report , vol.CS-TR-562
    • Carrion, C.1    Yakovlev, A.2
  • 8
    • 0026191448 scopus 로고
    • Branching processes of petri nets
    • Engelfriet, J.: Branching Processes of Petri Nets, Acta Informatica, 28, 1991, 575-591.
    • (1991) Acta Informatica , vol.28 , pp. 575-591
    • Engelfriet, J.1
  • 9
    • 0010225535 scopus 로고    scopus 로고
    • Decidability and complexity of Petri Net problems - An introduction
    • (W. Reisig, G., Rozenberg, Eds.), Lecture Notes in Computer Science, Springer-Verlag
    • Esparza, J.: Decidability and Complexity of Petri Net Problems - an Introduction, Lectures on Petri Nets I: Basic Models (W. Reisig, G., Rozenberg, Eds.), Lecture Notes in Computer Science 1491, Springer-Verlag, 1998.
    • (1998) Lectures on Petri Nets I: Basic Models , vol.1491
    • Esparza, J.1
  • 11
    • 4644224598 scopus 로고    scopus 로고
    • A power-efficient duplex communication system
    • (A. Yakovlev, R. Nouta, Eds.), TU Delft, The Netherlands
    • Furber, S., Efthymiou, A., Singh, M.: A Power-Efficient Duplex Communication System, Proc. AINT'2000 (A. Yakovlev, R. Nouta, Eds.), TU Delft, The Netherlands, 2000.
    • (2000) Proc. AINT'2000
    • Furber, S.1    Efthymiou, A.2    Singh, M.3
  • 12
    • 0032302584 scopus 로고    scopus 로고
    • AMULET-3: A high-performance self-timed ARM microprocessor
    • Furber, S., Garside, J., Gilbert, D.: AMULET-3: A High-Performance Self-Timed ARM Microprocessor, Proc. ICCD'1998, 1998.
    • (1998) Proc. ICCD'1998
    • Furber, S.1    Garside, J.2    Gilbert, D.3
  • 14
    • 0032639194 scopus 로고    scopus 로고
    • Using logic programs with stable model semantics to solve deadlock and reachability problems for 1-safe Petri Nets
    • Heljanko, K.: Using Logic Programs with Stable Model Semantics to Solve Deadlock and Reachability Problems for 1-Safe Petri Nets, Fundamenta Informaticae, 37(3), 1999, 247-268.
    • (1999) Fundamenta Informaticae , vol.37 , Issue.3 , pp. 247-268
    • Heljanko, K.1
  • 15
    • 21144452860 scopus 로고    scopus 로고
    • Canonical prefixes of petri net unfoldings
    • (E. Brinksma, K. Larsen, Eds.), Lecture Notes in Computer Science 2404, Springer-Verlag, 2002, Full version: Acta Informatica
    • Khomenko, V., Koutny, M., Vogler, W.: Canonical Prefixes of Petri Net Unfoldings, Proc. CAV'2002 (E. Brinksma, K. Larsen, Eds.), Lecture Notes in Computer Science 2404, Springer-Verlag, 2002, Full version: Acta Informatica 40(2) (2003) 95-118.
    • (2003) Proc. CAV'2002 , vol.40 , Issue.2 , pp. 95-118
    • Khomenko, V.1    Koutny, M.2    Vogler, W.3
  • 16
    • 84893765116 scopus 로고    scopus 로고
    • Detecting state coding conflicts in STGs using integer programming
    • (C. Kloos, J. Franca, Eds.), IEEE Computer Society Press
    • Khomenko, V., Koutny, M., Yakovlev, A.: Detecting State Coding Conflicts in STGs Using Integer Programming, Proc. DATE'2002 (C. Kloos, J. Franca, Eds.), IEEE Computer Society Press, 2002.
    • (2002) Proc. DATE'2002
    • Khomenko, V.1    Koutny, M.2    Yakovlev, A.3
  • 17
    • 84941621269 scopus 로고    scopus 로고
    • Detecting state coding conflicts in STG unfoldings using SAT
    • (J. Lilius, F. Balarin, R. Machado, Eds.), IEEE Computer Society Press
    • Khomenko, V., Koutny, M., Yakovlev, A.: Detecting State Coding Conflicts in STG Unfoldings Using SAT, Proc. ICACSD'2003 (J. Lilius, F. Balarin, R. Machado, Eds.), IEEE Computer Society Press, 2003.
    • (2003) Proc. ICACSD'2003
    • Khomenko, V.1    Koutny, M.2    Yakovlev, A.3
  • 19
    • 4644297424 scopus 로고    scopus 로고
    • Identifying state coding conflicts in asynchronous system specifications using Petri Net unfoldings
    • IEEE Computer Society Press
    • Kondratyev, A., Cortadella, J., Kishinevsky, M., Lavagno, L., Taubin, A., Yakovlev, A.: Identifying State Coding Conflicts in Asynchronous System Specifications Using Petri Net Unfoldings, Proc. ICACSD'1998, IEEE Computer Society Press, 1998.
    • (1998) Proc. ICACSD'1998
    • Kondratyev, A.1    Cortadella, J.2    Kishinevsky, M.3    Lavagno, L.4    Taubin, A.5    Yakovlev, A.6
  • 21
    • 4644325830 scopus 로고
    • A general state graph transformation framework for asynchronous synthesis
    • IEEE Computer Society Press
    • Lin, B., Ykman-Couvreur, C., Vanbekbergen, P.: A General State Graph Transformation Framework for Asynchronous Synthesis, Proc. EURO-DAC'1994, IEEE Computer Society Press, 1994.
    • (1994) Proc. EURO-DAC'1994
    • Lin, B.1    Ykman-Couvreur, C.2    Vanbekbergen, P.3
  • 22
    • 0028018595 scopus 로고
    • Direct synthesis of hazard-free asynchronous circuits from STGs based on lock relation and MG-decomposition approach
    • IEEE Computer Society Press
    • Lin, K.-J., Kuo, J.-W., Lin, C.-S.: Direct Synthesis of Hazard-Free Asynchronous Circuits from STGs Based on Lock Relation and MG-Decomposition Approach, Proc. of EDTC'1994, IEEE Computer Society Press, 1994.
    • (1994) Proc. of EDTC'1994
    • Lin, K.-J.1    Kuo, J.-W.2    Lin, C.-S.3
  • 23
    • 0031386645 scopus 로고    scopus 로고
    • Synthesis of hazard-free asynchronous circuits based on characteristic graph
    • Lin, K.-J., Kuo, J.-W., Lin, C.-S.: Synthesis of Hazard-Free Asynchronous Circuits Based on Characteristic Graph, IEEE Transactions on Computers, 46(11), 1997, 1246-1263.
    • (1997) IEEE Transactions on Computers , vol.46 , Issue.11 , pp. 1246-1263
    • Lin, K.-J.1    Kuo, J.-W.2    Lin, C.-S.3
  • 25
    • 0345567731 scopus 로고    scopus 로고
    • CONFRES: Interactive coding conflict resolver based on core visualization
    • IEEE Computer Society Press
    • Madalinski, A.: CONFRES: Interactive Coding Conflict Resolver Based on Core Visualization, Proc. ICACS D'2003, IEEE Computer Society Press, 2003.
    • (2003) Proc. ICACS D'2003
    • Madalinski, A.1
  • 26
    • 3242697757 scopus 로고    scopus 로고
    • Visualization and resolution of coding conflicts in asynchronous circuit design
    • IEEE Computer Society Press, 2003, Full version: Special Issue on Best Papers from DATE'2003, IEE Proceedings: Computers & Digital Techniques
    • Madalinski, A., Bystrov, A., Khomenko, V., Yakovlev, A.: Visualization and Resolution of Coding Conflicts in Asynchronous Circuit Design, Proc. DATE'2003, IEEE Computer Society Press, 2003, Full version: Special Issue on Best Papers from DATE'2003, IEE Proceedings: Computers & Digital Techniques 150(5) (2003) 285-293.
    • (2003) Proc. DATE'2003 , vol.150 , Issue.5 , pp. 285-293
    • Madalinski, A.1    Bystrov, A.2    Khomenko, V.3    Yakovlev, A.4
  • 28
    • 0029196816 scopus 로고
    • A technique of state space search based on unfoldings
    • McMillan, K.: A Technique of State Space Search Based on Unfoldings, Formal Methods in System Design, 6(1), 1995, 45-65.
    • (1995) Formal Methods in System Design , vol.6 , Issue.1 , pp. 45-65
    • McMillan, K.1
  • 30
    • 0027831840 scopus 로고
    • Polynomial algorithms for the synthesis of hazard-free circuits from signal transition graphs
    • IEEE Computer Society Press
    • Pastor, E., Cortadella, J.: Polynomial Algorithms for the Synthesis of Hazard-free Circuits from Signal Transition Graphs, Proc. of ICCAD'1993, IEEE Computer Society Press, 1993.
    • (1993) Proc. of ICCAD'1993
    • Pastor, E.1    Cortadella, J.2
  • 34
    • 0025560646 scopus 로고
    • Optimized synthesis of asynchronous control circuits from graph-theoretic specifications
    • IEEE Computer Society Press
    • Vanbekbergen, P., Catthoor, F., Goossens, G., De Man, H.: Optimized Synthesis of Asynchronous Control Circuits from Graph-Theoretic Specifications, Proc. ICCAD'1990, IEEE Computer Society Press, 1990.
    • (1990) Proc. ICCAD'1990
    • Vanbekbergen, P.1    Catthoor, F.2    Goossens, G.3    De Man, H.4
  • 35
    • 0031679674 scopus 로고    scopus 로고
    • Designing control logic for counterflow pipeline processor using Petri nets
    • Yakovlev, A.: Designing Control Logic for Counterflow Pipeline Processor Using Petri nets, Formal Methods in System Design, 12(1), 1998, 39-71.
    • (1998) Formal Methods in System Design , vol.12 , Issue.1 , pp. 39-71
    • Yakovlev, A.1
  • 36
    • 0030286197 scopus 로고    scopus 로고
    • A unified signal transition graph model for asynchronous control circuit synthesis
    • Yakovlev, A., Lavagno, L., Sangiovanni-Vincentelli, A.: A Unified Signal Transition Graph Model for Asynchronous Control Circuit Synthesis, Formal Methods in System Design, 9(3), 1996, 139-188.
    • (1996) Formal Methods in System Design , vol.9 , Issue.3 , pp. 139-188
    • Yakovlev, A.1    Lavagno, L.2    Sangiovanni-Vincentelli, A.3
  • 38
    • 8744294678 scopus 로고    scopus 로고
    • The quest for efficient boolean satisfiability solvers
    • (E. Brinksma, K. Larsen, Eds.), Lecture Notes in Computer Science, Springer-Verlag
    • Zhang, L., Malik, S.: The Quest for Efficient Boolean Satisfiability Solvers, Proc. CAV'2002 (E. Brinksma, K. Larsen, Eds.), Lecture Notes in Computer Science 2404, Springer-Verlag, 2002.
    • (2002) Proc. CAV'2002 , vol.2404
    • Zhang, L.1    Malik, S.2


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