296 search results - page 37 / 60 » Linear Parametric Model Checking of Timed Automata |
BIRTHDAY
2008
Springer
13 years 9 months ago
2008
Springer
We use History Dependent Automata (HD-automata) as a syntax-indepentend formalism to check compatibility of services at binding time in Service-Oriented Computing. Informally speak...
APN
2004
Springer
14 years 1 months ago
2004
Springer
We consider the problem of model checking modular Petri nets for the linear time logic LTL-X. An algorithm is presented which can use the synchronisation graph from modular analysi...
CADE
2007
Springer
14 years 8 months ago
2007
Springer
Manna and Pnueli have extensively shown how a mixture of first-order logic (FOL) and discrete Linear time Temporal Logic (LTL) is sufficient to precisely state verification problem...
DBPL
2001
Springer
14 years 5 days ago
2001
Springer
In this paper we develop a new method for solving queries on semistructured data. The main idea is to see a database as a Kripke Transition System (a model) and a query as a formul...
ENTCS
2006
13 years 7 months ago
2006
In the past, partial order reduction has been used successfully to combat the state explosion problem in the context of model checking for non-probabilistic systems. For both line...