63 search results - page 4 / 13 » The Complexity of Model Checking in Modal Event Calculi |
179
Voted
TIME
2003
IEEE
15 years 10 months ago
2003
IEEE
We investigate expressivity and complexity of hybrid logics on linear structures. Hybrid logics are an enrichment of modal logics with certain first-order features which are algo...
128
click to vote
ASM
2008
ASM
15 years 7 months ago
2008
ASM
As systems become ever more complex, verification becomes more main stream. Event-B and Alloy are two formal specification languages based on fairly different methodologies. While...
129
Voted
ICALP
2010
Springer
15 years 9 months ago
2010
Springer
We investigate the decidability and complexity of various model checking problems over one-counter automata. More specifically, we consider succinct one-counter automata, in which...
154
click to vote
KI
2008
Springer
15 years 4 months ago
2008
Springer
Abstract. Modal logics see a wide variety of applications in artificial intelligence, e.g. in reasoning about knowledge, belief, uncertainty, agency, defaults, and relevance. From ...
160
click to vote
ISORC
2005
IEEE
15 years 10 months ago
2005
IEEE
As complexity of real-time embedded software grows, it is desirable to use formal verification techniques to achieve a high level of assurance. We discuss application of model-ch...