803 research outputs found
Forward and backward simulations II. Timing-based systems
AbstractA general automaton model for timing-based systems is presented and is used as the context for developing a variety of simulation proof techniques for such systems. These techniques include (1) refinements, (2) forward and backward simulations, (3) hybrid forward–backward and backward–forward simulations, and (4) history and prophecy relations. Relationships between the different types of simulations, as well as soundness and completeness results, are stated and proved. These results are (with one exception) analogous to the results for untimed systems in Part I of this paper. In fact, many of the results for the timed case are obtained as consequences of the analogous results for the untimed case
A hybrid model of connectors in cyber-physical systems
Compositional coordination models and languages play an important role in cyber-physical systems (CPSs). In this paper, we introduce a formal model for describing hybrid behaviors of connectors in CPSs. We extend the constraint automata model, which is used as the semantic model for the exogenous channelbased coordination language Reo, to capture the dynamic behavior of connectors in CPSs where the discrete and continuous dynamics co-exist and interact with each other. In addition to the formalism, we also provide a theoretical compositional approach for constructing the product automata for a Reo circuit, which is typically obtained by composing several primitive connectors in Reo. ? Springer International Publishing Switzerland 2014.EI059-74882
Hybrid I/O automata
We propose a new hybrid I/O automaton model that is capable of describing both continuous and discrete behavior. The model, which extends the timed I/O automaton model of Lynch et al and the phase transition system models of Manna et al, allows communication among components using both shared variables and shared actions. The main contributions of this paper are: (1) the definition of hybrid I/O automata and of an implementation relation based on hybrid traces, (2) the definition of a simulation between hybrid I/O automata and a proof that existence of a simulation implies the implementation relation, (3) a definition of composition of hybrid I/O automata and a proof that it respects the implementation relation, and (4) a definition of receptiveness for hybrid I/O automata and a proof that, assuming certain compatibility conditions, receptiveness is preserved by composition
Geospatial analysis and living urban geometry
This essay outlines how to incorporate morphological rules within the exigencies of our technological age. We propose using the current evolution of GIS (Geographical Information Systems) technologies beyond their original representational domain, towards predictive and dynamic spatial models that help in constructing the new discipline of "urban seeding". We condemn the high-rise tower block as an unsuitable typology for a living city, and propose to re-establish human-scale urban fabric that resembles the traditional city. Pedestrian presence, density, and movement all reveal that open space between modernist buildings is not urban at all, but neither is the open space found in today's sprawling suburbs. True urban space contains and encourages pedestrian interactions, and has to be designed and built according to specific rules. The opposition between traditional self-organized versus modernist planned cities challenges the very core of the urban planning discipline. Planning has to be re-framed from being a tool creating a fixed future to become a visionary adaptive tool of dynamic states in evolution
Tight local approximation results for max-min linear programs
In a bipartite max-min LP, we are given a bipartite graph \myG = (V \cup I
\cup K, E), where each agent is adjacent to exactly one constraint
and exactly one objective . Each agent controls a
variable . For each we have a nonnegative linear constraint on
the variables of adjacent agents. For each we have a nonnegative
linear objective function of the variables of adjacent agents. The task is to
maximise the minimum of the objective functions. We study local algorithms
where each agent must choose based on input within its
constant-radius neighbourhood in \myG. We show that for every
there exists a local algorithm achieving the approximation ratio . We also show that this result is the best possible
-- no local algorithm can achieve the approximation ratio . Here is the maximum degree of a vertex , and
is the maximum degree of a vertex . As a methodological
contribution, we introduce the technique of graph unfolding for the design of
local approximation algorithms.Comment: 16 page
Correlation functions for a strongly correlated boson system
The correlation functions for a strongly correlated exactly solvable
one-dimensional boson system on a finite chain as well as in the thermodynamic
limit are calculated explicitly. This system which we call the phase model is
the strong coupling limit of the integrable q-boson hopping model. The results
are presented as determinants.Comment: 27 pages LaTe
- …