Effective learning system techniques for human-robot interaction in service environment
Knowledge-Based Systems
Comparing the Expressiveness of Timed Automata and Timed Extensions of Petri Nets
FORMATS '08 Proceedings of the 6th international conference on Formal Modeling and Analysis of Timed Systems
Verification of timed-arc Petri nets
SOFSEM'11 Proceedings of the 37th international conference on Current trends in theory and practice of computer science
Petri Nets and Discrete Events Systems
International Journal of Software Science and Computational Intelligence
| Hi-index | 0.00 |
In this paper we use the graphical formalism timed-arc Petri nets to specify cognitive systems. In addition to the usual characteristics of this formalism, this timed extension of PNs features the possibility of capturing the facts of enabling/disabling a transition as a consequence of the time elapsed. This feature is useful to represent systems where the delays can strongly modify the state, such as the memorization process. In order to illustrate the suitability of this model we formally represent a cognitive model of the memory. This process includes the appropriate characteristics to show the advantages of having a very natural conception of concurrency as well as, how time can elapse and sometimes go beyond the threshold which determines if a perception goes into the long-term memory or not. The memory structure/working assumed can be better studied in Squire et al. (1993), Solso (1999), and Wang and Wang (2002).