Sciweavers

243 search results - page 28 / 49
» Process Algebra: An Algebraic Theory of Concurrency
Sort
View
CONCUR
2006
Springer
15 years 1 months ago
On Finite Alphabets and Infinite Bases III: Simulation
This paper studies the (in)equational theory of simulation preorder and equivalence over the process algebra BCCSP. We prove that in the presence of a finite alphabet with at least...
Taolue Chen, Wan Fokkink
77
Voted
CALCO
2007
Springer
112views Mathematics» more  CALCO 2007»
15 years 3 months ago
Impossibility Results for the Equational Theory of Timed CCS
We study the equational theory of Timed CCS as proposed by Wang Yi in CONCUR’90. Common to Wang Yi’s paper, we particularly focus on a class of linearly-ordered time domains ex...
Luca Aceto, Anna Ingólfsdóttir, Moha...
ACS
2007
14 years 9 months ago
A Topologist's View of Chu Spaces
Abstract. For a symmetric monoidal-closed category X and any object K, the category of K-Chu spaces is small-topological over X and small cotopological over Xop . Its full subcateg...
Eraldo Giuli, Walter Tholen
JLP
2006
108views more  JLP 2006»
14 years 9 months ago
On testing UML statecharts
We present a formal framework for notions related to testing and model based test generation for a behavioural subset of UML Statecharts (UMLSCs). This framework builds, on one ha...
Mieke Massink, Diego Latella, Stefania Gnesi
ENTCS
2007
108views more  ENTCS 2007»
14 years 9 months ago
Remarks on Testing Probabilistic Processes
We develop a general testing scenario for probabilistic processes, giving rise to two theories: probabilistic may testing and probabilistic must testing. These are applied to a si...
Yuxin Deng, Rob J. van Glabbeek, Matthew Hennessy,...