67 search results - page 6 / 14 » Reasoning on temporal class diagrams: Undecidability results |
LICS
2005
IEEE
15 years 3 months ago
2005
IEEE
We provide a uniform solution to the problem of synthesizing a finite-state distributed system. An instance of the synthesis problem consists of a system architecture and a tempo...
CSL
1999
Springer
15 years 1 months ago
1999
Springer
Hybrid languages are extended modal languages which can refer to (or even quantify over) states. Such languages are better behaved proof theoretically than ordinary modal languages...
ILC
2007
Springer
15 years 3 months ago
2007
Springer
Abstract. We aim at checking safety and temporal properties over models representing the behavior of programs manipulating dynamic singly-linked lists. The properties we consider n...
CSL
2010
Springer
14 years 10 months ago
2010
Springer
We consider two-player games with imperfect information and quantitative objective. The game is played on a weighted graph with a state space partitioned into classes of indistingu...
KR
2010
Springer
15 years 1 months ago
2010
Springer
We investigate a class of first-order temporal epistemic logics for the specification of multi-agent systems. We consider well-known properties of multi-agent systems including ...