16 search results - page 1 / 4 » An Algebraic Framework for Defining Random Concurrent Behavi... |
87
Voted
FUIN
2008
15 years 14 days 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...
97
Voted
COORDINATION
2009
Springer
16 years 29 days 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...
106
Voted
ACSD
2001
IEEE
15 years 4 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...
129
Voted
CORR
2004
Springer
15 years 7 days 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...
172
Voted
POPL
2003
ACM
16 years 21 days 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 ...