615 search results - page 70 / 123 » High-Level Nondeterministic Abstractions in |
105
click to vote
CONCUR
2000
Springer
15 years 6 months ago
2000
Springer
Abstract. In this paper, we introduce weak bisimulation in the framework of Labeled Concurrent Markov Chains, that is, probabilistic transition systems which exhibit both probabili...
FCT
1999
Springer
15 years 5 months ago
1999
Springer
Abstract. An iterative array is a line of interconnected interacting finite automata. One distinguished automaton, the communication cell, is connected to the outside world and fe...
102
click to vote
ECSQARU
1997
Springer
15 years 5 months ago
1997
Springer
Abstract. Temporal programming languages are recognized as natural and expressive formalisms for describing dynamic systems. However, most such languages are based on linear ow of ...
114
click to vote
PARLE
1993
15 years 5 months ago
1993
Abstract. We present a set of primitive program schemes, which together with just two basic combining forms provide a suprisingly expressive parallel programming language. The prim...
151
click to vote
MFCS
1994
Springer
15 years 5 months ago
1994
Springer
We introduce in this paper new communication and synchronization constructs which allow deterministic processes, communicating asynchronously via unbounded FIFO bu ers, to cope wi...