메뉴 건너뛰기




Volumn 62, Issue 2, 2004, Pages 197-220

A polynomial-time algorithm for checking consistency of free-choice signal transition graphs

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; ENCODING (SYMBOLS); GRAPH THEORY; ITERATIVE METHODS; MATHEMATICAL MODELS; PETRI NETS; POLYNOMIALS; STANDARDS;

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

References (22)
  • 2
    • 0033080328 scopus 로고    scopus 로고
    • Scanning the technology: Applications of asynchronous circuits
    • van Berkel, C., Josephs, M., Nowick, S.: Scanning the Technology: Applications of Asynchronous Circuits, Proceedings of the IEEE, 87(2), 1999, 234-242.
    • (1999) Proceedings of the IEEE , vol.87 , Issue.2 , pp. 234-242
    • Van Berkel, C.1    Josephs, M.2    Nowick, S.3
  • 4
    • 0022738690 scopus 로고
    • On the models for designing VLSI asynchronous digital systems
    • Chu, T.-A.: On the models for designing VLSI asynchronous digital systems, Integration: the VLSI journal, 4, 1986, 99-113.
    • (1986) Integration: the VLSI Journal , vol.4 , pp. 99-113
    • Chu, T.-A.1
  • 8
    • 4644295615 scopus 로고    scopus 로고
    • Private communication
    • Cortés, L.: Private communication, 2002.
    • (2002)
    • Cortés, L.1
  • 10
    • 0347054158 scopus 로고
    • Reduction and Synthesis of Live and Bounded Free Choice Petri Nets
    • Esparza, J.: Reduction and Synthesis of Live and Bounded Free Choice Petri Nets, Information and Computation, 114(1), 1994, 50-87.
    • (1994) Information and Computation , vol.114 , Issue.1 , pp. 50-87
    • Esparza, J.1
  • 14
    • 0345340016 scopus 로고    scopus 로고
    • A polynomial algorithm to compute the concurrency relation of free-choice signal transition graphs
    • IEE Society
    • Kovalyov, A., Esparza, J.: A Polynomial Algorithm to Compute the Concurrency Relation of Free-choice Signal Transition Graphs, Proc. Int. Workshop on Discrete Event Systems, IEE Society, 1996.
    • (1996) Proc. Int. Workshop on Discrete Event Systems
    • Kovalyov, A.1    Esparza, J.2
  • 15
    • 84976684505 scopus 로고
    • Properties of conflict-free and persistent petri nets
    • Landweber, L., Robertson, E.: Properties of Conflict-Free and Persistent Petri Nets, Journal of the ACM, 25(3), 1978, 352-364.
    • (1978) Journal of the ACM , vol.25 , Issue.3 , pp. 352-364
    • Landweber, L.1    Robertson, E.2
  • 17
    • 0003945252 scopus 로고
    • The reachability problem requires exponential space
    • Yale University
    • Lipton, R.: The Reachability Problem Requires Exponential Space, Technical Report 62, Yale University, 1976.
    • (1976) Technical Report , vol.62
    • Lipton, R.1
  • 21
    • 0026945175 scopus 로고
    • Optimized synthesis of asynchronous control circuits from graph-theoretic specifications
    • Vanbekbergen, P., Goosens, G., Catthoor, F., Man, H. D.: Optimized Synthesis of Asynchronous Control Circuits from Graph-Theoretic Specifications, IEEE Trans. on Computer Aided Design, 11(11), 1992, 1426-1438.
    • (1992) IEEE Trans. on Computer Aided Design , vol.11 , Issue.11 , pp. 1426-1438
    • Vanbekbergen, P.1    Goosens, G.2    Catthoor, F.3    Man, H.D.4


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