-
1
-
-
0031334956
-
Alternating-time temporal logic
-
IEEE Computer Society
-
R. Alur, T.A. Henzinger and O. Kupferman, Alternating-time temporal logic, in: Proceedings of the 38th Annual Symposium on Foundations of Computer Science (FOCS), IEEE Computer Society, 1997, pp. 100-109.
-
(1997)
Proceedings of the 38th Annual Symposium on Foundations of Computer Science (FOCS)
, pp. 100-109
-
-
Alur, R.1
Henzinger, T.A.2
Kupferman, O.3
-
2
-
-
84949185739
-
Alternating-time temporal logic
-
Lecture Notes in Computer Science
-
R. Alur, T.A. Henzinger and O. Kupferman, Alternating-time temporal logic, in: Compositionality: The Significant Difference, Lecture Notes in Computer Science, Vol. 1536, 1998, pp. 23-60.
-
(1998)
Compositionality: The Significant Difference
, vol.1536
, pp. 23-60
-
-
Alur, R.1
Henzinger, T.A.2
Kupferman, O.3
-
4
-
-
78650357365
-
Model checking logics of strategic ability: Complexity
-
M. Dastani, K. Hindriks and J.-J. Meyer, eds, Springer-Verlag
-
N. Bulling, J. Dix and W. Jamroga, Model checking logics of strategic ability: Complexity, in: Specification and Verification of Multi-Agent Systems, M. Dastani, K. Hindriks and J.-J. Meyer, eds, Springer-Verlag, 2010, pp. 125-159.
-
(2010)
Specification and Verification of Multi-Agent Systems
, pp. 125-159
-
-
Bulling, N.1
Dix, J.2
Jamroga, W.3
-
5
-
-
52449102769
-
Agents, beliefs and plausible behaviour in a temporal setting
-
N. Bulling and W. Jamroga, Agents, beliefs and plausible behaviour in a temporal setting, in: Proceedings of AAMAS'07, 2007, pp. 570-577.
-
(2007)
Proceedings of AAMAS'07
, pp. 570-577
-
-
Bulling, N.1
Jamroga, W.2
-
7
-
-
78650338211
-
Model checking agents with memory is harder than it seemed
-
N. Bulling andW. Jamroga, Model checking agents with memory is harder than it seemed, in: Proceedings of AAMAS2010, 2010, pp. 633-640.
-
(2010)
Proceedings of AAMAS2010
, pp. 633-640
-
-
Bulling, N.1
Jamroga, W.2
-
8
-
-
85037030721
-
Design and synthesis of synchronization skeletons using branching time temporal logic
-
Lecture Notes in Computer Science, Springer-Verlag
-
E.M. Clarke and E.A. Emerson, Design and synthesis of synchronization skeletons using branching time temporal logic, in: Proceedings of Logics of Programs Workshop, Lecture Notes in Computer Science, Vol. 131, Springer-Verlag, 1981, pp. 52- 71.
-
(1981)
Proceedings of Logics of Programs Workshop
, vol.131
, pp. 52-71
-
-
Clarke, E.M.1
Emerson, E.A.2
-
9
-
-
84866939823
-
Reasoning about strategies of multi-agent programs
-
M. Dastani and W. Jamroga, Reasoning about strategies of multi-agent programs, in: Proceedings of AAMAS2010, 2010, pp. 625-632.
-
(2010)
Proceedings of AAMAS2010
, pp. 625-632
-
-
Dastani, M.1
Jamroga, W.2
-
10
-
-
0001449325
-
Temporal and modal logic
-
J. van Leeuwen, ed., Elsevier
-
E.A. Emerson, Temporal and modal logic, in: Handbook of Theoretical Computer Science, Vol. B, J. van Leeuwen, ed., Elsevier, 1990, pp. 995-1072.
-
(1990)
Handbook of Theoretical Computer Science
, vol.B
, pp. 995-1072
-
-
Emerson, E.A.1
-
11
-
-
84894631199
-
Approximating ATL* in ATL
-
Springer-Verlag
-
A. Harding, M. Ryan and P.-Y. Schobbens, Approximating ATL* in ATL, in: VMCAI'02: Revised Papers from the Third International Workshop on Verification, Model Checking, and Abstract Interpretation, Springer-Verlag, 2002, pp. 289-301.
-
(2002)
VMCAI'02: Revised Papers from the Third International Workshop on Verification, Model Checking, and Abstract Interpretation
, pp. 289-301
-
-
Harding, A.1
Ryan, M.2
Schobbens, P.-Y.3
-
13
-
-
33646158928
-
Do agents make model checking explode (computationally)?
-
M. Pěchouček, P. Petta and L.Z. Varga, eds, Lecture Notes in Computer Science, Springer-Verlag
-
W. Jamroga and J. Dix, Do agents make model checking explode (computationally)?, in: Proceedings of CEEMAS 2005, M. P?echou?cek, P. Petta and L.Z. Varga, eds, Lecture Notes in Computer Science, Vol. 3690, Springer-Verlag, 2005, pp. 398- 407.
-
Proceedings of CEEMAS 2005
, vol.3690
, Issue.2005
, pp. 398-407
-
-
Jamroga, W.1
Dix, J.2
-
14
-
-
78249285403
-
On the expressiveness and complexity of ATL
-
F. Laroussinie, N. Markey and G. Oreiby, On the expressiveness and complexity of ATL, LMCS 4 (2008), 7.
-
(2008)
LMCS
, vol.4
, pp. 7
-
-
Laroussinie, F.1
Markey, N.2
Oreiby, G.3
-
15
-
-
77951489393
-
Model checking CTL+and FCTL is hard
-
Lecture Notes in Computer Science, Springer-Verlag
-
F. Laroussinie, N. Markey and P. Schnoebelen, Model checking CTL+and FCTL is hard, in: Proceedings of FoSSaCS'01, Lecture Notes in Computer Science, Vol. 2030, Springer-Verlag, 2001, pp. 318-331.
-
(2001)
Proceedings of FoSSaCS'01
, vol.2030
, pp. 318-331
-
-
Laroussinie, F.1
Markey, N.2
Schnoebelen, P.3
-
16
-
-
0038812256
-
Deontic interpreted systems
-
A. Lomuscio and M. Sergot, Deontic interpreted systems, Studia Logica 75(1) (2003), 63-92.
-
(2003)
Studia Logica
, vol.75
, Issue.1
, pp. 63-92
-
-
Lomuscio, A.1
Sergot, M.2
-
17
-
-
10944258530
-
A formalisation of violation, error recovery, and enforcement in the bit transmission problem
-
A. Lomuscio and M. Sergot, A formalisation of violation, error recovery, and enforcement in the bit transmission problem, Journal of Applied Logic 2(1) (2004), 93-116.
-
(2004)
Journal of Applied Logic
, vol.2
, Issue.1
, pp. 93-116
-
-
Lomuscio, A.1
Sergot, M.2
-
20
-
-
34247255515
-
On the complexity of practical ATL model checking
-
P. Stone and G. Weiss, eds
-
W. van der Hoek, A. Lomuscio and M. Wooldridge, On the complexity of practical ATL model checking, in: Proceedings of AAMAS'06, P. Stone and G. Weiss, eds, 2006, pp. 201-208.
-
(2006)
Proceedings of AAMAS'06
, pp. 201-208
-
-
Hoek Der W.Van1
Lomuscio, A.2
Wooldridge, M.3
-
21
-
-
34047124635
-
Social laws in alternating time: Effectiveness, feasibility and synthesis
-
W. van der Hoek, M. Roberts and M. Wooldridge, Social laws in alternating time: Effectiveness, feasibility and synthesis, Synthese 156(1) (2005), 1-19.
-
(2005)
Synthese
, vol.156
, Issue.1
, pp. 1-19
-
-
Hoek Der W.Van1
Roberts, M.2
Wooldridge, M.3
-
22
-
-
84958743461
-
CTL+ is exponentially more succint than CTL
-
Lecture Notes in Computer Science, Springer-Verlag
-
T. Wilke, CTL+ is exponentially more succint than CTL, in: Proceedings of FST&TCS'99, Lecture Notes in Computer Science, Vol. 1738, Springer-Verlag, 1999, pp. 110-121.
-
(1999)
Proceedings of FST&TCS'99
, vol.1738
, pp. 110-121
-
-
Wilke, T.1
-
23
-
-
26844565954
-
A logic for knowledge, correctness, and real time
-
Lecture Notes in Computer Science, Springer-Verlag
-
B. Wozna and A. Lomuscio, A logic for knowledge, correctness, and real time, in: Proceedings of CLIMA V, Lecture Notes in Computer Science, Vol. 3487, Springer-Verlag, 2005, pp. 1- 15.
-
(2005)
Proceedings of CLIMA v
, vol.3487
, pp. 1-15
-
-
Wozna, B.1
Lomuscio, A.2
|