Press "Enter" to skip to content

Download Compositional Verification of Concurrent and Real-Time by Eric Y. T. Juan, Jeffrey J. P. Tsai (auth.) PDF

By Eric Y. T. Juan, Jeffrey J. P. Tsai (auth.)

With the speedy progress of networking and high-computing energy, the call for for large-scale and complicated software program platforms has elevated dramatically. the various software program platforms aid or supplant human regulate of safety-critical structures resembling flight regulate structures, area travel keep watch over platforms, plane avionics keep an eye on platforms, robotics, sufferer tracking structures, nuclear energy plant keep an eye on structures, and so forth. Failure of safety-critical structures may well bring about nice failures and lack of human existence. consequently, software program used for security­ severe structures may still safeguard excessive insurance houses. for you to agree to excessive coverage houses, a safety-critical method frequently stocks assets among a number of at the same time lively computing brokers and needs to meet inflexible real-time constraints. in spite of the fact that, concurrency and timing constraints make the advance of a safety-critical method even more blunders services and onerous. The correctness of software program structures these days relies generally at the paintings of checking out and debugging. trying out and debugging contain the method of de­ tecting, finding, reading, separating, and correcting suspected faults utilizing the runtime details of a approach. besides the fact that, checking out and debugging should not enough to turn out the correctness of a safety-critical procedure. by contrast, static research is supported through formalisms to specify the process accurately. Formal verification tools are then utilized to end up the logical correctness of the approach with recognize to the specification. Formal verifica­ tion offers us higher self assurance that safety-critical structures meet the specified coverage homes so that it will steer clear of disastrous consequences.

Show description

Read or Download Compositional Verification of Concurrent and Real-Time Systems PDF

Best international books

Recent Advances in Computational Sciences: Selected Papers from the International Workshop on Computational Sciences and Its Education; Beijing, China 29-31 August 2005

This ebook offers cutting-edge lectures brought through overseas educational and commercial specialists within the box of computational technology and its schooling, masking a large spectrum from conception to perform. themes comprise new advancements in finite point strategy (FEM), finite quantity approach and Spline conception, similar to relocating Mesh tools, Galerkin and Discontinuous Galerkin Schemes, form Gradient, combined FEMs, Superconvergences and Fourier spectral approximations with functions in multidimensional fluid dynamics; Maxwell equations in discrepancy media; and phase-field equations.

Intelligent Agents V: Agents Theories, Architectures, and Languages: 5th International Workshop, ATAL’98 Paris, France, July 4–7, 1998 Proceedings

The forefront of machine technological know-how examine is notoriously ? ckle. New developments come and decide on alarming and unfailing regularity. In this sort of speedily altering ? eld, the truth that learn curiosity in an issue lasts greater than a yr is beneficial of word. the truth that, after ? ve years, curiosity not just continues to be, yet really keeps to develop is very strange.

13th Congress of the International Society for Forensic Haemogenetics (Internationale Gesellschaft fur forensische Hamogenetik e.V.) New Orleans, October 19–21, 1989

The 3rd quantity of "Advances in Forensic Haemogenetics" comprises the th clinical contributions provided on the thirteen Congress of the overseas Society for Forensic Haemogenetics, hung on October 19-21, 1989 in New Orleans, united states. The convention was once prepared and chaired by way of Dr. Herbert Polesky from Minneapolis.

Extra resources for Compositional Verification of Concurrent and Real-Time Systems

Example text

Let P and Q be finite MLTSs with a common set of actions 2:. " • An lOT-loop is the IO-trace of a loop which is reachable from the initial state. ) be two lOT-loops. ) + (b? ). Two MLTSs P and Q are livelock equivalent iff for 45 Compositional Verification Using MLTS each lOT-loop a p of P, there exists an lOT-loop a q of Q such that a p and a q are equivalent, and vice versa. 14 (IOT-Failures-Divergences Equivalence (IOTFD Equivalence» Let P and S be finite MLTSs with a common set of actions L: .

27 Multiset Labeled Transition Systems b=O a#c! •• •• 1 b? 2 II a# b! c! b? (G1 G2) ....... •• •• b=fJ ' (0,0,0) (1,1,1) (0,2,1) G2 ..... a#b! 1 c=o G3 ° on.. c?. 1 ° c! - '... 12. Parallel operation of MLTSs. 12 as a simple example. Actions a# and el are considered as an atomic instruction in transition (so, (a# el), SI) ofMLTS Gl. Similarly, transition (so, (a# hI), SI) of MLTS G2 executes actions a# and h!. 12. For a state-label (i, j, k) in MLTSs Ilb=O(Glo G2) and hide(llb=O(G1, G2», labels i,j, and k represent the current states of h, Glo and G2, respectively.

V6 IAlgorithm 2 ! t Ablk(vdl) = {(cp)} c? 11. Example of Algorithm 2 (Determinisation ofIOTGs). 11 as an example. There is a T-step from state Vo to state V2 via state VI. Thus, which is the set of states reached from state Vo via T-steps. ), V3, (bl), V4, T, vs). ), V6) is a blocking transition. ), V7, T, Vs). Thus, V-step(VI) = {V7' V5, Vs}. 50 COMPOSITIONAL VERIFICATION OF CONCURRENT AND RTS • Now we show Algorithm 2 to transform a finite IOTG G into a determinized IOTG D. By executing r-steps and V-steps, Algorithm 2 explores all reachable paths and terminates properly if G is finite and has neither r-Ioop nor AS-loop.

Download PDF sample

Rated 4.71 of 5 – based on 5 votes