R. Alur, T.A. Henzinger, and E.D. Sontag, editors. Hybrid Systems III. Lecture Notes in Computer Science 1066. Springer-Verlag, 1996.  Home/Search   Document Not in Database   Summary   Related Articles   Check

....therefore see that this computer supervised system is a hybrid system since it mixes continuous valued (the control loop s state) and discrete event (the program state) variables. Over the past five years there has been considerable interest in supervisory hybrid systems [63] 64] 65] 66] 67] [68] [69] One of the primary motivations for this interest rests with the fact that rapid advances in computer and networking technology have greatly accelerated the deployment of large scale supervisory systems. Examples of such large scale systems include the air traffic control grid, communication ....

....science and traditional system science. Due to the introductory nature of this paper, it was impossible to itemize all of the important work being performed. Much of the work outlined here will be found in a series of workshop proceedings published by Springer Verlag, 63] 64] 65] 66] 67] [68] [69] as well as numerous other workshops not mentioned here and various special issues of technical journals (Theoretical Computer Science, IEEE Transactions on Automatic Control, Discrete Event Dynamic Systems, International Journal of Control, System and Control Letters, Automatica) The field ....

T.A. Henzinger and S. Sastry (editors), Hybrid systems: control and computation , Lecture Notes in Computer Science 1386, Springer-Verlag, 1998.

....the initial state to a nal accepting state of the automaton. For a timed automaton M with c the largest constant appearing in the guards and invariants of M , and t the number of clocks, an upper bound for k is given by k 2 where 2 denotes the number of states in the region graph of M [Alu99] 17 Corollary 1 Let M be a timed automaton with c the largest constant appearing in the guards and invariants of M , and t the number of clocks. Further, let be a formula in LTL(C) If k = 2 then M j= i [ M; is unsatis able. 18 BMC for Networks of Timed Automata Complex ....

....ning synchronization on same events, we assume two nite alphabets 1 and 2 , whose elements are used to label the transitions of A 1 , respectively A 2 . An edge of an automaton over an input alphabet is now a tuple e = hl; a; g; r; l i. The product A 1 kA 2 is de ned in the obvious way [Alu99] The locations of the product automaton are pairs of locations of its constituent automata. The invariant of a new location consists of the conjunction of the invariants of the component locations. Symbols that belong to both alphabets are used for synchronization and must be taken ....

[Article contains additional citation context not shown here]

R. Alur. Timed automata. Lecture Notes in Computer Science, 1633:8-22, 1999.

....made Timed Systems ( 11] one of the mostly studied subclass. System states and transitions are annotated with conditions on time and reset of finitely many clocks. Various problems have been investigated (e.g. expressiveness of the model) both with discrete and dense time assumption (see also [48]) To describe more general situations and to model concurrent systems, various extensions have been proposed (see [13] 21] 28] 33] 62] 63] and [64] Parameters are useful to describe an abstract system in which some values are not available at the moment. Parameters are also important ....

Henzinger, T. A., Kopke, P.W., Wong-Toi, H.: The Expressive Power of Clocks. Automata, languages, and Programming. Lecture Notes in Computer Science 944, Springer, Berlin, 1995, 335--346.

....dynamics usually model high level decision making or synchronization among agents, while the continuous dynamics model low level control actions. The analysis, design and control of hybrid systems is a very important problem. Examples of techniques that have been proposed in the literature are [3 7, 9]. Computer aided veri#cation is a formal approach for the analysis of hybrid systems. In the veri#cation community, hybrid systems are modeled as hybrid automata where di#erential equations or inclusions exist in each discrete state of a #nite state machine. Tran # Corresponding author. E mail: ....

R. Alur, T.A. Henzinger, E.D. Sontag (Eds.), Hybrid Systems III, Lecture Notes in Computer Science, vol. 1066, Springer, Berlin, 1996.

