Computer and information sciences topic list of research papers
-
Probabilistic π-Calculus and Event Structures
Abstract This paper proposes two semantics of a probabilistic variant of the π-calculus: an interleaving semantics in terms of Segala automata and a true concurrent semantics, in terms of probabilistic event structures. The key technical point is a...
2007 / Daniele Varacca, Nobuko Yoshida -
Separation of Synchronous and Asynchronous Communication Via Testing
Abstract One of the early results about the asynchronous π-calculus which significantly contributed to its popularity is the capability of encoding the output prefix of the (choiceless) π-calculus in a natural and elegant way. Encodings of this kind ...
2006 / Diletta Cacciagrano, Flavio Corradini, Catuscia Palamidessi -
Effective Randomness for Computable Probability Measures
Abstract Any notion of effective randomness that is defined with respect to arbitrary computable probability measures canonically induces an equivalence relation on such measures for which two measures are considered equivalent if their respective...
2007 / Laurent Bienvenu, Wolfgang Merkle -
Complementarity of Error Detection Techniques
Abstract We study explicit techniques for detection of safety errors, e.g., depth-first search, directed search, random walk, and bitstate hashing. We argue that it is not important to find the best technique, but to find a set of complementary...
2008 / Radek Pelánek, Václav Rosecký, Pavel Moravec -
Probabilistic Completion of Nondeterministic Models
Abstract This work continues ongoing research in combining theories of nondeterminism and probabilistic choice. First, we adapt the above choice theories to allow for uncountably indexed nondeterministic operators, and countably indexed...
2007 / Guy Beaulieu -
Markovian Testing and Trace Equivalences Exactly Lump More Than Markovian Bisimilarity
Abstract 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, besides being a congruence, Markovian bisimilarity is consistent...
2006 / Marco Bernardo -
Preface2010 / Sun Meng, Bernhard Schätz
-
Concise Graphs and Functional Bisimulations2004 / Ling Cheung, Jesse Hughes
-
Recognition of Toxic Gases Emission in Power Plant Based on Artificial Neural Network
Abstract Two kinds of methods of artificial neural network, which are used to recognized toxic gas, are presented and the effects of recognition are also compared. Firstly, the composition and principle of sensor array sensitive to toxic gas are...
2012 / Meng Xiaomin -
A Coalgebraic Semantic Framework for Component-based Development in UML
Abstract This paper introduces a generic semantic framework for component-based development, expressed in the unified modelling language UML. The principles of a coalgebraic semantics for class, object and statechart diagrams as well as for use...
2009 / Sun Meng, Bernhard K. Aichernig, Luís S. Barbosa, Zhang Naixiao -
A New Method for Transforming Timed Automata
Abstract Discrete events systems (DES) are defined by the sequences of events they can execute. For example, communication protocols and computer networks can be seen as DES. Finite state automata (FSA) are convenient for studying (i.e., analyzing,...
2005 / Ahmed Khoumsi, Lucien Ouedraogo -
A New Interface Circuit for High-Value Wide-Range Resistive Chemical Sensor Dynamic Characterization
Abstract Metal oxide (MOX) gas sensors, as well as the new nanowire-based sensors, can show resistive values varying over a wide range and could have the baseline value up to tens of gigohms. Some interface circuits use Resistance-to-Time Conversion ...
2009 / A. Depari, A. Flammini, D. Marioli, E. Sisinni -
High performance distributed cluster-based individual-oriented fish school simulation
Abstract Individual-oriented simulation allows us to represent the global behavior of a system through local interaction in discrete time steps. As we face up close-to-reality models and large-scale workloads, we focus on turning from traditional...
2011 / Roberto Solar, Remo Suppi, Emilio Luque -
Simplifying and improving ant-based clustering
Abstract Ant-based clustering (ABC) is a data clustering approach inspired from cemetery formation activities observed in real ant colonies. Building upon the premise of collective intelligence, such an approach uses multiple ant-like agents and a...
2011 / Swee Chuan Tan, Kai Ming Ting, Shyh Wei Teng -
Presented a fuzzy system to determine barberry product quality based on average color spectra by image processing
Abstract In recent years much research in the field of classification and classification of crops based on characteristics using image processing have been done in this study to determine the level of product quality barberry impurities and the...
2010 / Hossein Shirgahi, Najmeh Danesh -
SCOlog: A logic-based approach to analysing supply chain operation dynamics
Abstract In a complex business world, characterised by globalisation and rapid rhythms of change, understanding supply chain (SC) operation dynamics is crucial. This paper describes a logic-based approach to analysing SC operation dynamics, named...
2013 / Areti Manataki, Yun-Heh Chen-Burger, Michael Rovatsos -
Information processing using a single dynamical node as complex system2011 / L. Appeltant, M.C. Soriano, G. Van der Sande, J. Danckaert, S. Massar, et al.
-
Randomness Preserving Deletions on Special Binary Search Trees
Abstract Deletions in binary search trees are difficult to analyse as they are not randomness preserving. We will present a new kind of tree which differs slightly from the standard binary search tree. It will be referred to as an ordered binary...
2009 / Michaela Heyer -
Compositional Properties of Sequential Processes
Abstract It is widely agreed that the modular method is one of the most effective methods to specify and verify complex systems in order to avoid combinatorial explosion. FLC ( Fixpoint Logic with Chop) is an important modal logic because of its...
2005 / Naijun Zhan -
Resource Graphs and Countermodels in Resource Logics
Abstract In this abstract we emphasize the role of a semantic structure called resource graph in order to study the provability in some resource-sensitive logics, like the Bunched Implications Logic (BI) or the Non-commutative Logic (NL). Such a...
2005 / Didier Galmiche, Daniel Méry