The complexity of model checking concurrent programs against CTLK specifications
- Author
- LOMUSCIO, Alessio1 ; RAIMONDI, Franco1
[1] Department of Computer Science University College London, London, United Kingdom - Conference title
- Declarative agent languages and technologies IV (4th International workshop, DALT 2006, Hakodate, Japan, May 8, 2006)
- Conference name
- International Workshop on Declarative Agent Languages and Technologies (4 ; Hakodate 2006)
- Author (monograph)
- Baldoni, Matteo (Editor); Endriss, Ulle (Editor)
- Source
Lecture notes in computer science. 2006 ; 1Vol, pp 29-42, 14 p ; ref : 35 ref
- ISSN
- 0302-9743
- ISBN
- 3-540-68959-1
- Scientific domain
- Computer science
- Publisher
- Springer, Berlin
/
Springer, Heidelberg
- Publication country
- Germany
- Document type
- Conference Paper
- Language
- English
- Keyword (fr)
- Agent intelligent Complexité calcul Complexité programme Intelligence artificielle Langage déclaratif Programme concurrent Programme contrôle Simultanéité informatique Spécification programme Système multiagent Système réparti Vérification modèle Vérification programme
- Keyword (en)
- Intelligent agent Computational complexity Program complexity Artificial intelligence Declarative language Concurrent program Checking program Concurrency Program specification Multiagent system Distributed system Model checking Program verification
- Keyword (es)
- Agente inteligente Complejidad computación Complejidad programa Inteligencia artificial Lenguaje declarativo Programa competidor Programa control Simultaneidad informatica Especificación programa Sistema multiagente Sistema repartido Verificación modelo Verificación programa
- Classification
- Pascal
- 001 Exact sciences and technology / 001D Applied sciences / 001D02 Computer science; control theory; systems / 001D02B Software / 001D02B02 Programming languages
- Pascal
- 001 Exact sciences and technology / 001D Applied sciences / 001D02 Computer science; control theory; systems / 001D02B Software / 001D02B04 Computer systems and distributed systems. User interface
- Pascal
- 001 Exact sciences and technology / 001D Applied sciences / 001D02 Computer science; control theory; systems / 001D02B Software / 001D02B09 Software engineering
- Pascal
- 001 Exact sciences and technology / 001D Applied sciences / 001D02 Computer science; control theory; systems / 001D02C Artificial intelligence
- Discipline
- Computer science : theoretical automation and systems
- Origin
- Inist-CNRS
- Database
- PASCAL
- INIST identifier
- 19937844
Sauf mention contraire ci-dessus, le contenu de cette notice bibliographique peut être utilisé dans le cadre d’une licence CC BY 4.0 Inist-CNRS / Unless otherwise stated above, the content of this bibliographic record may be used under a CC BY 4.0 licence by Inist-CNRS / A menos que se haya señalado antes, el contenido de este registro bibliográfico puede ser utilizado al amparo de una licencia CC BY 4.0 Inist-CNRS
Access to the document
Install on your browser
DOI
10.1007/11961536_3 
https://dx.doi.org/10.1007/11961536_3
"O:13:\"PanistOpenUrl\":36:{s:10:\"\u0000*\u0000openUrl\";N;s:6:\"\u0000*\u0000idc\";N;s:6:\"\u0000*\u0000fmt\";s:10:\"proceeding\";s:6:\"\u0000*\u0000doi\";s:18:\"10.1007\/11961536_3\";s:6:\"\u0000*\u0000pii\";s:0:\"\";s:7:\"\u0000*\u0000pmid\";s:0:\"\";s:9:\"\u0000*\u0000atitle\";s:80:\"The complexity of model checking concurrent programs against CTLK specifications\";s:9:\"\u0000*\u0000jtitle\";s:33:\"Lecture notes in computer science\";s:9:\"\u0000*\u0000stitle\";s:23:\"Lect. notes comput. sci\";s:7:\"\u0000*\u0000date\";s:4:\"2006\";s:9:\"\u0000*\u0000volume\";s:0:\"\";s:8:\"\u0000*\u0000issue\";s:0:\"\";s:8:\"\u0000*\u0000spage\";s:2:\"29\";s:8:\"\u0000*\u0000epage\";s:2:\"42\";s:8:\"\u0000*\u0000pages\";s:0:\"\";s:7:\"\u0000*\u0000issn\";s:9:\"0302-9743\";s:8:\"\u0000*\u0000eissn\";s:0:\"\";s:9:\"\u0000*\u0000aulast\";s:8:\"LOMUSCIO\";s:10:\"\u0000*\u0000aufirst\";s:7:\"Alessio\";s:9:\"\u0000*\u0000auinit\";s:0:\"\";s:10:\"\u0000*\u0000auinitm\";s:0:\"\";s:5:\"\u0000*\u0000au\";a:1:{i:0;s:16:\"RAIMONDI, Franco\";}s:9:\"\u0000*\u0000aucorp\";s:0:\"\";s:7:\"\u0000*\u0000isbn\";s:13:\"3-540-68959-1\";s:8:\"\u0000*\u0000coden\";s:0:\"\";s:8:\"\u0000*\u0000genre\";s:10:\"proceeding\";s:7:\"\u0000*\u0000part\";s:0:\"\";s:9:\"\u0000*\u0000btitle\";s:117:\"Declarative agent languages and technologies IV (4th International workshop, DALT 2006, Hakodate, Japan, May 8, 2006)\";s:8:\"\u0000*\u0000title\";s:80:\"The complexity of model checking concurrent programs against CTLK specifications\";s:8:\"\u0000*\u0000place\";s:6:\"Berlin\";s:6:\"\u0000*\u0000pub\";s:8:\"Springer\";s:10:\"\u0000*\u0000edition\";s:0:\"\";s:9:\"\u0000*\u0000tpages\";s:2:\"14\";s:9:\"\u0000*\u0000series\";s:0:\"\";s:8:\"\u0000*\u0000proxy\";s:30:\"http:\/\/proxyout.inist.fr:8080\/\";s:12:\"\u0000*\u0000integrite\";b:1;}"
Panist access
"O:12:\"IstexOpenUrl\":35:{s:10:\"\u0000*\u0000openUrl\";N;s:6:\"\u0000*\u0000fmt\";s:10:\"proceeding\";s:6:\"\u0000*\u0000doi\";s:18:\"10.1007\/11961536_3\";s:6:\"\u0000*\u0000pii\";s:0:\"\";s:7:\"\u0000*\u0000pmid\";s:0:\"\";s:9:\"\u0000*\u0000atitle\";s:80:\"The complexity of model checking concurrent programs against CTLK specifications\";s:9:\"\u0000*\u0000jtitle\";s:33:\"Lecture notes in computer science\";s:9:\"\u0000*\u0000stitle\";s:23:\"Lect. notes comput. sci\";s:7:\"\u0000*\u0000date\";s:4:\"2006\";s:9:\"\u0000*\u0000volume\";s:0:\"\";s:8:\"\u0000*\u0000issue\";s:0:\"\";s:8:\"\u0000*\u0000spage\";s:2:\"29\";s:8:\"\u0000*\u0000epage\";s:2:\"42\";s:8:\"\u0000*\u0000pages\";s:0:\"\";s:7:\"\u0000*\u0000issn\";s:9:\"0302-9743\";s:8:\"\u0000*\u0000eissn\";s:0:\"\";s:9:\"\u0000*\u0000aulast\";s:8:\"LOMUSCIO\";s:10:\"\u0000*\u0000aufirst\";s:7:\"Alessio\";s:9:\"\u0000*\u0000auinit\";s:0:\"\";s:10:\"\u0000*\u0000auinitm\";s:0:\"\";s:5:\"\u0000*\u0000au\";a:1:{i:0;s:16:\"RAIMONDI, Franco\";}s:9:\"\u0000*\u0000aucorp\";s:0:\"\";s:7:\"\u0000*\u0000isbn\";s:13:\"3-540-68959-1\";s:8:\"\u0000*\u0000coden\";s:0:\"\";s:8:\"\u0000*\u0000genre\";s:10:\"proceeding\";s:7:\"\u0000*\u0000part\";s:0:\"\";s:9:\"\u0000*\u0000btitle\";s:117:\"Declarative agent languages and technologies IV (4th International workshop, DALT 2006, Hakodate, Japan, May 8, 2006)\";s:8:\"\u0000*\u0000title\";s:80:\"The complexity of model checking concurrent programs against CTLK specifications\";s:8:\"\u0000*\u0000place\";s:6:\"Berlin\";s:6:\"\u0000*\u0000pub\";s:8:\"Springer\";s:10:\"\u0000*\u0000edition\";s:0:\"\";s:9:\"\u0000*\u0000tpages\";s:2:\"14\";s:9:\"\u0000*\u0000series\";s:0:\"\";s:8:\"\u0000*\u0000proxy\";s:30:\"http:\/\/proxyout.inist.fr:8080\/\";s:12:\"\u0000*\u0000integrite\";b:1;}"
Istex access
"O:16:\"UnpaywallOpenUrl\":35:{s:8:\"\u0000*\u0000email\";s:27:\"assistance-portail@inist.fr\";s:6:\"\u0000*\u0000fmt\";N;s:6:\"\u0000*\u0000doi\";s:18:\"10.1007\/11961536_3\";s:6:\"\u0000*\u0000pii\";N;s:7:\"\u0000*\u0000pmid\";N;s:9:\"\u0000*\u0000atitle\";N;s:9:\"\u0000*\u0000jtitle\";N;s:9:\"\u0000*\u0000stitle\";N;s:7:\"\u0000*\u0000date\";N;s:9:\"\u0000*\u0000volume\";N;s:8:\"\u0000*\u0000issue\";N;s:8:\"\u0000*\u0000spage\";N;s:8:\"\u0000*\u0000epage\";N;s:8:\"\u0000*\u0000pages\";N;s:7:\"\u0000*\u0000issn\";N;s:8:\"\u0000*\u0000eissn\";N;s:9:\"\u0000*\u0000aulast\";N;s:10:\"\u0000*\u0000aufirst\";N;s:9:\"\u0000*\u0000auinit\";N;s:10:\"\u0000*\u0000auinitm\";N;s:5:\"\u0000*\u0000au\";N;s:9:\"\u0000*\u0000aucorp\";N;s:7:\"\u0000*\u0000isbn\";N;s:8:\"\u0000*\u0000coden\";N;s:8:\"\u0000*\u0000genre\";N;s:7:\"\u0000*\u0000part\";N;s:9:\"\u0000*\u0000btitle\";N;s:8:\"\u0000*\u0000title\";N;s:8:\"\u0000*\u0000place\";N;s:6:\"\u0000*\u0000pub\";N;s:10:\"\u0000*\u0000edition\";N;s:9:\"\u0000*\u0000tpages\";N;s:9:\"\u0000*\u0000series\";N;s:8:\"\u0000*\u0000proxy\";s:30:\"http:\/\/proxyout.inist.fr:8080\/\";s:12:\"\u0000*\u0000integrite\";N;}"
Unpaywall access
"O:16:\"EuropePMCOpenUrl\":35:{s:10:\"\u0000*\u0000openUrl\";N;s:6:\"\u0000*\u0000fmt\";s:10:\"proceeding\";s:6:\"\u0000*\u0000doi\";s:18:\"10.1007\/11961536_3\";s:6:\"\u0000*\u0000pii\";s:0:\"\";s:7:\"\u0000*\u0000pmid\";s:0:\"\";s:9:\"\u0000*\u0000atitle\";s:80:\"The complexity of model checking concurrent programs against CTLK specifications\";s:9:\"\u0000*\u0000jtitle\";s:33:\"Lecture notes in computer science\";s:9:\"\u0000*\u0000stitle\";s:23:\"Lect. notes comput. sci\";s:7:\"\u0000*\u0000date\";s:4:\"2006\";s:9:\"\u0000*\u0000volume\";s:0:\"\";s:8:\"\u0000*\u0000issue\";s:0:\"\";s:8:\"\u0000*\u0000spage\";s:2:\"29\";s:8:\"\u0000*\u0000epage\";s:2:\"42\";s:8:\"\u0000*\u0000pages\";s:0:\"\";s:7:\"\u0000*\u0000issn\";s:9:\"0302-9743\";s:8:\"\u0000*\u0000eissn\";s:0:\"\";s:9:\"\u0000*\u0000aulast\";s:8:\"LOMUSCIO\";s:10:\"\u0000*\u0000aufirst\";s:7:\"Alessio\";s:9:\"\u0000*\u0000auinit\";s:0:\"\";s:10:\"\u0000*\u0000auinitm\";s:0:\"\";s:5:\"\u0000*\u0000au\";a:1:{i:0;s:16:\"RAIMONDI, Franco\";}s:9:\"\u0000*\u0000aucorp\";s:0:\"\";s:7:\"\u0000*\u0000isbn\";s:13:\"3-540-68959-1\";s:8:\"\u0000*\u0000coden\";s:0:\"\";s:8:\"\u0000*\u0000genre\";s:10:\"proceeding\";s:7:\"\u0000*\u0000part\";s:0:\"\";s:9:\"\u0000*\u0000btitle\";s:117:\"Declarative agent languages and technologies IV (4th International workshop, DALT 2006, Hakodate, Japan, May 8, 2006)\";s:8:\"\u0000*\u0000title\";s:80:\"The complexity of model checking concurrent programs against CTLK specifications\";s:8:\"\u0000*\u0000place\";s:6:\"Berlin\";s:6:\"\u0000*\u0000pub\";s:8:\"Springer\";s:10:\"\u0000*\u0000edition\";s:0:\"\";s:9:\"\u0000*\u0000tpages\";s:2:\"14\";s:9:\"\u0000*\u0000series\";s:0:\"\";s:8:\"\u0000*\u0000proxy\";s:30:\"http:\/\/proxyout.inist.fr:8080\/\";s:12:\"\u0000*\u0000integrite\";b:1;}"
Europe PubMed Central access
"O:11:\"BaseOpenUrl\":35:{s:10:\"\u0000*\u0000openUrl\";N;s:6:\"\u0000*\u0000fmt\";s:10:\"proceeding\";s:6:\"\u0000*\u0000doi\";s:18:\"10.1007\/11961536_3\";s:6:\"\u0000*\u0000pii\";s:0:\"\";s:7:\"\u0000*\u0000pmid\";s:0:\"\";s:9:\"\u0000*\u0000atitle\";s:80:\"The complexity of model checking concurrent programs against CTLK specifications\";s:9:\"\u0000*\u0000jtitle\";s:33:\"Lecture notes in computer science\";s:9:\"\u0000*\u0000stitle\";s:23:\"Lect. notes comput. sci\";s:7:\"\u0000*\u0000date\";s:4:\"2006\";s:9:\"\u0000*\u0000volume\";s:0:\"\";s:8:\"\u0000*\u0000issue\";s:0:\"\";s:8:\"\u0000*\u0000spage\";s:2:\"29\";s:8:\"\u0000*\u0000epage\";s:2:\"42\";s:8:\"\u0000*\u0000pages\";s:0:\"\";s:7:\"\u0000*\u0000issn\";s:9:\"0302-9743\";s:8:\"\u0000*\u0000eissn\";s:0:\"\";s:9:\"\u0000*\u0000aulast\";s:8:\"LOMUSCIO\";s:10:\"\u0000*\u0000aufirst\";s:7:\"Alessio\";s:9:\"\u0000*\u0000auinit\";s:0:\"\";s:10:\"\u0000*\u0000auinitm\";s:0:\"\";s:5:\"\u0000*\u0000au\";a:1:{i:0;s:16:\"RAIMONDI, Franco\";}s:9:\"\u0000*\u0000aucorp\";s:0:\"\";s:7:\"\u0000*\u0000isbn\";s:13:\"3-540-68959-1\";s:8:\"\u0000*\u0000coden\";s:0:\"\";s:8:\"\u0000*\u0000genre\";s:10:\"proceeding\";s:7:\"\u0000*\u0000part\";s:0:\"\";s:9:\"\u0000*\u0000btitle\";s:117:\"Declarative agent languages and technologies IV (4th International workshop, DALT 2006, Hakodate, Japan, May 8, 2006)\";s:8:\"\u0000*\u0000title\";s:80:\"The complexity of model checking concurrent programs against CTLK specifications\";s:8:\"\u0000*\u0000place\";s:6:\"Berlin\";s:6:\"\u0000*\u0000pub\";s:8:\"Springer\";s:10:\"\u0000*\u0000edition\";s:0:\"\";s:9:\"\u0000*\u0000tpages\";s:2:\"14\";s:9:\"\u0000*\u0000series\";s:0:\"\";s:8:\"\u0000*\u0000proxy\";s:30:\"http:\/\/proxyout.inist.fr:8080\/\";s:12:\"\u0000*\u0000integrite\";b:1;}"
Base Search access
"O:12:\"ArXivOpenUrl\":35:{s:10:\"\u0000*\u0000openUrl\";N;s:6:\"\u0000*\u0000fmt\";s:10:\"proceeding\";s:6:\"\u0000*\u0000doi\";s:18:\"10.1007\/11961536_3\";s:6:\"\u0000*\u0000pii\";s:0:\"\";s:7:\"\u0000*\u0000pmid\";s:0:\"\";s:9:\"\u0000*\u0000atitle\";s:80:\"The complexity of model checking concurrent programs against CTLK specifications\";s:9:\"\u0000*\u0000jtitle\";s:33:\"Lecture notes in computer science\";s:9:\"\u0000*\u0000stitle\";s:23:\"Lect. notes comput. sci\";s:7:\"\u0000*\u0000date\";s:4:\"2006\";s:9:\"\u0000*\u0000volume\";s:0:\"\";s:8:\"\u0000*\u0000issue\";s:0:\"\";s:8:\"\u0000*\u0000spage\";s:2:\"29\";s:8:\"\u0000*\u0000epage\";s:2:\"42\";s:8:\"\u0000*\u0000pages\";s:0:\"\";s:7:\"\u0000*\u0000issn\";s:9:\"0302-9743\";s:8:\"\u0000*\u0000eissn\";s:0:\"\";s:9:\"\u0000*\u0000aulast\";s:8:\"LOMUSCIO\";s:10:\"\u0000*\u0000aufirst\";s:7:\"Alessio\";s:9:\"\u0000*\u0000auinit\";s:0:\"\";s:10:\"\u0000*\u0000auinitm\";s:0:\"\";s:5:\"\u0000*\u0000au\";a:1:{i:0;s:16:\"RAIMONDI, Franco\";}s:9:\"\u0000*\u0000aucorp\";s:0:\"\";s:7:\"\u0000*\u0000isbn\";s:13:\"3-540-68959-1\";s:8:\"\u0000*\u0000coden\";s:0:\"\";s:8:\"\u0000*\u0000genre\";s:10:\"proceeding\";s:7:\"\u0000*\u0000part\";s:0:\"\";s:9:\"\u0000*\u0000btitle\";s:117:\"Declarative agent languages and technologies IV (4th International workshop, DALT 2006, Hakodate, Japan, May 8, 2006)\";s:8:\"\u0000*\u0000title\";s:80:\"The complexity of model checking concurrent programs against CTLK specifications\";s:8:\"\u0000*\u0000place\";s:6:\"Berlin\";s:6:\"\u0000*\u0000pub\";s:8:\"Springer\";s:10:\"\u0000*\u0000edition\";s:0:\"\";s:9:\"\u0000*\u0000tpages\";s:2:\"14\";s:9:\"\u0000*\u0000series\";s:0:\"\";s:8:\"\u0000*\u0000proxy\";s:30:\"http:\/\/proxyout.inist.fr:8080\/\";s:12:\"\u0000*\u0000integrite\";b:1;}"
arXiv access
