181 search results - page 10 / 37 » Model checking Duration Calculus: a practical approach |
FOSSACS
2005
Springer
15 years 5 months ago
2005
Springer
Nominal calculi have been shown very effective to formally model a variety of computational phenomena. The models of nominal calculi have often infinite states, thus making model ...
100
click to vote
STACS
2010
Springer
15 years 6 months ago
2010
Springer
One-counter processes (OCPs) are pushdown processes which operate only on a unary stack alphabet. We study the computational complexity of model checking computation tree logic (CT...
ATAL
2006
Springer
15 years 3 months ago
2006
Springer
This paper is concerned with the problem of obtaining predictable interactions between groups of agents in open environments when individual agents do not expose their bdi logic. ...
TPHOL
1999
IEEE
15 years 4 months ago
1999
IEEE
Combining theorem proving and model checking o ers the tantalizing possibility of e ciently reasoning about large circuits at high levels of abstraction. We have constructed a syst...
116
click to vote
UTP
2010
14 years 10 months ago
2010
This paper presents an approach for modelling interactions between users and systems in the Unifying Theories of Programming. Working in the predicate calculus, we outline generic ...