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

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

1999
Alongkrit Chutinan Bruce H. Krogh

This paper presents a computational technique for verifying properties of hybrid systems with arbitrary continuous dynamics. The approach is based on the computation of approximating automata, which are nite-state approximations to the (possibly innnite-state) discrete-trace transition system for the hybrid system. The fundamental computation in the generation of approximating automata is the m...

2007
Karl Erich Wolff

Based on Formal Concept Analysis the notion of a Temporal Conceptual Semantic System is introduced as a formal conceptual representation for temporal systems with arbitrary discrete or continuous semantic scales. In this paper, we start with an example of a weather map with a moving high pressure zone to explain the basic notions for Temporal Conceptual Semantic Systems. The central philosophic...

Journal: :Comput. J. 2016
Robert M. Hierons

There has been significant interest in distributed testing from an input output transition system. Previous work introduced an implementation relation dioco that was defined in terms of an equivalence relation on traces (sequences of observations). This paper considers an alternative approach in which an observation made in testing is a tuple of local traces, one for each tester. This paper def...

Journal: :CoRR 2017
Igor V. Tarasyuk Peter Buchholz

We propose fluid equivalences that allow one to compare and reduce behaviour of labeled fluid stochastic Petri nets (LFSPNs) while preserving their discrete and continuous properties. We define a linear-time relation of fluid trace equivalence and its branching-time counterpart, fluid bisimulation equivalence. Both fluid relations take into account the essential features of the LFSPNs behaviour...

1993
K. AuYeung P. W. Dowd

Abstract – We propose a synthetic address trace generation model which combine the accuracy advantage of trace-driven simulation and the low complexity advantage of discrete event simulation. The model provides flexibility in characterizing the system workload independent of cache structure. The generated address references not only synthesize the temporal and spatial locality behaviorbut also ...

Journal: :Physical review. E, Statistical, nonlinear, and soft matter physics 2008
Ken-Ichiro Arita Matthias Brack

We apply periodic orbit theory to a two-dimensional nonintegrable billiard system whose boundary is varied smoothly from a circular to an equilateral triangular shape. Although the classical dynamics becomes chaotic with increasing triangular deformation, it exhibits an astonishingly pronounced shell effect on its way through the shape transition. A semiclassical analysis reveals that this shel...

1999
Kei Itou

Object-oriented methodologies are often used for developing highly reliable systems. In object-oriented methodologies, state transition diagrams and event trace diagrams are used to describe the system behavior. The state transition diagram describes the behavior of each object while the event trace diagrams describes inter-object behavior. Event trace diagrams may include the timing order of o...

2009
Jérémy Dubreil Philippe Darondeau Hervé Marchand

In the field of computer security, a problem that received little attention so far is the enforcement of confidentiality properties by supervisory control. Given a critical system G that may leak confidential information, the problem consists in designing a controller C, possibly disabling occurrences of a fixed subset of events of G, so that the closed-loop system G/C does not leak confidentia...

2004
Luca de Alfaro Marco Faella Mariëlle Stoelinga

We extend the basic system relations of trace inclusion, trace equivalence, simulation, and bisimulation to a quantitative setting in which propositions are interpreted not as boolean values, but as real values in the interval [0,1]. Trace inclusion and equivalence give rise to asymmetrical and symmetrical linear distances, while simulation and bisimulation give rise to asymmetrical and symmetr...

2017
Bernd Finkbeiner Andrey Kupriyanov

Trace Tableau = concrete trace unwinding + abstract looping trace tableau • automatic procedure to find proofs in the form of a looping trace tableau Figure 1: Data structures for causality-based model checking. the property of interest. The exploration algorithm proceeds by picking some forest leaf, and employing an applicable trace transformer, producing a number of further nodes. The explora...

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

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