Sciweavers

433 search results - page 39 / 87
» On stabilizers of infinite words
Sort
View
79
Voted
IPL
2008
84views more  IPL 2008»
15 years 23 days ago
The equational theory of prebisimilarity over basic CCS with divergence
This paper studies the equational theory of prebisimilarity, a bisimulation-based preorder introduced by Hennessy and Milner in the early 1980s, over basic CCS with the divergent ...
Luca Aceto, Silvio Capobianco, Anna Ingólfs...
83
Voted
JUCS
2006
73views more  JUCS 2006»
15 years 21 days ago
Proving Properties for Behavioural Specifications with Term Observation
: Behavioural specifications allow to focus only on the"observable" behaviour of objects. These observations are made through "observable contexts" which are pa...
Narjes Berregeb
TCS
2008
15 years 20 days ago
Simple permutations: Decidability and unavoidable substructures
We prove that it is decidable whether a finitely based permutation class contains infinitely many simple permutations, and establish an unavoidable substructure result for simple ...
Robert Brignall, Nikola Ruskuc, Vincent Vatter
TCS
2008
15 years 20 days ago
Fine hierarchies and m-reducibilities in theoretical computer science
This is a survey of results about versions of fine hierarchies and many-one reducibilities that appear in different parts of theoretical computer science. These notions and relate...
Victor L. Selivanov
AUTOMATICA
2002
95views more  AUTOMATICA 2002»
15 years 19 days ago
Series expansions for analytic systems linear in control
This paper presents a series expansion for the evolution of a class of nonlinear systems characterized by constant input vector fields. We present a series expansion that can be c...
Francesco Bullo