....used for verifying many complex reactive systems. Traditional techniques for model checking, however, are not suitable for the veri cation of real time (reactive) systems since they do not support an explicit modeling of time. Formalisms such as timed automata [AD94] and timed transition systems [HMP92] have been introduced to model the behavior of real time systems. A timed automaton is a nite state automaton augmented with a nite set of real valued clocks, which can be set to zero simultaneously with a transition. The clocks proceed at the same rate and measure the amount of time that has ....

T. A. Henzinger, Z. Manna, and A. Pnueli. Timed transition systems. Lecture Notes in Computer Science, 600:226-251, 1992. 42

....property that holds for the abstraction holds also for the original automaton. Modelling and Verification using Linear Hybrid Automata 7 3.3 Tool support for model checking Several hybrid model checkers have been developed, amongst whom HyTech, KRONOS and UPPAAL are the most prominent ones. See [3] for a survey. We selected HyTech [6] as it provides the most general input language by supporting the full scope of linear hybrid automata. This seems to be an obvious choice as we want to apply as few approximations as possible. UPPAAL, for example, is restricted to timed automata which ....

Alur, R., Henzinger, T.A., Sontag, E.D.: Hybrid Systems III. Lecture Notes in Computer Science 1066. Springer Verlag, 1996.

....shown in Figure 6. The annotations of time labels is done in the Time column. Relative to the execution of the previous statement, the time labels define a time interval within which the TTCN statements must be executed. A formal semantics of RT TTCN has been defined using timed transition systems [6]. In [23] it has been shown that real time TTCN can be applied to multimedia systems for testing quality of service guarantees. 9 4.2.2. Performance testing Performance testing aims at measuring the level of (performance) quality of an implementation under well known conditions. The level of ....

T. Henzinger, Z. Manna, A. Pnueli. Timed Transition Systems. Real-Time: Theory in Practice. Lecture Notes in Computer Science 600, 1991.

....tree is a proof goal that results from the application of a proof step to its parent node. Each proof goal is a sequent consisting of two sequences of formulas called the antecedents and the consequents, displayed by PVS as shown in 1 . 1 f 1g A1 f 2g A2 [ 3] A3 . [1] C1 [2] C2 [3] C3 . 122 The Ai are the antecedent formulas and the Ci are the consequent formulas; and the intuitive interpretation of the sequent is that the conjunction of the antecedents formulas implies the disjunction of the consequent formulas. When the prover is invoked on a ....

