16 search results - page 1 / 4 » An Algebraic Framework for Defining Random Concurrent Behavi... |
FUIN
2008
13 years 4 months ago
2008
Abstract. The paper is devoted to characterizing systems with random behaviours. The characterization is based on considering systems in terms of their possible runs, called proces...
COORDINATION
2009
Springer
14 years 5 months ago
2009
Springer
Process algebras are a set of mathematically rigourous languages with well defined semantics that permit modelling behaviour of concurrent and communicating systems. Verification o...
ACSD
2001
IEEE
13 years 8 months ago
2001
IEEE
We describe a framework where formal models can be rigorously defined and compared, and their interconnections can be unambiguously specified. We use trace algebra and trace struc...
CORR
2004
Springer
13 years 4 months ago
2004
Springer
Full formal descriptions of algorithms making use of quantum principles must take into account both quantum and classical computing components and assemble them so that they commu...
POPL
2003
ACM
14 years 5 months ago
2003
ACM
We present a generic aproach to the static analysis of concurrent programs with procedures. We model programs as communicating pushdown systems. It is known that typical dataflow ...