메뉴 건너뛰기




Volumn 52, Issue 3, 2002, Pages 275-294

Towards a process algebra for shared processors

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTER PROGRAMMING LANGUAGES; COMPUTER SYSTEMS PROGRAMMING; PROGRAM PROCESSORS; RESOURCE ALLOCATION; SEMANTICS;

EID: 21144456921     PISSN: 15710661     EISSN: None     Source Type: Journal    
DOI: 10.1016/S1571-0661(04)00228-2     Document Type: Conference Paper
Times cited : (7)

References (17)
  • 1
    • 84974688133 scopus 로고    scopus 로고
    • Scheduling - A methodology for the construction of scheduled systems
    • Altisen K., G. Gossler and J. Sifakis, Scheduling - a methodology for the construction of scheduled systems, Lecture Notes in Computer Science 1926 (2000), pp. 106-120.
    • (2000) Lecture Notes in Computer Science , vol.1926 , pp. 106-120
    • Altisen, K.1    Gossler, G.2    Sifakis, J.3
  • 2
    • 33645480578 scopus 로고    scopus 로고
    • Master's thesis, Department of Information Technology, Technical University of Denmark
    • Andersen J. and M. Buchholtz, "Formal Development of a Real-Time Kernel," Master's thesis, Department of Information Technology, Technical University of Denmark (2001). URL http://www.imm.dtu.dk/people/mib/masters/
    • (2001) Formal Development of a Real-time Kernel
    • Andersen, J.1    Buchholtz, M.2
  • 4
    • 0032203388 scopus 로고    scopus 로고
    • A process algebraic approach to the schedulability analysis of real-time systems
    • H. Ben-Abdallah, J. Choi, D. Clarke, Y.S. Kim, I. Lee, and H. Xie A process algebraic approach to the schedulability analysis of real-time systems Real-Time Systems 15 1998 189 219
    • (1998) Real-Time Systems , vol.15 , pp. 189-219
    • Ben-Abdallah, H.1    Choi, J.2    Clarke, D.3    Kim, Y.S.4    Lee, I.5    Xie, H.6
  • 5
    • 0031356362 scopus 로고    scopus 로고
    • A process algebra of communicating shared resources with dense time and priorities
    • P. Brémond-Grégoire, and I. Lee A process algebra of communicating shared resources with dense time and priorities Theoretical Computer Science 1997 179 219
    • (1997) Theoretical Computer Science , pp. 179-219
    • Brémond-Grégoire, P.1    Lee, I.2
  • 7
  • 8
    • 84888231408 scopus 로고    scopus 로고
    • Timed automata with asynchronous processes: Schedulability and decidability
    • Tools and Algorithms for the Construction and Analysis of Systems (TACAS2002)
    • Fersman E., P. Petterson and Wang Yi, Timed automata with asynchronous processes: Schedulability and decidability, in: Tools and Algorithms for the Construction and Analysis of Systems (TACAS2002), number 2280 in Lecture Notes of Computer Science, 2002, pp. 67-82.
    • (2002) Lecture Notes of Computer Science , vol.2280 , pp. 67-82
    • Fersman, E.1    Petterson Wang, Y.P.2
  • 10
    • 0018005391 scopus 로고
    • Communicating sequential processes
    • C.A.R. Hoare Communicating sequential processes Communications of the ACM 21 1978 666 677
    • (1978) Communications of the ACM , vol.21 , pp. 666-677
    • Hoare, C.A.R.1
  • 12
  • 14
    • 0034925311 scopus 로고    scopus 로고
    • Verification, refinement and scheduling of real-time programs
    • Z. Liu, and M. Joseph Verification, refinement and scheduling of real-time programs Theoretical Computer Science 253 2001 119 152
    • (2001) Theoretical Computer Science , vol.253 , pp. 119-152
    • Liu, Z.1    Joseph, M.2
  • 16
    • 0012268580 scopus 로고    scopus 로고
    • The linear time - Branching time spectrum I. the semantics of concrete, sequential processes
    • J. Bergstra A. Ponse S. Smolka North-Holland
    • R.J. van Glabbeek The linear time - branching time spectrum I. The semantics of concrete, sequential processes J. Bergstra A. Ponse S. Smolka Handbook of Process Algebra 2001 North-Holland 3 99
    • (2001) Handbook of Process Algebra , pp. 3-99
    • Van Glabbeek, R.J.1


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