.... [ 3] rb abs rs(I step(q 1,s 1,i 1) measure fn rbi(q 1,rbi ms 1) rb abs rs(q 1) measure fn rbi(q 1,rbi ms 1) 4] measure fn rbi(q 1,rbi ms 1) rbi 1 [ 5] valid rb entry (q 1,rbi 1) 6] Instr issued abs (q 1,rbi 1) 7] rb induction hypothesis(q 1,s 1,i 1,rbi ms 1) [1] rbi measure adjust(q 1,s 1,rbi ms 1) 0 [2] restart proc (q 1,s 1) 3] EXISTS (abs eui: ABS euindex) sch abs di (s 1) abs eui) AND sch abs di(s 1) abs eui) rb abs rs(q 1) rbi 1) f4g rf(Complete instr(PROJ 1(Complete Squash rest till(Complete committed in sb till ....

[Article contains additional citation context not shown here]

Alur, R., and Henzinger, T. A., Eds. Computer-Aided Verication, CAV '96 (New Brunswick, NJ, July/Aug. 1996), vol. 1102 of Lecture Notes in Computer Science, Springer-Verlag.

No context found.

R. Alur, T.A. Henzinger, and E.D. Sontag, editors. Hybrid Systems III. Lecture Notes in Computer Science 1066. Springer-Verlag, 1996.

No context found.

, Alur, R., Henzinger, T.A., Sontag, E.D.: Hybrid Systems III. Lecture Notes in Computer Science 1066. Springer Verlag, 1996.

No context found.

T.A. Henzinger and S. Sastry, eds., Hybrid Systems: Computation and Control, vol. 1386 of Lecture Notes in Computer Science, Berlin, Germany: Springer-Verlag, 1998.

....con dence, that a system adheres to its requirements, models describing in great detail the essence of the system are made. These models often are subject to analysis, validation and veri cation. Formalisms that allow for modelling hybrid systems have been proposed in the past (e.g. 9] 2] [1]) some of which have become quite popular. On the one hand, theory in these formalisms is investigated and on the other hand, the theory is applied on case studies. In this paper, a process algebraic approach is investigated. Process algebras come in several variants (e.g. CSP [10] CCS [11] ....

R. Alur, T.A. Henzinger, and E.D. Sontag, editors. Hybrid Systems III, Lecture Notes in Computer Science 1066. Springer-Verlag, 1996.

....the existence of bisimulations for certain classes of planar hybrid systems. 1 Introduction Hybrid systems consist of finite state machines interacting with di#erential equations. Various modeling formalisms, analysis, design and control methodologies, as well as applications, can be found in [3,4,5,10,17]. Formal verification is the main computational approach for analyzing properties of hybrid systems. One of the most important verification problems for hybrid systems is the reachability problem which asks whether trajectories of the hybrid system can reach certain undesirable regions of the ....

R. Alur, T.A. Henzinger, and E.D. Sontag (eds.), Hybrid systems III, Lecture Notes in Computer Science, vol. 1066, Springer-Verlag, 1996.

....dynamics usually model high level decision making or synchronization among agents, while the continuous dynamics model low level control actions. The analysis, design and control of hybrid systems is a very important problem. Examples of techniques that have been proposed in the literature are [3 7, 9]. Computer aided veri#cation is a formal approach for the analysis of hybrid systems. In the veri#cation community, hybrid systems are modeled as hybrid automata where di#erential equations or inclusions exist in each discrete state of a #nite state machine. Tran # Corresponding author. E mail: ....

T. Henzinger, S. Sastry (Eds.), Hybrid Systems: Computation and Control, Lecture Notes in Computer Science, vol. 1386, Springer, Berlin, 1998.

....with Portland State University, Portland, OR 97207 USA (e mail: gerardo mth.pdx.edu) Publisher Item Identifier S 0018 9219(00)06460 4. 53] Their wide applicability has inspired a great deal of research from both control theory and theoretical computer science [1] 2] 7] 9] 10] 29] [31], 52] 75] Many of the above motivating applications are safety critical and require guarantees of safe operation. Consequently, much research focuses on formal analysis and design of hybrid systems. Formal analysis of hybrid systems is concerned with verifying whether a hybrid system ....

T. Henzinger and S. Sastry, Eds., Hybrid Systems: Computation and Control. New York: Springer-Verlag, 1998, vol. 1386, Lecture Notes in Computer Science.

....G. Lafferriere is with Portland State University, Portland, OR 97207 USA (e mail: gerardo mth.pdx.edu) Publisher Item Identifier S 0018 9219(00)06460 4. 53] Their wide applicability has inspired a great deal of research from both control theory and theoretical computer science [1] 2] [7], 9] 10] 29] 31] 52] 75] Many of the above motivating applications are safety critical and require guarantees of safe operation. Consequently, much research focuses on formal analysis and design of hybrid systems. Formal analysis of hybrid systems is concerned with verifying whether ....

R. Alur, T. A. Henzinger, and E. D. Sontag, Eds., Hybrid Systems III. New York: Springer-Verlag, 1996, vol. 1066, Lecture Notes in Computer Science.

....data part, as well as the possible depth of the corresponding finite state machine. All these aspects require a good knowledge of the circuit. On the other hand, classical efficiency guidelines concerning model checking include design decomposition according to assumeguarantee techniques [3], data path abstraction, case splitting, and data type reduction [5] These techniques successfully apply to most common RT level designs but they require a good knowledge of the existing temporal logics, and also of the symbolic model checking mechanism. In this paper we show the practical ....

