Sciweavers

5216 search results - page 830 / 1044
» Planning as Model Checking
Sort
View
SLP
1993
110views more  SLP 1993»
15 years 7 months ago
Logic Program Specialisation With Deletion of Useless Clauses
In this paper we describe a method of programspecialisation and give an extended example of its application to specialisation of a refutation proof procedure for rst order logic. ...
D. Andre de Waal, John P. Gallagher
CDC
2009
IEEE
126views Control Systems» more  CDC 2009»
15 years 7 months ago
Reachability analysis for a class of Petri nets
In this paper, we study the reachability problem for the class of (strictly) monotone Petri nets that we define based on algebraic conditions. More specifically, given a (strictly)...
Yu Ru, Christoforos N. Hadjicostis
AAMAS
2008
Springer
15 years 6 months ago
Organisational change through influence
We present the MOdel of Organisational Change using Agents (MOCHA) as a means to formally specify, check and simulate organisations and their changes using agents. We define the s...
Mairi McCallum, Wamberto Weber Vasconcelos, Timoth...
CORR
2008
Springer
96views Education» more  CORR 2008»
15 years 6 months ago
New Extensions of Pairing-based Signatures into Universal (Multi) Designated Verifier Signatures
The concept of universal designated verifier signatures was introduced by Steinfeld, Bull, Wang and Pieprzyk at Asiacrypt 2003. These signatures can be used as standard publicly ve...
Damien Vergnaud
CORR
2006
Springer
108views Education» more  CORR 2006»
15 years 6 months ago
Static Analysis using Parameterised Boolean Equation Systems
The well-known problem of state space explosion in model checking is even more critical when applying this technique to programming languages, mainly due to the presence of complex...
María-del-Mar Gallardo, Christophe Joubert,...