STOPA: a stochastic process algebra for the formal representation of cognitive systems
- 1 January 2004
- conference paper
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 64-73
Abstract
We present a formal language to specify cognitive systems. In addition to the usual characteristics of these formalisms, our language features the possibility of including stochastic time. This kind of time is useful to represent systems where the delays are not controlled by fix amounts of time, but they are given by a probability distribution function.Keywords
This publication has 23 references indexed in Scilit:
- An integrated framework for the performance analysis of asynchronous communicating stochastic processesFormal Aspects of Computing, 2004
- Towards the identification of living agents in complex computational environments2004
- Algebraic theory of probabilistic processesThe Journal of Logic and Algebraic Programming, 2003
- An example of performance evaluation by using the stochastic process algebra: ROSA2002
- A Testing Theory for Generally Distributed Stochastic Processes2001
- SPADES - a process algebra for discrete event simulationJournal of Logic and Computation, 2000
- A Compositional Approach to Performance Modelling1996
- Reactive, Generative, and Stratified Models of Probabilistic ProcessesInformation and Computation, 1995
- Acceptance trees for probabilistic processesLecture Notes in Computer Science, 1995
- An overview and synthesis on timed process algebras1992