메뉴 건너뛰기




Volumn 75, Issue 6, 2010, Pages 398-425

Alternating-time stream logic for multi-agent systems

Author keywords

Alternating time temporal logic; Automata; Concurrent games; Coordination; Data streams; Model checking

Indexed keywords

ALTERNATING TIME TEMPORAL LOGIC; COMPOSITE SYSTEMS; CONCURRENT GAMES; CONSTRAINT AUTOMATA; DATA STREAM; EQUIVALENCE CHECKING; GLUE-CODES; INDIVIDUAL COMPONENTS; LOGICAL PROPERTIES; OPERATIONAL BEHAVIOR; OPERATIONAL MODEL; PEER-TO-PEER COMMUNICATIONS; READ OPERATION; SERVICE INTERFACES; VERIFICATION ALGORITHMS;

EID: 77949774296     PISSN: 01676423     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.scico.2009.07.007     Document Type: Article
Times cited : (5)

References (25)
  • 2
    • 84926020762 scopus 로고    scopus 로고
    • Reo: A channel-based coordination model for component composition
    • Arbab F. Reo: A channel-based coordination model for component composition. Mathematical Structures in Computer Science 14 3 (2004) 329-366
    • (2004) Mathematical Structures in Computer Science , vol.14 , Issue.3 , pp. 329-366
    • Arbab, F.1
  • 3
    • 16244368082 scopus 로고    scopus 로고
    • Models and temporal logics for timed component connectors
    • IEEE CS Press
    • Arbab F., Baier C., deBoer F., and Rutten J.J.M.M. Models and temporal logics for timed component connectors. Proc. of SEFM (2004), IEEE CS Press 198-207
    • (2004) Proc. of SEFM , pp. 198-207
    • Arbab, F.1    Baier, C.2    deBoer, F.3    Rutten, J.J.M.M.4
  • 4
    • 24644453210 scopus 로고    scopus 로고
    • Synthesis of Reo circuits for implementation of component connector automata specifications
    • Proc. of COORDINATION
    • Arbab F., Baier C., deBoer F., Rutten J.J.M.M., and Sirjani M. Synthesis of Reo circuits for implementation of component connector automata specifications. Proc. of COORDINATION. LNCS vol. 3454 (2005)
    • (2005) LNCS , vol.3454
    • Arbab, F.1    Baier, C.2    deBoer, F.3    Rutten, J.J.M.M.4    Sirjani, M.5
  • 8
    • 77949773712 scopus 로고    scopus 로고
    • On the expressiveness of randomization in finite state monitors
    • IEEE computer society
    • Chadha R., Prasad Sistla A., and Viswanathan M. On the expressiveness of randomization in finite state monitors. Proc. LICS (2008), IEEE computer society 18-29
    • (2008) Proc. LICS , pp. 18-29
    • Chadha, R.1    Prasad Sistla, A.2    Viswanathan, M.3
  • 9
    • 77949773836 scopus 로고    scopus 로고
    • K. Chatterjee, L. Doyen, T.A. Henzinger, J.F. Raskin, Algorithms for omega-regular games with imperfect information. CoRR, abs/0706.2619, 2007
    • K. Chatterjee, L. Doyen, T.A. Henzinger, J.F. Raskin, Algorithms for omega-regular games with imperfect information. CoRR, abs/0706.2619, 2007
  • 10
    • 0022706656 scopus 로고
    • Automatic verification of finite-state concurrent systems using temporal logic specifications
    • Clarke E.M., Emerson E.A., and Sistla A.P. Automatic verification of finite-state concurrent systems using temporal logic specifications. ACM TOPLAS 8 2 (1986) 244-263
    • (1986) ACM TOPLAS , vol.8 , Issue.2 , pp. 244-263
    • Clarke, E.M.1    Emerson, E.A.2    Sistla, A.P.3
  • 11
    • 0035783442 scopus 로고    scopus 로고
    • Interface automata
    • ACM Press
    • deAlfaro L., and Henzinger T.A. Interface automata. FSE Proc. (2001), ACM Press 109-120
    • (2001) FSE Proc. , pp. 109-120
    • deAlfaro, L.1    Henzinger, T.A.2
  • 14
    • 0033717287 scopus 로고    scopus 로고
    • Choosing social laws for multi-agent systems: Minimality and simplicity
    • Fitoussi D., and Tennenholtz M. Choosing social laws for multi-agent systems: Minimality and simplicity. Artif. Intell. 119 1-2 (2000) 61-101
    • (2000) Artif. Intell. , vol.119 , Issue.1-2 , pp. 61-101
    • Fitoussi, D.1    Tennenholtz, M.2
  • 16
    • 18944373649 scopus 로고
    • Concurrent timed port automata
    • Technical Report TUM-I9533, Techn. Univ. München
    • R. Grosu, B. Rumpe, Concurrent timed port automata, Technical Report TUM-I9533, Techn. Univ. München, 1995. http://www4.informatik.tu-muenchen.de/reports/
    • (1995)
    • Grosu, R.1    Rumpe, B.2
  • 17
    • 77949775401 scopus 로고    scopus 로고
    • W. van der Hoek, M. Roberts, M. Wooldridge, Knowledge and social laws, in: AAMAS, 2005, pp. 674-681
    • W. van der Hoek, M. Roberts, M. Wooldridge, Knowledge and social laws, in: AAMAS, 2005, pp. 674-681
  • 18
    • 4544383448 scopus 로고    scopus 로고
    • Cooperation, knowledge, and time: Alternating-time temporal epistemic logic and its applications
    • van der Hoek W., and Wooldridge M. Cooperation, knowledge, and time: Alternating-time temporal epistemic logic and its applications. Studia Logica 75 1 (2003) 125-157
    • (2003) Studia Logica , vol.75 , Issue.1 , pp. 125-157
    • van der Hoek, W.1    Wooldridge, M.2
  • 19
    • 67349278483 scopus 로고    scopus 로고
    • Symbolic model checking for channel-based component connectors
    • Fifth International Workshop on Foundations of Coordination Languages and Software Architectures (FOCLASA'06) (special issue)
    • Klüppelholz S., and Baier C. Symbolic model checking for channel-based component connectors. Fifth International Workshop on Foundations of Coordination Languages and Software Architectures (FOCLASA'06). Science of Computer Programming 74 9 (2009) 688-701 (special issue)
    • (2009) Science of Computer Programming , vol.74 , Issue.9 , pp. 688-701
    • Klüppelholz, S.1    Baier, C.2
  • 20
    • 0001383866 scopus 로고
    • An introduction to input/output automata
    • Lynch N., and Tuttle M.R. An introduction to input/output automata. CWI Quarterly 2 3 (1989) 219-246
    • (1989) CWI Quarterly , vol.2 , Issue.3 , pp. 219-246
    • Lynch, N.1    Tuttle, M.R.2
  • 21
    • 0021504983 scopus 로고
    • The complexity of two-player games of incomplete information
    • Reif J.H. The complexity of two-player games of incomplete information. J. Comput. Syst. Sci. 29 2 (1984) 274-301
    • (1984) J. Comput. Syst. Sci. , vol.29 , Issue.2 , pp. 274-301
    • Reif, J.H.1
  • 23
    • 18844453205 scopus 로고    scopus 로고
    • Alternating-time logic with imperfect recall
    • Proc. of LCMAS
    • Schobbens P.Y. Alternating-time logic with imperfect recall. Proc. of LCMAS. ENTCS vol. 85(2) (2004) 1-12
    • (2004) ENTCS , vol.85 2 , pp. 1-12
    • Schobbens, P.Y.1
  • 24
    • 85034666435 scopus 로고
    • Specification and synthesis of communicating processes using an extended temporal logic
    • P. Wolper, Specification and synthesis of communicating processes using an extended temporal logic, in: Proc. of POPL, 1982, pp. 20-33
    • (1982) Proc. of POPL , pp. 20-33
    • Wolper, P.1


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