Detecting state coding conflicts in STG unfoldings using SAT

Proceedings - International Conference on Application of Concurrency to System Design, ACSD

Volumn 2003-January, Issue , 2003, Pages 51-60

  Khomenko, Victor ^a   Koutny, Maciej ^a   Yakovlev, Alex ^a  

^a NEWCASTLE UNIVERSITY   (United Kingdom)

Author keywords

Asynchronous circuits; Automatic control; Circuit synthesis; Concurrent computing; Explosions; Logic circuits; Petri nets; Signal synthesis; Specification languages; State space methods

Indexed keywords

AUTOMATION; COMPUTATION THEORY; CONCURRENCY CONTROL; CONTROL; EXPLOSIONS; LOGIC CIRCUITS; MODEL CHECKING; PETRI NETS; SPECIFICATION LANGUAGES; STATE SPACE METHODS; SYSTEMS ANALYSIS;

ASYNCHRONOUS CIRCUITS; BOOLEAN SATISFIABILITY; CIRCUIT SYNTHESIS; COMPLETE STATE CODING; CONCURRENT COMPUTING; SIGNAL SYNTHESIS; SIGNAL TRANSITION GRAPHS; STATE-SPACE EXPLOSION;

ASYNCHRONOUS SEQUENTIAL LOGIC;

EID: 84941621269     PISSN: 15504808     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/CSD.2003.1207699     Document Type: Conference Paper

References (28)

1. J. Carmona, J. Cortadella, and E. Pastor: A Structural Encoding Technique for the Synthesis of Asynchronous Circuits. Proc. of ICACSD'01, IEEE Comp. Soc. Press (2001) 157-166.
2. C. Carrion and A. Yakovlev: Design and Evaluation of Two Asynchronous Token Ring Adapters. Tech. Rep. CS-TR-562, Univ. of Newcastle upon Tyne (1996).
3. T. -A. Chu: Synthesis of Self-Timed VLSI Circuits from Graph-Theoretic Specifications. PhD Thesis, MIT/LCS/TR-393 (1987).
4. J. Cortadella, M. Kishinevsky, A. Kondratyev, L. Lavagno, and A. Yakovlev: PETRIFY: a Tool for Manipulating Concurrent Specifications and Synthesis of Asynchronous Controllers. IEICE Transactions on Information and Systems E80-D(3) (1997) 315-325.
5. J. Cortadella, M. Kishinevsky, A. Kondratyev, L. Lavagno, and A. Yakovlev: Logic Synthesis of Asynchronous Controllers and Interfaces. Springer Verlag (2002).
6. J. Cortadella, A. Kondratyev, M. Kishinevsky, L. Lavagno, and A. Yakovlev: Complete State Encoding Based on Theory of Regions. Proc. of ASYNC'1996, IEEE Comp. Soc. Press (1996) 36-47.
7. J. Engelfriet: Branching Processes of Petri Nets. Acta Informatica 28 (1991) 575-591.
8. J. Esparza: Decidability and Complexity of Petri Net Problems - an Introduction. In: Lectures on Petri Nets I: Basic Models, W. Reisig and G. Rozenberg (Eds.). LNCS 1491 (1998) 374-428.
9. S. B. Furber, A. Efthymiou, and M. Singh: A Power-Efficient Duplex Communication System. Proc. of AINT'2000, TU Delft (2000) 145-150.
10. K. Heljanko: Using Logic Programs with Stable Model Semantics to Solve Deadlock and Reachability Problems for 1-Safe Petri Nets. Fundamentae Informaticae 37(3) (1999) 247-268.
11. V. Khomenko: Model Checking Based on Prefixes of Petri Net Unfoldings. PhD Thesis, University of Newcastle upon Tyne (2003).
12. V. Khomenko, M. Koutny, and V. Vogler: Canonical Prefixes of Petri Net Unfoldings. Proc. of CAV'2002, LNCS 2404 (2002) 582-595.
13. V. Khomenko, M. Koutny, and A. Yakovlev: Detecting State Coding Conflicts in STGs Using Integer Programming. Tech. Rep. CS-TR-736, Univ. of Newcastle upon Tyne (2001).
14. V. Khomenko, M. Koutny, and A. Yakovlev: Detecting State Coding Conflicts in STGs Using Integer Programming. Proc. of DATE'2002, IEEE Comp. Soc. Press (2002) 338-345.
15. V. Khomenko, M. Koutny, and A. Yakovlev: Detecting State Coding Conflicts in STG Unfoldings Using SAT. Tech. Rep. CS-TR-778, Univ. of Newcastle upon Tyne (2002).
16. A. Kondratyev, J. Cortadella, M. Kishinevsky, L. Lavagno, A. Taubin, and A. Yakovlev: Identifying State Coding Conflicts in Asynchronous System Specifications Using Petri Net Unfoldings. Proc. of ICACSD'98, IEEE Comp. Soc. Press (1998) 152-163.
17. K. S. Low and A. Yakovlev: Token Ring Arbiters: an Exercise in Asynchronous Logic Design with Petri Nets. Tech. Rep. CS-TR-537, Univ. of Newcastle upon Tyne (1995).
18. A. Madalinski, A. Bystrov, V. Khomenko, and A. Yakovlev: Visualization and Resolution of Coding Conflicts in Asynchronous Circuit Design. Proc. of DATE'2003, IEEE Comp. Soc. Press (2003) 926-931.
19. K. L. McMillan: Using Unfoldings to Avoid State Explosion Problem in the Verification of Asynchronous Circuits. Proc. of CAV'1992, LNCS 663 (1992) 164-174.
20. K. L. McMillan: Symbolic Model Checking: an approach to the state explosion problem. PhD thesis, CMU-CS-92-131 (1992).
21. S. Moskewicz, C. Madigan, Y. Zhao, L. Zhang, and S. Malik: CHAFF: Engineering an Efficient SAT Solver. Proc. of DAC'2001, ASME Tech. Publishing (2001) 530-535.
22. E. Pastor, J. Cortadella, and O. Roig: Symbolic Analysis of Bounded Petri Nets. IEEE Transactions on Computers 50(5) (2001) 432-448.
23. A. Semenov: Verification and Synthesis of Asynchronous Control Circuits Using Petri Net Unfolding. PhD Thesis, Univ. of Newcastle upon Tyne (1997).
24. A. Semenov, A. Yakovlev, E. Pastor, M. Peña, J. Cortadella, and L. Lavagno: Partial Order Approach to Synthesis of Speed-Independent Circuits. Proc. of ASYNC'1997, IEEE Comp. Soc. Press (1997) 254-265.
25. P. Vanbekbergen, F. Catthoor, G. Goossens, and H. De Man: Optimized Synthesis of Asynchronous Control Circuits form Graph-Theoretic Specifications. Proc. of ICCAD'1990, IEEE Comp. Soc. Press (1990) 184-187.
26. A. Yakovlev, L. Lavagno, and A. Sangiovanni-Vincentelli: A Unified Signal Transition Graph Model for Asynchronous Control Circuit Synthesis. FMSD 9(3) (1996) 139-188.
27. A. Yakovlev: Designing Control Logic for Counterflow Pipeline Processor Using Petri nets. FMSD 12(1) (1998) 39-71.
28. L. Zhang and S. Malik: The Quest for Efficient Boolean Satisfiability Solvers. Proc. of CAV'2002, LNCS 2404 (2002) 582-595.