Sciweavers

950 search results - page 3 / 190
» Process Algebra in PVS
Sort
View
CHARME
2001
Springer
162views Hardware» more  CHARME 2001»
13 years 11 months ago
Parameterized Verification of the FLASH Cache Coherence Protocol by Compositional Model Checking
We consider the formal verification of the cache coherence protocol of the Stanford FLASH multiprocessor for N processors. The proof uses the SMV proof assistant, a proof system ba...
Kenneth L. McMillan
ENTCS
2008
94views more  ENTCS 2008»
13 years 7 months ago
Expressiveness of Process Algebras
We examine ways to measure expressiveness of process algebras, and recapitulate and compare some related results from the literature.
Joachim Parrow
FUIN
2002
89views more  FUIN 2002»
13 years 7 months ago
Process Algebra with Nonstandard Timing
The possibility of two or more actions to be performed consecutively at the same point in time is not excluded in the process algebras from the framework of process algebras with t...
Kees Middelburg
TGC
2010
Springer
13 years 5 months ago
Uniform Labeled Transition Systems for Nondeterministic, Probabilistic, and Stochastic Processes
Rate transition systems (RTS) are a special kind of transition systems introduced for defining the stochastic behavior of processes and for associating continuous-time Markov chain...
Marco Bernardo, Rocco De Nicola, Michele Loreti
CALCO
2005
Springer
76views Mathematics» more  CALCO 2005»
14 years 1 months ago
Strong Splitting Bisimulation Equivalence
We present ACPc , a process algebra with conditional expressions in which the conditions are taken from a Boolean algebra, and extensions of this process algebra with mechanisms fo...
Jan A. Bergstra, C. A. Middelburg