1,721,015 research outputs found
Decidability Results for Parametric Probabilistic Transition Systems with an Application to Security
No full textRetiming techniques for Statechatrs
No full textWe consider a version of Statecharts having transitions with durations. We relate occurrences of transitions with a dense time domain and enforce a strong time semantics. We examine how durations associated with transitions can be changed while preserving behaviour (a retiming). We discuss also how a class of changes of the temporal feature of the environment (i.e. from non-discrete to discrete and vice-versa, shift, speed-up and slow-down) affect behaviour
CLASSES OF SYSTOLIC Y-TREE AUTOMATA AND A COMPARISON WITH SYSTOLIC TRELLIS AUTOMATA
No full textIn this paper we study systolic Y-tree automata (SYTA), a class of systolic automata where the communication structure is obtained by adding new edges, and therefore new sons, called adoptive sons, to the nodes of the underlying tree according to some regularity condition. We study SYTA in the more specific case where the tree is t-ary or a tree with base. We show that for each s greater-than-or-equal-to 0 the set of classes of languages accepted by SYTA whose underlying tree is a tree with base with s leaves has a maximum, called LsSYTA. We study when LsSYTA is reached depending on number and position of the adoptive sons. We prove that if s and t are powers of the same base, then LsSYTA = LtSYTA. We give also a simulation of SYTA on regular and modular systolic trellis automata, strengthening a previous result on simulation of systolic tree automata on systolic trellis automata
Transitions as interrupts: a new semantics for timed Statecharts
No full textStatecharts is a visual formalism for the specification of reactive systems. The formalism has been endowed with a step-semantics which heavily bounds the complexity of the reaction in a step, does not model interrupts in a natural way and is not proper for investigating refinement. In this paper, a new model is proposed allowing to overcome the mentioned drawbacks. From a syntactic point of view statecharts are generalized by introducing real time features like delays and timeouts. Though occurrencies of actions are related to a dense time domain, the behaviour of statecharts is forced to be discrete. Classes of statecharts are investigated which intrinsically behave discretel
- …
