A. Arnold. Finite transition systems. Prentice-Hall. PrenticeHall, 1994. Home/Search Document Not in Database Summary Related Articles Check |
This paper is cited in the following contexts:
First 50 documents Next 50
Lazy Transition Systems and Asynchronous Circuit.. - Cortadella.. (2002) (Correct)
....presents basic definitions used in the paper. For brevity, the reader is assumed to be familiar with Petri nets, a formalism used to specify concurrent systems. The reader is referred to [26] for a general tutorial on Petri nets. A. Transition Systems A transition system (TS) is a quadruple [27] A = S; E; T ; s in ) where S is a non empty set of states , E is an alphabet of events , T ae S Theta E Theta S is a transition relation, and s in is an initial state. The elements of T are called the transitions of the TS and are often denoted by s instead of (s; e; s ) The ....
A. Arnold, Finite Transition Systems, Prentice Hall, 1994.
IEEE TRANSACTIONS ON VISUALIZATION AND COMPUTER.. - State Transition Systems (Correct)
....and vice versa. Index Terms Graph visualization, transition systems, state spaces, cone trees. I INTRODUCTION HE last decade has seen substantial progress in the analysis of computer based systems. A central approach in this analysis is to describe the behavior by means of a transition system [1] consisting of states and possible transitions between these states. The most commonly used techniques based on explicit state enumeration can now deal with transition systems of billions of states. So called symbolic techniques deal with even larger systems, employing a form of abstracted state ....
A. Arnold, Finite Transition Systems. Prentice Hall, 1994.
Synchronized Product of Linear Bounded Machines - Knapik, Payet (1999) (1 citation) (Correct)
....subgraph of G that is rooted on a vertex e is written G[e] Synchronized Product of Rooted Graphs. The synchronized product of graphs has been introduced by Arnold and Nivat [2, 21] It is an essential part of the semantic of interacting processes. For more material, the reader may refer to [1]. We introduce here a definition that is a variant of Arnold and Nivat s one. Indeed, in the scope of this paper, we need a product that takes as entry some rooted graphs and returns a rooted graph as well. Given n alphabets C 1 ; Cn possibly extended with , a synchronization constraint C ....
A. Arnold. Finite Transition Systems. Prentice Hall Int., 1994.
Verification of Timed Circuits with Symbolic Delays - Clariso, Cortadella (2003) (Correct)
....at least time units after becoming enabled, and the upper bound restriction states that time units after becoming enabled. The following definitions present the concepts of transition system and TTS, together with the semantics of these models, i.e. the concept of run . Definition 4. 1: [3] A transition system (TS) is a quadruple (h( where is a non empty set of states, is a non empty alphabet of events, D[ is a transition relation, and is the initial state. Transitions are denoted . An event is enabled at state if lI . We will denote the ....
A. Arnold. Finite Transition Systems. Prentice Hall, Englewood Cliffs, NJ, 1994.
A Region-Based Theory for State Assignment in.. - Cortadella.. (1997) (Correct)
....satisfied. Excitation closure: For each event . Event effectiveness: For each event Bisimulation between two TS s corresponds to the equivalence of state transition graphs, which is traditionally used in automata minimization, and is formally defined as follows. Definition 3. 1 (Bisimulation [1]) Let and be two TS s with the same set of events. A bisimulation between and is a binary relation between and such that ia) for every , there exists such that ; ib) for every , there exists such that ; iia) for every and for every such that , there exists such that ; iib) for every and for ....
A. Arnold, Finite Transition Systems. Englewood Cliffs, NJ: PrenticeHall, 1994.
Minimization and Minimal Realization in Span(Graph) - Rosebrugh, Sabadini (Correct)
....is essentially one which kills the 2 cells , that is the morphisms between machines, so that the bicategory of minimized machines is locally discrete. We begin in Section 2 with a study of a minimization for labelled graphs by generalizing the notion of bisimulation for transition systems [Arn92]. To make the minimization functorial we consider path lifting morphisms of labelled graphs and then consider points and reachability. The resulting minimization process is an idempotent monad. In Section 3 we make the minimization compositional by defining a bicategory of spans of graphs on ....
....minimization functor on a suitable category of labelled graphs viewed as a slight generalization of labelled transition systems. We find that minimization is adjoint to the inclusion of the minimized labelled graphs. Transition systems are often used in modelling parallel processes. Definition 1 [Arn92] Let A be an alphabet, i.e. a finite set. A transition system labelled by A is = S, T, #, #, #) where S and T are sets of states and transitions, # : T and # : T S define the source and target of transitions, and the labelling # : T 4 makes the mapping ##, #, ## : T S injective. ....
[Article contains additional citation context not shown here]
Andre Arnold. Finite Transition Systems, Prentice-Hall, 1992.
Software---Practice And Experience, Vol. 25(6), 579--596.. - Automatic Verification Of Self-citation (Arnold) (Correct)
No context found.
A. Arnold, Finite Transition Systems, Prentice-Hall, 1994.
The embedded software of an electricity meter: An.. - Arnold, Bégay, .. (1996) (2 citations) Self-citation (Arnold) (Correct)
....between the individual behaviours. Then the product of the Labelled Transition Systems with respect to the Synchronization System is built; it figures out the behaviour of the whole of the interacting system. Boolean properties can then be computed on the states and transitions of this graph[2]. The availability of a powerful model checker, the MEC tool[3] settled it. Temporal study The formal approach to temporal aspects of the system, more precisely the respect of every deadline, has been since the beginning considered out of reach of the automata approach, as time could be in no way ....
A. Arnold. Finite transition systems. Prentice-Hall, 1994.
ANNALS OF MATHEMATICS, COMPUTING TELEINFORMATICS, VOL 1.. - Temporal Logic Richard (Correct)
No context found.
A. Arnold. Finite transition systems. Prentice-Hall. PrenticeHall, 1994.
Conformance and Interoperability in Open Enviroments - Baldoni, Baroglio.. (Correct)
No context found.
A. Arnold, Finite Transition Systems. Pearson Education, 1994. 156
Dynamic aspects of retrenchments through - Temporal Logic Richard (Correct)
No context found.
A. Arnold. Finite transition systems. Prentice-Hall. Prentice-Hall, 1994.
Specif --- - Research Report September (Correct)
No context found.
A. Arnold. Finite Transition Systems. Prentice-Hall, .
SFEDL'04 Preliminary Version - Interacting Extended State (Correct)
No context found.
Arnold, A., "Finite Transition Systems," Prentice-Hall, 1994.
Model Checking Synchronized Products of Infinite Transition.. - Stefan Wohrle And (Correct)
No context found.
A. Arnold. Finite Transition Systems. Prentice Hall, 1994.
Interacting Extended State Diagrams - Salaün, Poizat (2004) (Correct)
No context found.
Arnold, A., "Finite Transition Systems," Prentice-Hall, 1994.
An Unfolding Algorithm for Synchronous - Products Of Transition (Correct)
No context found.
A. Arnold. Finite Transition Systems. Prentice-Hall, 1992.
Hierarchical Modeling and Verification of Timed Systems in .. - Pagetti, Cassez, Roux (2003) (Correct)
No context found.
Arnold A. Finite transition systems. Prentice-Hall. Prentice-Hall, 1994.
Algebra of Networks - Modeling simple networks, as well as.. - Stefanescu (Correct)
No context found.
Arnold, A. (1994). Finite transition systems. Prentice-Hall International.
Products of Modal Logics, Part 1 - Dov Gabbay Department (Correct)
No context found.
A. Arnold. Finite Transition Systems, Prentice Hall, 1994.
The Supervisory Control Problem for . . . - Marchand (Correct)
No context found.
A. Arnold. Finite transition systems. Prentice Hall, NJ, 1994.
Hierarchical Interface-based Supervisory Control -.. - Leduc, Brandin.. (2001) (4 citations) (Correct)
No context found.
A. Arnold, Finite Transition Systems. Prentice Hall, 1994.
Coalg_{KPF}: Towards a Coalgebraic Calculus for.. - Meng, Aichernig (Correct)
No context found.
A. Arnold. Finite Transition Systems. Prentice Hall, 1994.
Verification of Timed Circuits with Symbolic Delays - Robert Clariso Jordi (2003) (Correct)
No context found.
A. Arnold. Finite transition systems. Prentice Hall, 1994.
Combining Simulation and Guided Traversal for the - Verification Of Concurrent (2003) (Correct)
No context found.
A. Arnold. Finite Transition Systems. Prentice-Hall, 1994.
Products of Modal Logics, Part 1 - Dov Gabbay Department (Correct)
No context found.
A. Arnold. Finite Transition Systems, Prentice Hall, 1994.
First 50 documents Next 50
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC