22 search results - page 3 / 5 » Weak Sequential Composition in Process Algebras |
BIRTHDAY
2005
Springer
13 years 11 months ago
2005
Springer
Abstract. Van Glabbeek (1990) presented the linear time/branching time spectrum of behavioral equivalences for finitely branching, concrete, sequential processes. He studied these...
CONCUR
1997
Springer
13 years 9 months ago
1997
Springer
We prove that a bounded stack can be specified in process algebra with just the operators alternative and sequential composition and iteration. The bounded bag cannot be specified ...
CONCUR
1998
Springer
13 years 9 months ago
1998
Springer
PA is the process algebra allowing non-determinism, sequential and parallel compositions, and recursion. We suggest viewing PA-processes as trees, and using treeautomata technique...
SCP
2000
13 years 5 months ago
2000
Obtaining performance models, like Markov chains and queueing networks, for systems of significant complexity and magnitude is a difficult task that is usually tackled using human...
IPPS
2006
IEEE
13 years 11 months ago
2006
IEEE
— Many interesting problems in graph theory can be reduced to solving an eigenproblem of the adjacency matrix or Laplacian of a graph. Given the availability of high-quality line...