Sciweavers

524 search results - page 36 / 105
» Temporal reachability graphs
Sort
View
CIBB
2009
13 years 11 months ago
On the Use of Temporal Formal Logic to Model Gene Regulatory Networks
Modelling activities in molecular biology face the difficulty of prediction to link molecular knowledge with cell phenotypes. Even when the interaction graph between molecules is k...
Gilles Bernot, Jean-Paul Comet
GPEM
2007
95views more  GPEM 2007»
13 years 9 months ago
Where is evolutionary computation going? A temporal analysis of the EC community
Studying an evolving complex system and drawing some conclusions from it is an integral part of nature-inspired computing; being a part of that complex system, some insight can als...
Carlos Cotta, Juan Julián Merelo Guerv&oacu...
ATAL
2005
Springer
14 years 3 months ago
Model generation for PRS-like agents
We develop a sound foundation for model checking algorithms for the class of PRS-style BDI agents, by showing how a reachability graph for any given PRS-type agent can be construc...
Wayne Wobcke, Marc Chee, Krystian Ji
APN
2004
Springer
14 years 3 months ago
LTL Model Checking for Modular Petri Nets
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...
Timo Latvala, Marko Mäkelä
ENTCS
2002
108views more  ENTCS 2002»
13 years 9 months ago
Rewriting in the partial algebra of typed terms modulo AC
We study the partial algebra of typed terms with an associative commutative and idempotent operator (typed AC-terms). The originality lies in the representation of the typing poli...
Thomas Colcombet