....it replaces. This is synonymous with refinement checking[5] Replacing a part of the design (in this example, the definitions of the two incoming requests) by a simpler, non deterministic, abstract definition, together with performing the subsequent checks is known as assume guarantee reasoning [3]. 3.2.4 Behavioral partitioning The different functional blocks that are running in parallel may execute independently, or they can influence the execution of each other. Hence, different execution scenarios are possible. Any property a design should satisfy must be valid for all scenarios that ....

. T. A. Henzinger, S. Qadeer, and S. K. Rajamani, You assume, we guarantee: methodology and case studies Proceedings of the Tenth International Conference on Computer-aided Verification (CAV 1998), Lecture Notes in Computer Science 1427, pp. 440-451

No context found.

R. Alur, T. A. Henzinger, and E. D. Sontag, Eds., Hybrid Systems III, Lecture Notes in Computer Science 1066. New York: Springer-Verlag, 1996.

....process for large scale systems consists of imposing an overall system architecture as well as designing communication and control algorithms for achieving a desired overall system performance. The merging of discrete communication protocols and continuous control laws results in hybrid systems ([3, 4, 5]) The analysis process for complex, hybrid systems consists of proving or verifying that the designed system indeed meets certain specifications. However, both the design and the analysis may be formidable due to the complexity and magnitude of the system. In the design process, complexity is ....

R. Alur, T.A. Henzinger, and E.D. Sontag, editors. Hybrid Systems III. Lecture Notes in Computer Science 1066. Springer-Verlag, 1996.

....dynamics usually model high level decision making or synchronization among agents, while the continuous dynamics model low level control actions. The analysis, design and control of hybrid systems is a very important problem. Examples of techniques that have been proposed in the literature are [6, 4, 3, 5, 9, 7]. Computer aided verification is a formal approach for the analysis of hybrid systems. In the verification community, hybrid systems are modeled as hybrid automata where differential equations or inclusions exist in each discrete state of a finite state machine. Transition from one discrete state ....

T. Henzinger and S. Sastry, editors. Hybrid Systems : Computation and Control. Lecture Notes in Computer Science. Springer-Verlag, 1998. To appear.

....that solves the problem unless P = NP [23] which is generally assumed not to be the case. 2 A problem is undecidable if there cannot exist generally applicable algorithms that solve the problem. 3 good approximation, and for using such models to prove properties of general hybrid systems [4, 15, 16, 25, 45]. This approach will not be described further in this paper. It is also possible to approach hybrid systems by extending the state of a continuous system, represented by an ordinary di erential equation, with some variables belonging to a nite set. These logical variables may represent discrete ....

R. Alur, S. Kanna, and S. La Torre, \Polyhedral ow in hybrid automata," in Hybrid systems: Computation and Control (F.W. Vaandrager and J.H. van Schuppen, eds.), vol. 1569 of Lecture Notes in Computer Science, pp. 5-18, Berlin, Germany: Springer, 1999.

....known to lie to reasonable uncertain sets. Conflict resolution maneuvers are therefore modeled by a finite state automaton interacting with control systems, the so called hybrid 3 control systems. There are several approaches to hybrid system design and verification (see, for example, [12, 13, 14, 15]) One approach is to extend verification techniques which exist for finite state machines [16] to include timed and dynamical systems [17, 18] These approaches abstract the differential equations by clocks [19] or differential inclusions [20, 21, 22] and verify the resulting abstracted system. ....

R. Alur, T.A. Henzinger, and E.D. Sontag, editors. Hybrid Systems III. Lecture Notes in Computer Science 1066. Springer-Verlag, 1996.

No context found.

R. Alur, T.A. Henzinger, and E.D. Sontag. Hybrid Systems III. Lecture Notes in Computer Science1,ien Springer-Verlag,1,lag

No context found.

Rajeev Alur and Thomas A. Henzinger, Eds., Computer-Aided Verification, CAV '96, vol. 1102 of Lecture Notes in Computer Science, New Brunswick, NJ, July/Aug. 1996. Springer-Verlag.

No context found.

T. Henzinger, eds., vol. 1102 of Lecture Notes in Computer Science, New Brunswick, NJ, USA, July 1996, Springer-Verlag, pp. 390#393.

First 50 documents

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