102,328 research outputs found
A Survey on Continuous Time Computations
We provide an overview of theories of continuous time computation. These
theories allow us to understand both the hardness of questions related to
continuous time dynamical systems and the computational power of continuous
time analog models. We survey the existing models, summarizing results, and
point to relevant references in the literature
Platform Dependent Verification: On Engineering Verification Tools for 21st Century
The paper overviews recent developments in platform-dependent explicit-state
LTL model checking.Comment: In Proceedings PDMC 2011, arXiv:1111.006
Index to Library Trends Volume 38
published or submitted for publicatio
A process algebra based framework for promise theory
We present a process algebra based approach to formalize the interactions of
computing devices such as the representation of policies and the resolution of
conflicts. As an example we specify how promises may be used in coming to an
agreement regarding a simple though practical transportation problem.Comment: 9 pages, 4 figure
Modelling Cell Cycle using Different Levels of Representation
Understanding the behaviour of biological systems requires a complex setting
of in vitro and in vivo experiments, which attracts high costs in terms of time
and resources. The use of mathematical models allows researchers to perform
computerised simulations of biological systems, which are called in silico
experiments, to attain important insights and predictions about the system
behaviour with a considerably lower cost. Computer visualisation is an
important part of this approach, since it provides a realistic representation
of the system behaviour. We define a formal methodology to model biological
systems using different levels of representation: a purely formal
representation, which we call molecular level, models the biochemical dynamics
of the system; visualisation-oriented representations, which we call visual
levels, provide views of the biological system at a higher level of
organisation and are equipped with the necessary spatial information to
generate the appropriate visualisation. We choose Spatial CLS, a formal
language belonging to the class of Calculi of Looping Sequences, as the
formalism for modelling all representation levels. We illustrate our approach
using the budding yeast cell cycle as a case study
NASA/DOD Aerospace Knowledge Diffusion Research Project. Report 14: Engineering work and information use in aerospace: Results of a telephone survey
A telephone survey of U.S. aerospace engineers and scientists who were on the Society of Automotive Engineers (SAE) mailing list was conducted between August 14-26, 1991. The survey was undertaken to obtain information on the daily work activities of aerospace engineers and scientists, to measure various practices used by aerospace engineers and scientists to obtain STI, and to ask aerospace engineers and scientists about their use of electronic networks. Co-workers were found important sources of information. Co-workers are used to obtain technical information because the information they have is relevant, not because co-workers are accessible. As technical uncertainty increases, so does the need for information internal and external to the organization. Electronic networks enjoy widespread use within the aerospace community. These networks are accessible and they are used to contact people at remote sites. About 80 percent of the respondents used electronic mail, file transfer, and information or data retrieval to commercial or in-house data bases
A Type Inference Algorithm for Secure Ambients
We consider a type discipline for the Ambient Calculus that associates ambients with security levels and constrains them to be traversed by or opened in ambients of higher security clearance only. We present a bottom-up algorithm that, given an untyped process , computes a minimal set of constraints on security levels such that all actions during runs of are performed without violating the security level priorities. Such an algorithm appears to be a prerequisite to use type systems to ensure security properties in the web scenario
Benchmarks for Parity Games (extended version)
We propose a benchmark suite for parity games that includes all benchmarks
that have been used in the literature, and make it available online. We give an
overview of the parity games, including a description of how they have been
generated. We also describe structural properties of parity games, and using
these properties we show that our benchmarks are representative. With this work
we provide a starting point for further experimentation with parity games.Comment: The corresponding tool and benchmarks are available from
https://github.com/jkeiren/paritygame-generator. This is an extended version
of the paper that has been accepted for FSEN 201
- …