نتایج جستجو برای: discrete trace transition system

تعداد نتایج: 2610063  

2004
Aaron D. Ames S. Shankar Sastry

Affine hybrid systems are hybrid systems in which the discrete domains are affine sets and the transition maps between discrete domains are affine transformations. The simple structure of these systems results in interesting geometric properties; one of these is the notion of spatial equivalence. In this paper, a formal framework for describing affine hybrid systems is introduced. As an applica...

2010
Glauco A. P. Caurin Leonardo M. Pedro

This paper presents a manipulation planning approach for robot hands that enables the generation of finger trajectories. The planner is based on a hybrid approach that combines discrete-continuous kinematics using a fully discrete transition system. One of the main contributions of this work consists in the representation of the universe of different submodel combinations, as states in a discre...

2007
Rein Smedinga

Logical discrete event systems can be modelled using trace theory. In this paper we present an eeective algorithm to nd a controller using an operator (the reeection) that leads to systems that go beyond our scope. We deene a discrete event system (DES) to be a triple, see Sme93b, Sme93c]: P = haP; bP; tPi with aP the alphabet (set of events), bP (aP) the behaviour set, and tP (aP) the task set...

1998
Pieter J. Mosterman Feng Zhao Gautam Biswas

Physical systems often exhibit complex nonlinear behaviors in continuous time at multiple temporal and spatial scales. Abstractions simplify behavioral analysis and help focus on dominant system behaviors by defining sets of equivalent behavior types called modes. System behavior evolves in continuous modes with discrete transitions between modes. Subtle interactions between the continuous beha...

1991
Kohei Honda Mario Tokoro

This paper presents some results concerning equational theories for an elementary calculus based on a fragment of Milner's-calculus. The system is interesting because it realises asynchronous message passing not by extending but reducing the original fragment, while preserving the computational power. The bisimulation based on a novel asynchronous transition system is introduced and studied. Pr...

Journal: :Bioinorganic chemistry 1976
J Webb K A Kirk W Niedermeier J H Griggs M E Turner T N James

The concentrations of 8 trace metals in 15 discrete anatomic sites of 11 beef hearts have been determined by emission spectrometry. The metals determined were copper, aluminum, barium cesium, tin, strontium, lead, and molybdenum. Anatomic sites samples included aorta, main pulmonary artery, tricuspid valve, mitral valve, right and left coronary arteries, os cordis, right atrium, left atrial app...

1998
Judi Romijn Jan Springintveld

Test generation and execution are often hampered by the large state spaces of the systems involved. In automata (or transition system) based test algorithms, taking advantage of symmetry in the behavior of specification and implementation may substantially reduce the amount of tests. We present a framework for describing and exploiting symmetries in black box test derivation methods based on fi...

1995
Bengt Jonsson Wang Yi

Transition systems are well-established as a semantic model for distributed systems. There are widely accepted preorders that serve as criteria for reenement of a more abstract transition system to a more concrete one. To reason about probabilistic phenomena such as failure rates, we need to extend models and methods that have proven successful for non-probabilistic systems to a probabilistic s...

1993
Peter B. Ladkin Stefan Leue

We propose a semantics for Message Sequence Charts (MSCs). Our requirements are: to determine unambiguously which execution traces are allowed by an MSC; and to use a nite-state interpretation. Our semantics handles both synchronous and asynchronous communication. We deene a global state automaton from an MSC, by rst deening a transition system of global states, and from that a B uchi automaton...

Journal: :Logical Methods in Computer Science 2012
Antti Valmari

The detailed behaviour of a system is often represented as a labelled transition system (LTS) and the abstract behaviour as a stuttering-insensitive semantic congruence. Numerous congruences have been presented in the literature. On the other hand, there have not been many results proving the absence of more congruences. This publication fully analyses the linear-time (in a well-defined sense) ...

نمودار تعداد نتایج جستجو در هر سال

با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید