Sciweavers

Share
ENTCS
2006
119views more  ENTCS 2006»
8 years 8 months ago
Markovian Testing and Trace Equivalences Exactly Lump More Than Markovian Bisimilarity
The notion of equivalence that is typically used to relate Markovian process terms and to reduce their underlying state spaces is Markovian bisimilarity. The reason is that, besid...
Marco Bernardo
ENTCS
2006
105views more  ENTCS 2006»
8 years 8 months ago
Monte Carlo Methods for Process Algebra
We review the recently developed technique of Monte Carlo model checking and show how it can be applied to the implementation problem for I/O Automata. We then consider some open ...
Radu Grosu, Scott A. Smolka
ENTCS
2006
91views more  ENTCS 2006»
8 years 8 months ago
On Specifying Timeouts
This paper raises the question on how to specify timeouts in process algebra, and finds that the basic formalisms fall short in this task.
Rob J. van Glabbeek
ENTCS
2006
96views more  ENTCS 2006»
8 years 8 months ago
Timed CSP: A Retrospective
Joël Ouaknine, Steve Schneider
ENTCS
2006
94views more  ENTCS 2006»
8 years 8 months ago
Reactive Concurrent Programming Revisited
In this note we revisit the so-called reactive programming style, which evolves from the synchronous programming model of the Esterel language by weakening the assumption that the...
Roberto M. Amadio, Gérard Boudol, Fré...
ENTCS
2006
98views more  ENTCS 2006»
8 years 8 months ago
A Generic Process Algebra
The three classical process algebras CCS, CSP and ACP present several differences in their respective technical machinery. This is due, not only to the difference in their operato...
Jos C. M. Baeten, Mario Bravetti
ENTCS
2006
94views more  ENTCS 2006»
8 years 8 months ago
Much Ado About Nothing?
Rachele Fuzzati, Uwe Nestmann
books