On decidability of LTL model checking for process rewrite systems

Size: px
Start display at page:

Download "On decidability of LTL model checking for process rewrite systems"

Transcription

1 Act Informtic (2009) 46:1 28 DOI /s ORIGINAL ARTICLE On decidbility of LTL model checking for process rewrite systems Lur Bozzelli Mojmír Křetínský Vojtěch Řehák Jn Strejček Received: 26 August 2007 / Revised: 23 June 2008 / Accepted: 14 October 2008 / Published online: 11 November 2008 Springer-Verlg 2008 Abstrct We estblish decidbility boundry of the model checking problem for infinitestte systems defined by Process Rewrite Systems (PRS) or wekly extended Process Rewrite Systems (wprs), nd properties described by bsic frgments of ction-bsed LinerTemporl Logic (LTL) with both future nd pst opertors. It is known tht the problem for generl LTL properties is decidble for Petri nets nd for pushdown processes, while it is undecidble for PA processes. We show tht the problem is decidble for wprs if we consider properties defined by LTL formule with only modlities strict eventully, strict lwys, nd their pst counterprts. Moreover, we show tht the problem remins undecidble for PA processes even with respect to the LTL frgment with the only modlity until or the frgment with modlities next nd infinitely often. 1 Introduction Automtic verifiction of current softwre systems often needs to model them s infinitestte systems. One of the most powerful formlisms for finite description of infinite-stte systems (except formlisms which re lnguge equivlent to Turing mchines) is clled Some of the results presented in this pper hve been lredy published in [4,12]. L. Bozzelli Diprtimento di Mtemtic e Aplliczioni, Università degli Studi di Npoli Federico II, Vi Cinti, Nples, Itly e-mil: lur.bozzelli@dm.unin.it M. Křetínský V. Řehák J. Strejček (B) Fculty of Informtics, Msryk University, Botnická 68, Brno, Czech Republic e-mil: strejcek@fi.muni.cz M. Křetínský e-mil: kretinsky@fi.muni.cz V. Řehák e-mil: rehk@fi.muni.cz

2 2 L. Bozzelli et l. Process Rewrite Systems (PRS) [17]. The PRS frmework, bsed on term rewriting, subsumes mny formlisms studied in the context of forml verifiction, e.g., Petri nets (PN), pushdown processes (PDA), nd process lgebrs like BPA, BPP, or PA. PRS cn be dopted s forml model for progrms with recursive procedures nd restricted forms of dynmic cretion nd synchroniztion of concurrent processes. A substntil merit of PRS is tht some importnt verifiction problems re decidble for the whole PRS clss. In prticulr, Myr [17] proved tht the following problems re decidble for PRS: the rechbility problem whether given stte is rechble, the rechble property problem whether there is rechble stte where some given ctions re enbled nd some given ctions re disbled. In [10], we hve presented wekly extended PRS (wprs), where finite-stte control unit with self-loops s the only loops is dded to the stndrd PRS formlism (ddition of generl finite-stte control unit mkes PRS lnguge equivlent to Turing mchines). This wek control unit enriches PRS by bilities to model bounded number of rbitrry communiction events nd globl vribles whose vlues re chnged only bounded number of times during ny computtion. We hve proved tht the rechbility problem remins decidble for wprs [9] nd tht the problem clled rechbility Hennessy Milner property (whether there is rechble stte stisfying given Hennessy Milner formul) is decidble for wprs s well [11]. Note tht the ltter problem is strictly more generl thn the rechble property problem. The hierrchy of ll PRS nd wprs clsses is depicted in Fig. 1. Concerning the model checking problem, brod overview of (un)decidbility results for subclsses of PRS nd vrious temporl logics cn be found in [16]. Here we focus exclusively on Liner Temporl Logic (LTL). It is known tht LTL model checking of PDA is EXPTIME-complete [1]. LTL model checking of PN is lso decidble, but t lest s hrd s the rechbility problem for PN [5] (the rechbility problem is EXPSPACE-hrd [13,15] nd no primitive recursive upper bound is known). If we consider only infinite runs, then the problem for PN is EXPSPACE-complete [8,16]. Conversely, LTL model checking is undecidble for ll the clsses subsuming PA [2,16]. So fr, there re only two positive results for these clsses. Boujjni nd Hbermehl [2] hve identified frgment clled simple PLTL for which model checking of infinite runs is decidble for PA (strictly speking, simple PLTL is not frgment of LTL s it cn express lso some non-regulr properties, while LTL cnnot). Only recently, Bozzelli [3]hs demonstrted tht model checking of infinite runs is decidble for PRS nd the frgment of LTL cpturing exctly firness properties. Our contribution. This pper contins severl results on decidbility of LTL model checking. In prticulr, we completely locte the decidbility boundry of the model checking problem for ll subclsses of PRS (nd wprs) nd ll bsic LTL frgments, wherebsic LTL frgment is set of ll LTL formule contining only given subset of stndrd temporl modlities nd closed under boolen connectives. The boundry is depicted in Fig. 2.To locte the boundry, we demonstrte the following results. 1. We introduce new LTL frgment A. Then we prove tht the problem whether given wprs hs (finite or infinite) run stisfying given formul of A is decidble. The proof employs our results presented in [3,9,11] to reduce the problem to LTLmodelchecking for PDA nd PN. This result directly implies decidbility of the model checking problem for wprs nd negted formule of A. 2. We show tht every formul of the bsic frgment LTL(F s, G s ) (i.e., the frgment with modlities strict eventully nd strict lwys only) cn be effectively trnslted into A. As LTL(F s, G s ) is closed under negtion, we cn lso trnslte LTL(F s, G s ) formule

3 On decidbility of LTL model checking for PRS 3 into negtions of A formule. This trnsltion yields decidbility of the model checking problem for wprs nd LTL(F s, G s ). Note tht LTL(F s, G s ) is strictly more expressive thn the Lmport logic (i.e., the bsic frgment with modlities eventully nd lwys), which is gin strictly more expressive thn the mentioned frgment of firness properties ndlsothntheregulr prt of simple PLTL. 3. We define pst extension PA of the frgment A. Using the result for A, weshow tht the model checking problem for wprs nd negted formule of PA remins decidble. Further, we prove tht every formul of the bsic frgment LTL(F s, G s, P s, H s ) (LTL(F s, G s ) extended with the pst counterprts of F s nd G s ) cn be effectively trnslted into PA. Hence, we get decidbility of the model checking problem for wprs nd LTL(F s, G s, P s, H s ).WenotethtLTL(F s, G s, P s, H s ) is strictly more expressive thn LTL(F s, G s ) (for exmple, the formul F s (b H s ) is not equivlent to ny LTL(F s, G s ) formul) nd semnticlly equivlent to First-Order Mondic Logic of Order restricted to 2 vribles nd without successor predicte (FO 2 [<],see[6] for effective trnsltions). Thus we lso positively solve the model checking problem for wprs nd FO 2 [<]. 4. We demonstrte tht the model checking problem remins undecidble for PA even if we consider the bsic frgment with modlity until or the bsic frgment with modlities next nd infinitely often (which is strictly less expressive thn the one with next nd eventully). The pper lso presents two results tht re not connected to the decidbility boundry. 5. We introduce more generl pointed model checking problem (whether ll runs of given wprs system going through given stte stisfy given formul in the given stte). We show tht this problem is decidble for wprs nd LTL(F s, G s, P s, H s ). 6. Finlly, we show tht negted formule of LTL det (the frgment known s the common frgment of CTL nd LTL [14]) cn be effectively trnslted into A. As consequence we get tht the model checking problem is decidble for wprs nd LTL det. Structure of the pper. The following section reclls bsic definitions. Sections 3 6 correspond, respectively, to the first four items listed bove. Section 5 lso covers the results on the pointed model checking problem. Section 7 dels with the model checking problem for LTL det. The lst section summrizes our results nd tries to give n intuitive explntion of the found decidbility border loction. 2 Preliminries 2.1 PRS nd wekly extended PRS Let Const ={X,...} be set of process constnts. Thesetofprocess terms t is defined by the bstrct syntx t ::= ε X t.t t t, whereε is the empty term, X Const, nd. nd men sequentil nd prllel compositions, respectively. We lwys work with equivlence clsses of terms modulo commuttivity nd ssocitivity of, ssocitivity of., nd neutrlity of ε, i.e., ε.t = t.ε = t ε = t. We distinguish four clsses of process terms s: 1 terms consisting of single process constnt, in prticulr, ε 1, S sequentil terms terms without prllel composition, e.g., X.Y.Z, P prllel terms terms without sequentil composition, e.g., X Y Z, G generl terms terms without ny restrictions, e.g., (X.(Y Z)) W.

4 4 L. Bozzelli et l. Let M ={o, p, q,...} be set of control sttes, be prtil ordering on this set, nd Act ={, b, c,...} besetofctions. Letα, β {1, S, P, G} be clsses of process terms such tht α β. An(α, β)-wprs (wekly extended process rewrite system) is triple (R, p 0, t 0 ),where R is finite set of rewrite rules of the form (p, t 1 ) (q, t 2 ),wheret 1 α, t 1 = ε, t 2 β, Act, ndp, q M stisfy p q, the pir (p 0, t 0 ) M β forms the distinguished initil stte. By Act( ), Const( ), ndm( ) we denote the respective sets of ctions, process constnts, nd control sttes occurring in the rewrite rules or the initil stte of. AwPRS = (R, p 0, t 0 ) induces lbelled trnsition system, whose sttes re pirs (p, t) such tht p M( ) nd t is process term over Const( ). The trnsition reltion is the lest reltion stisfying the following inference rules: ((p, t 1 ) (q, t 2 )) R (p, t 1 ) (q, t 2 ) (p, t 1 ) (q, t 2 ) (p, t 1 ) (q, t 2 ) (p, t 1 t 1 ) (q, t 2 t 1 ) (p, t 1.t 1 ) (q, t 2.t 1 ) Sometimes we write insted of if is cler from the context. The trnsition reltion cn be extended to finite words over Act in stndrd wy. To shorten our nottion we write pt in lieu of (p, t).asttept is rechble from stte p t if there exists word u such tht p t u pt. We sy tht stte is rechble if it is rechble from the initil stte p 0 t 0. Further, stte pt is clled terminl if there is no stte p t nd no ction such tht pt p t. In this pper we lwys consider only systems where the initil stte is not terminl. A (finite or infinite) sequence ( 1 2 n n+1 ) σ = p 1 t 1 p 2 t 2... p n+1 t n+1... is clled derivtion over the word u = n ( n+1...)in. Finite derivtions re lso u u denoted s p 1 t 1 p n+1 t n+1, infinite ones s p 1 t 1. A derivtion in is clled run of if it strts in the initil stte p 0 t 0 nd it is either infinite, or its lst stte is terminl. Further, L( ) denotes the set of words u such tht there is run of over u. An (α, β)-wprs where M( ) is singleton is clled (α, β)-prs (process rewrite system)[17]. In such systems we omit the single control stte from rules nd sttes. Some clsses of (α, β)-prs correspond to widely known models, nmely finite-stte systems (FS), bsic process lgebrs (BPA), bsic prllel processes (BPP), process lgebrs (PA), pushdown processes (PDA), nd Petri nets (PN). The other clsses hve been nmed s PAD, PAN, nd PRS [17]. The reltions between (α, β)-prs nd the mentioned formlisms nd nmes re indicted in Fig. 1. Insted of (α, β)-wprs we juxtpose the prefix w- with the cronym corresponding to the (α, β)-prs clss. For exmple, we use wbpa rther thn (1, S)-wPRS. Figure 1 shows the expressiveness hierrchy of ll the clsses mentioned bove, where expressive power of clss is mesured by the set of trnsition systems tht re definble (up to the strong bisimultion equivlence [18]) by the clss. This hierrchy is strict, with possible exception concerning the clsses wprs nd PRS, where the strictness is just our conjecture. For detils see [10]. For technicl resons, we define norml form of wprs systems. A rewrite rule is prllel or sequentil if it hs one of the following forms: Prllel rules: px 1 X 2 X n qy 1 Y 2 Y m Sequentil rules: px qy.z px.y qz px qy px qε

5 On decidbility of LTL model checking for PRS 5 Fig. 1 The hierrchy of PRS nd wprs subclsses where X, Y, X i, Y j, Z Const, p, q M, n > 0, m 0, nd Act. A rule is clled trivil if it is both prllel nd sequentil, i.e., it hs the form px qy or px qε. AwPRS = (R, p 0, t 0 ) is in norml form if t 0 is process constnt nd R contins only prllel nd sequentil rewrite rules. PRS, wprs, other extensions of PRS, nd their respective subclsses re discussed in more detil in [21]. 2.2 Liner temporl logic The syntx of Liner temporl logic (LTL) [20] is defined s follows ϕ ::= tt ϕ ϕ ϕ Xϕ ϕ U ϕ Yϕ ϕ S ϕ, where X nd U re the future modl opertors next nd until, while Y nd S re their pst counterprts previously nd since, nd rnges overact. The logic is interpreted over infinite nd nonempty finite pointed words of ctions. Given word u = Act Act ω, u denotes the length of the word (we set u = if u is infinite). A pointed word is pir (u, i) of nonempty word u nd position 0 i < u in this word. The semntics of LTL formule is defined inductively s follows: (u, i) tt (u, i) iff u = nd i = (u, i) ϕ iff (u, i) ϕ (u, i) ϕ 1 ϕ 2 iff (u, i) ϕ 1 nd (u, i) ϕ 2 (u, i) Xϕ iff i + 1 < u nd (u, i + 1) ϕ (u, i) ϕ 1 U ϕ 2 iff k. (i k < u (u, k) ϕ 2 j.(i j < k (u, j) ϕ 1 ))

6 6 L. Bozzelli et l. (u, i) Yϕ iff 0 < i nd (u, i 1) ϕ (u, i) ϕ 1 S ϕ 2 iff k. (0 k i (u, k) ϕ 2 j.(k < j i (u, j) ϕ 1 )) We sy tht (u, i) stisfies ϕ whenever (u, i) ϕ. Further, nonempty word u stisfies ϕ, written u ϕ, whenever (u, 0) ϕ. Given set L of words, we write L ϕ if u ϕ holds for ll u L. Finlly, we sy tht run σ of wprs over word u stisfies ϕ, written σ ϕ, whenever u ϕ. Formule ϕ,ψ re (initilly) equivlent, written ϕ i ψ, iff, for ll words u, it holds tht u ϕ u ψ. Formule ϕ,ψ re globlly equivlent, written ϕ ψ, iff,forll pointed words (u, i), it holds tht (u, i) ϕ (u, i) ψ. Clerly, if two formule re globlly equivlent then they re lso initilly equivlent. Moreover, two formule without pst modlities re globlly equivlent if nd only if they re initilly equivlent. Therefore we do not distinguish between initil nd globl equivlence when we tlk bout formule without pst. The following tble defines some derived future opertors nd their pst counterprts. Future modlity Mening Pst modlity Mening Fϕ Eventully tt U ϕ Pϕ Eventully in the pst tt S ϕ Gϕ Alwys F ϕ Hϕ Alwys in the pst P ϕ F s ϕ Strict eventully XFϕ P s ϕ Eventully in the strict pst YPϕ G s ϕ Strict lwys F s ϕ H s ϕ Alwys in the strict pst P s ϕ F ϕ Infinitely often GFϕ Iϕ Initilly HPϕ Given set {O 1,...,O n } of modlities, LTL(O 1,...,O n ) denotes the LTL frgment (closed under boolen connectives) contining ll formule with modlities O 1,...,O n only. Such frgment is clled bsic if either it contins future opertors only, or for ech included future opertor, it contins its pst counterprt nd vice vers. For exmple, the frgment LTL(F, S) is not bsic. Figure 2 shows n expressiveness hierrchy of ll studied bsic LTL frgments. Indeed, every bsic LTL frgment using stndrd 1 modlities is equivlent to one of the frgments in the hierrchy, where equivlence between frgments mens tht every formul of one frgment cn be effectively trnslted into n initilly equivlent formul of the other frgment nd vice vers. In prticulr, LTL(F s, G s, P s, H s ) is equivlent to LTL(F s, P s ). 2 We lso mind the result of [7] stting tht ech LTL formul cn be converted into one which employs future opertors only, i.e., LTL(U, X) i LTL(U, S, X, Y). The hierrchy is lso strict: solid line between two frgments indictes tht every formul of the lower frgment is initilly equivlent to some formul of the upper frgment, but the opposite reltion does not hold. We refer to [22] for detils bout the expressiveness of LTL frgments. 1 By stndrd modlities we men the ones defined here nd lso other commonly used modlities like strict until, relese, wek until, etc. However, it is well possible tht one cn define new modlity such tht there is bsic frgment not equivlent to ny of the frgments in the hierrchy. 2 As F s, G s nd P s, H s re pirs of dul opertors, the frgments LTL(F s, G s, P s, H s ) nd LTL(F s, P s ) re in fct equivlent even with respect to the globl equivlence.

7 On decidbility of LTL model checking for PRS 7 Fig. 2 The hierrchy of bsic LTL frgments with respect to the initil equivlence. The dshed line shows the decidbility boundry of the model checking problem for wprs: the problem is decidble for ll the frgments below the line, while it is undecidble for ll the frgments bove the line (even if we consider PA systems only) 2.3 Studied problems Let F be n LTL frgment nd C be clss of wprs systems. This pper dels with the following three verifiction problems. 1. Themodel checking problem for F nd C is to decide, for ny given formul ϕ F nd ny given system C,whetherL( ) ϕ holds. 2. We lso consider the problem clled model checking of infinite runs, wherel( ) Act ω ϕ is exmined. 3. The pointed model checking problem for F nd wprs is to decide whether given formul ϕ F, given wprs system, nd given nonterminl stte pt of stisfy L(pt, ) ϕ, wherel(pt, )is the set of ll pointed words (u, i) such tht hs 0 1 run p 0 t 0 p 1 t 1... i 1 p i t i i...stisfying u = nd pt = p i t i. 3 Model checking for negted A This section strts with the definition of the LTL frgment A. The rest of the section is devoted to decidbility of the model checking problem for wprs nd negted formule of this frgment. Recll tht LTL() denotes the frgment of formule without ny modlity, i.e., boolen combintions of ctions. In the following we use ϕ 1 U + ϕ 2 to bbrevite ϕ 1 X(ϕ 1 U ϕ 2 ).

8 8 L. Bozzelli et l. Definition 1 Let δ = θ 1 O 1 θ 2 O 2...θ n O n θ n+1,wheren > 0, ech θ i LTL(), O n is G s, nd, for ech i < n, O i is either U or U + or X. Further, let B LTL() be finite set. An α-formul is defined s α(δ, B) = (θ 1 O 1 (θ 2 O 2 (θ n O n θ n+1 ) )) ψ B G s F s ψ. The frgment A consists of ll finite disjunctions of α-formule. Hence, word u stisfies α(δ, B) iff u cn be written s conctention u 1.u 2..u n+1, where ech word u i consists only of ctions stisfying θ i nd u i 0ifi = n + 1orO i is U, u i > 0ifO i is U +, u i =1ifO i is X or G s, u n+1 stisfies G s F s ψ for every ψ B. In the following we use the fct tht finite disjunctions of α-formule re closed under conjunction. Lemm 1 A conjunction of α-formule cn be effectively converted into n equivlent disjunction of α-formule. The proof is strightforwrd but quite technicl exercise, see [21] for some hints. To support n intuition, we provide n exmple of conjunction of two simple α-formule nd n equivlent disjunction. Exmple 1 A conjunction α(θ 1 U θ 2 G s θ 3, B) α(θ 1 U θ 2 G sθ 3, B ) is equivlent to the following disjunction. α((θ 1 θ 1 ) U (θ 2 θ 2 ) G s(θ 3 θ 3 ), B B ) α((θ 1 θ 1 ) U (θ 2 θ 1 ) X(θ 3 θ 1 ) U (θ 3 θ 2 ) G s(θ 3 θ 3 ), B B ) α((θ 1 θ 1 ) U (θ 1 θ 2 ) X(θ 1 θ 3 ) U (θ 2 θ 3 ) G s(θ 3 θ 3 ), B B ) In order to show tht the model checking problem for wprs nd negted formule of A is decidble, we prove decidbility of the dul problem, i.e., whether given wprs system hs run stisfying given formul of A. Finite nd infinite runs re treted seprtely. Theorem 1 The problem whether given wprs system hs finite run stisfying given α-formul is decidble. Proof Let be wprs system nd α(δ, B) be n α-formul. Note tht formul G s F s ψ is stisfied by finite nonempty word if nd only if the length of the word is 1. Therefore, if B = then it is esy to check whether there is finite run of stisfying α(δ, B). Inwht follows we ssume B =. Let δ = θ 1 O 1 θ 2 O 2...θ n O n θ n+1. We construct wprs system with control sttes M( ) {1, 2,...,n + 1} nd the following four types of trnsition rules. 1. For ny 1 i n nd every rule pt 1 qt 2 of such tht n ction stisfies θ i,we dd the rule (p, i)t 1 (q, i + 1)t 2 to. Moreover, if O i is U or U + then we lso dd the rule (p, i)t 1 (q, i)t Let e be fresh ction. For every p M( ), X Const( ), ndforlli, 1 i n, such tht O i = U, weddtherule(p, i)x e (p, i + 1)X to.

9 On decidbility of LTL model checking for PRS 9 3. For every rule pt 1 qt 2 of such tht stisfies θ n+1,weddtherule(p, n +1)t 1 (q, n + 1)t 2 to. 4. For every rule pt 1 qt 2 of we dd the rule (p, n + 1)t 1 (p, n + 1)t 1 to. Loosely speking, the rules of type 1 3 llow to simulte ll the runs of which stisfy α(δ, ). The rules of type 4 ssure tht stte (p, n + 1)t of is terminl if nd only if the stte pt of is terminl. u Let p 0 t 0 be the initil stte of. There is finite run p 0 t 0 qt stisfying α(δ, ) if v nd only if there is finite run (p 0, 1)t 0 (q, n +1)t. Hence, we need to decide whether there exists stte of the form (q, n + 1)t tht is terminl nd rechble from (p 0, 1)t 0. To tht end, for every p M( ) we dd to the rule (p, n + 1)Z end (p, n + 1)ε, where end Act( ) is fresh ction nd Z Const( ) is fresh process constnt. Now, it holds tht hs finite run stisfying α(δ, ) if nd only if there exists stte of, which is rechble from (p 0, 1)(t 0 Z) nd the only enbled ction in this stte is end. This lst condition on the stte cn be expressed by formul ϕ = end tt Act( ) tt of the Hennessy Milner logic. As rechbility of stte stisfying given Hennessy Milner formul is decidble for wprs (see [11] for detils), we re done. The problem for infinite runs is more complicted. In order to solve it, we introduce more terminology nd nottion. At first we define β-formule nd regulr lnguges clled γ -lnguges. Letw = 1 O 1 2 O 2... n O n,wheren 0, 1,..., n Act re pirwise distinct ctions nd ech O i is either U + or X. Further, let B Act { 1,..., n } be nonempty finite set of ctions nd C B.Aβ-formul β(w, B, C) nd γ -lnguge γ(w,c) re defined s ( β(w, B, C) = 1 O 1 ( 2 O 2...( n O n G b Bb)...) ) GFb (Fb GFb) b C b B C γ(w,c) = o 1 1.o 2 2..o n n.l, { { + if Oi = U where o i = + {ε} if C = 1 if O i = X nd L = b C C.b.C otherwise. Roughly speking, β-formul is more restrictive version of n α-formul nd in the context of β-formule we consider infinite words only. Contrry to δ of n α-formul, w of β-formul employs ctions rther thn LTL() formule. While til of n infinite word stisfying n α-formul is specified by θ n+1, in the definition of β-formule we use set B contining exctly ll the ctions of the til nd its subset C of exctly ll those ctions occurring infinitely mny times in the til. Remrk 1 Note tht n infinite word stisfies formul β(w, B, C) if nd only if it cn be divided into prefix u γ(w,b) nd suffix v C ω such tht v contins infinitely mny occurrences of every c C. Let B, C,ndw = 1 O 1 2 O 2... n O n be defined s bove. We sy tht finite derivtion σ over word u stisfies γ(w,c) if nd only if u γ(w,c). Wewrite(w, B ) (w, B) whenever B B nd w = i1 O i1 i2 O i2... ik O ik for some 1 i 1 < i 2 <... < i k n. Moreover, we write (w, B, C ) (w, B, C) whenever (w, B ) (w, B), B is nonempty, nd C C B.

10 10 L. Bozzelli et l. Remrk 2 If u is n infinite word stisfying β(w, B, C) nd v is n infinite subword of u (i.e., it rises from u by omitting some letters), then there is exctly one triple (w, B, C ) (w, B, C) such tht v β(w, B, C ). Further, for ech finite subword v of u, thereis exctly one pir (w, B ) such tht (w, B ) (w, B) nd v γ(w, B ). Given PRS in norml form, by tri( ), pr( ), ndseq( ) we denote the system restricted to trivil, prllel, nd sequentil rules, respectively. A derivtion in tri( ) is clled trivil derivtion in. In wht follows we write simply tri, pr, seq s is lwys clerly determined by the context. Definition 2 Let be PRS in norml form nd β(w, B, C) be β-formul. The PRS is in flt (w, B, C)-form if nd only if, for ech X, Y Const( ), ech (w, B, C ) (w, B, C), nd ech B B, the following conditions hold: 1. If there is finite derivtion X u Y stisfying γ(w, B ), then there is lso finite derivtion X v tri Y stisfying γ(w, B ). 2. If there is term t nd finite derivtion X u t stisfying γ(w, B ), then there is lso constnt Z nd finite derivtion X v tri Z stisfying γ(w, B ). 3. If w = ε nd there is n infinite derivtion X u stisfying β(w, B, C ), then there is lso n infinite derivtion X v tri stisfying β(w, B, C ). 4. If there is n infinite derivtion X u pr stisfying β(w, B, C ), then there is lso n infinite derivtion X v tri stisfying β(w, B, C ); 5. If there is n infinite derivtion X u seq stisfying β(w, B, C ), then there is lso n infinite derivtion X v tri stisfying β(w, B, C ). Intuitively, the system is in flt (w, B, C)-form if, for every derivtion of one of the listed types there is n equivlent trivil derivtion. All conditions of the definition cn be checked due to the following lemm, results of [3], nd decidbility of LTL model checking for PDA nd PN. Lemm 3 sys tht every PRS in norml form cn be trnsformed into n equivlent flt system. Finlly, Lemm 4 sys tht if PRS system in flt (w, B, C)-form hs n infinite derivtion stisfying β(w, B, C), then it hs lso trivil infinite derivtion stisfying β(w, B, C). Note tht it is esy to check whether such trivil derivtion exists. Lemm 2 Given γ -lnguge γ(w,c), PRS system, nd constnts X, Y, the following problems re decidble: (i) Is there ny derivtion X u Y stisfying γ(w,c)? (ii) Is there ny derivtion X u t such tht t is term nd u γ(w,c)? Proof The two problems cn be reduced to the rechbility problem for wprs (i.e., to decide whether given sttes p 1 t 1, p 2 t 2 of given wprs system v stisfy p 1 t 1 p 2 t 2 for some v), which is known to be decidble [9]. (i) Let w = 1 O 1... n O n. We construct wprs with the set of control sttes {1, 2,...,n} 2 C. Intuitively, control sttes 1, 2,...,n re used to check tht the ctions 1, 2,..., n pper in the right order nd quntity due to w, while the other ctions re not llowed. After tht, the control sttes in 2 C re used to check tht every ction in C ppers t lest once. The set of rewrite rules is defined s follows. For the ske of compctness, we use (n + 1) s nother nme for the control stte.

11 On decidbility of LTL model checking for PRS 11 (ii) i For every 1 i n nd every rule t 1 t 2 of, weddto the rule i i it 1 (i + 1)t 2 nd if O i = U + then lso the rule it 1 it 2. b For every b C, everyd C, nd every rule t 1 t 2 of, weddto the b rule Dt 1 (D {b})t 2. Obviously, word u Act stisfies 1X CY if nd only if it stisfies both X u Y nd u γ(w,c). As we cn decide whether 1X u CY holds for some u, we cn decide Problem (i). We construct wprs s in the previous cse. Moreover, for every Z Const( ), we dd to the rule CZ e Cε. It is esy to see tht if word u γ(w,c) stisfies u X t for some t, then1x uem Cε holds for some m 0. Conversely, if 1X v Cε holds for some v, then some prefix u of v stisfies both u γ(w,c) nd X u t for some t. As we cn decide whether, for some v,1x v Cε holds, we cn decide Problem (ii). u The proof of the following lemm contins the lgorithmic core of this section. Lemm 3 Let be PRS in normlformnd β(w, B, C) be β-formul. One cn construct PRS in flt (w, B, C)-form such tht, for ech (w, B, C ) (w, B, C) nd ech X Const( ), hs n infinite derivtion strting from X nd stisfying β(w, B, C ) if nd only if hs n infinite derivtion strting from X nd stisfying β(w, B, C ). Proof In order to obtin, we describe n lgorithm extending with trivil rewrite rules in ccordnce with Conditions 1 5 of Definition 2. All the conditions of Definition 2 cn be checked for ech X, Y Const( ), ech (w, B, C ) (w, B, C), nd ech B B. For Conditions 1 nd 2, this follows from Lemm 2. The problem whether there is n infinite derivtion X u stisfying β(ε, B, C ) is specil cse of the firness problem, which is decidble due to [3]. Finlly, Conditions 4 nd 5 cn be checked due to decidbility of LTL model checking for PDA [1]ndPN[5]. If there is non-stisfied condition, we dd some trivil rules forming the missing derivtion. Let us ssume tht Condition 3 (or 4 or 5, respectively) is not stisfied, i.e., there exists n infinite derivtion X u (or X u pr or X u seq, respectively) stisfying β(w, B, C ) for some (w, B, C ) (w, B, C) nd violting the condition. Remrk 1 implies tht C is nonempty nd there is finite derivtion X v t stisfying γ(w, B ). Hence, there exists n ordering of B ={b 1, b 2,...,b m } such tht (*) for ech 1 j m, there is finite derivtion in strting from X nd stisfying γ(w, {b 1,...,b j }). We cn effectively select such n ordering out of ll orderings of B using Lemm 2.Further, let w = 1 O 1 2 O 2... n O n nd let C ={c 1, c 2,...,c k }. Then, we dd the trivil rule i b j Z i 1 Z i for ech 1 i n, the trivil rule Z n+ j 1 Z n+ j for ech 1 j m,ndthe c j trivil rule Z n+m+ j 1 Z n+m+ j for ech 1 j k, wherez 0 = X, Z 1,...,Z n+m+k 1 re fresh process constnts, nd Z n+m+k = Z n+m. These dded rules form n infinite derivtion using only trivil rules, strting from X, nd stisfying β(w, B, C ). Similrly, if there re X, Y,ndγ(w, B ) with w = 1 O 1 2 O 2... n O n such tht Condition 1 or 2 of Definition 2 is violted, then we first compute n ordering {b 1,...,b m } of B i stisfying (*), nd then we dd the trivil rule Z i 1 Z i for ech 1 i n, nd

12 12 L. Bozzelli et l. b j the trivil rule Z n+ j 1 Z n+ j for ech 1 j m,wherez 0 = X nd Z 1,...,Z n+m re fresh process constnts (with exception of Z n+m which is Y in the cse of Condition 1). The dded trivil rules generte derivtion X 1... n b 1...b m Z n+m stisfying γ(w, B ). Let be the PRS extended with the new rules. The condition (*) ensures tht, for ech X Const( ) nd ech (w, B, C ) (w, B, C), the system is equivlent to with respect to the existence of n infinite derivtion strting from X nd stisfying β(w, B, C ). If is not in flt (w, B, C)-form, then the lgorithm repets the procedure described bove on the system with the difference tht X nd Y rnge over the constnts of the originl system. The lgorithm eventully termintes s the number of itertions is bounded by the number of pirs of process constnts X, Y of, times the number of triples (w, B, C ) stisfying (w, B, C ) (w, B, C), nd times the number of subsets B B.Let be the resulting PRS. We clim tht is in flt (w, B, C)-form. For the process constnts of the originl system, by construction stisfies ll conditions of Definition 2. For the dded constnts, it is sufficient to observe tht ny derivtion in strting from such constnt either is trivil or hs trivil prefix leding to constnt of. Hence, is the desired PRS system. Definition 3 (Subderivtion) Let be PRS in norml form nd σ 1 be (finite or infinite) derivtion s 1 s 2...,wheres 1 s 2 hs the form X 1 Y.Z nd, for ech i 2, if s i is not the lst stte of the derivtion, then it hs the form s i = t i.z with t i = ε.thenσ 1 is clled subderivtion of derivtion σ if σ hs suffix σ stisfying the following: 1. every trnsition step in σ is of the form s i t i s i+1 t or s i t t b t, 2. in σ, if we replce every step of the form s i t i we skip every step of the form s i t s i+1 t by the step s i b s i t, we get precisely σ 1. b s i t,where i s i+1 nd Further, if σ 1 nd σ re finite, the lst term of σ 1 is process constnt, nd σ is prefix of derivtion σ,thenσ 1 is lso subderivtion of σ. Remrk 3 Let be PRS in norml form nd σ be derivtion of hving suffix σ of the form σ u = X t (Y.Z) t. Then, there is subderivtion of σ whose first trnsition step X Y.Z corresponds to the first trnsition step of σ. Intuitively, the subderivtion cptures the behviour of the subterm Y.Z since its emergence until it is possibly reduced to term without ny sequentil composition. Due to the norml form of, the subterm Y.Z behves independently on the rest of the term (s long s it contins sequentil composition). Lemm 4 Let be PRS in flt (w, B, C)-form. Then, for ech X Const( ) nd ech (w, B, C ) (w, B, C), the following condition holds: If there is n infinite derivtion X u stisfying β(w, B, C ), then there is lso n infinite derivtion X v tri stisfying β(w, B, C ). A sketch of the proof Given n infinite derivtion σ stisfying formul β(σ)=β(w, B, C ) where (w, B, C ) (w, B, C),bytrivil equivlent of σ we men n infinite trivil derivtion strting with the sme term s σ nd stisfying β(σ). Similrly, given finite derivtion σ stisfying some γ(σ) = γ(w, B ) where (w, B ) (w, B), bytrivil equivlent of σ we men finite trivil derivtion σ such tht σ strts with the sme term s σ, it stisfies

13 On decidbility of LTL model checking for PRS 13 γ(σ), nd if the lst term of σ is process constnt, then the lst term of σ is the sme process constnt. The lemm is proven by contrdiction. We ssume tht there exist some infinite derivtions violting the condition of the lemm. Let σ be one of these derivtions such tht the number of trnsition steps of σ generted by sequentil non-trivil rules with ctions B is miniml (note tht this number is lwys finite s we consider derivtions stisfying β(w, B, C ) for some (w, B, C ) (w, B, C)). First, we prove tht every subderivtion of σ hs trivil equivlent. Then we replce ll subderivtions of σ by the corresponding trivil equivlents. This step is techniclly nontrivil becuse σ my hve infinitely mny subderivtions. By the replcement we obtin n infinite derivtion σ stisfying β(σ) nd strting with the sme process constnt s σ. Moreover, σ hs no subderivtions nd hence it does not contin ny sequentil opertor. Flt (w, B, C)-form of (Condition 4) implies tht σ hs trivil equivlent. This is lso trivil equivlent of σ which mens tht σ does not violte the condition of our lemm. Proof In this proof, by β-formul we lwys men formul of the form β(w, B, C ) where (w, B, C ) (w, B, C). We lso consider only infinite derivtions stisfying some of these β-formule. Remrk 2 implies tht such n infinite derivtion σ stisfies exctly one β-formul. We denote this β-formul by β(σ).further,byseq(σ ) we denote the number of trnsition steps t i t i+1 of σ generted by sequentil non-trivil rule nd such tht B. Note tht SEQ(σ ) is lwys finite due to the restrictions on considered infinite derivtions. Given n infinite derivtion σ, by its trivil equivlent we men n infinite trivil derivtion strting with the sme term s σ nd stisfying β(σ). Similrly, we consider only finite derivtions stisfying some γ(w, B ) where (w, B ) (w, B). Remrk 2 implies tht such finite derivtion σ stisfies exctly one γ -lnguge, which is denoted by γ(σ). Given finite derivtion σ, by its trivil equivlent we men finite trivil derivtion σ such tht σ strts with the sme term s σ, it stisfies γ(σ),ndif the lst term of σ is process constnt, then the lst term of σ is the sme process constnt. Using the introduced terminology, the lemm sys tht every infinite derivtion strting with process constnt hs trivil equivlent. For the ske of contrdiction, we ssume tht the lemm doesnot hold. LetΣ be the nonempty set of infinite derivtions violting the lemm nd let k = min{seq(σ ) σ Σ}. First of ll, we prove two clims. Clim 1 Let σ be n infinite derivtion stisfying SEQ(σ ) k. Then every subderivtion of σ hs trivil equivlent. Proof of the clim For finite subderivtions, the existence of trivil equivlents follows directly from the flt (w, B, C)-form of (Conditions 1 nd 2). Let σ 1 be n infinite subderivtion of σ.ithstheformσ 1 = X seq Y.Z b 1 t 1.Z b 2 t 2.Z b 3... where t 1, t 2,...re nonempty terms. There re two cses: If B, thenβ(σ 1 ) hs the form β(ε, B, C ). Hence, σ 1 hs trivil equivlent due to the flt (w, B, C)-form of (Condition 3). If B, then the first step X seq Y.Z of σ 1 is counted in SEQ(σ 1 ) nd the corresponding step X t seq Y.Z t of σ is counted in SEQ(σ ). Hence, 0 < SEQ(σ ). Let σ 2 be the derivtion σ 2 = Y b 1 b 2 b 3 t 1 t 2...AsSEQ(σ 2 )<SEQ(σ 1 ) k, the definition of k implies tht σ 2 hs trivil equivlent σ 2 = Y c 1 c 2 c 3 tri Y 1 tri Y 2 tri. Further, s σ 2 stisfies β(σ 2), the derivtion σ 1 = X seq Y.Z c 1 tri Y 1.Z c 2 tri

14 14 L. Bozzelli et l. Y 2.Z c 3 tri... stisfies β(σ 1 ).Moreover,theflt(w, B, C)-form of (Condition 5) implies tht σ 1 hs trivil equivlent. Obviously, it is lso trivil equivlent of σ 1. Clim 2 Let σ be n infinite derivtion such tht SEQ(σ ) k, it strts with prllel term p, nd it stisfies formul β(w, B, C ). Then there is n infinite derivtion p u pr p v such tht p is prllel term, u γ(w, B ),ndv stisfies β(ε,c, C ). Proof of the clim Remrk 1 implies tht σ cn be written s p u 1 u 2 t where p u 1 t is the miniml prefix of σ stisfying γ(w, B u 2 ) ndsuchthtt stisfies β(ε,c, C ).Let SEQ(σ ) denote the number of trnsition steps in the prefix p u 1 t generted by sequentil non-trivil rules (note tht SEQ(σ ) SEQ(σ ) s in SEQ(σ ) we do not count trnsition steps lbelled with ctions of B). We prove the clim by induction on SEQ(σ ). The bse cse SEQ(σ ) = 0isobvious.Now,ssumetht SEQ(σ ) > 0. Since p is prllel term nd is in norml form, the first trnsition step of p u 1 t counted in SEQ(σ ) hs the form Y p (W.Z) p nd it corresponds to the first trnsition step Y W.Z of subderivtion σ 1.Inσ, we replce the subderivtion σ 1 with its trivil equivlent (whose existence is gurnteed by Clim 1) nd we obtin new derivtion σ strting with p, stisfying β(σ) nd such tht SEQ(σ )< SEQ(σ ). Hence, the second clim directly follows from the induction hypothesis. In the following, we describe the replcement of such subderivtion. Let σ 1 = Y u nd σ 1 = Y v tri be its trivil equivlent. Let β(σ 1 ) = β(c 1 O 1 c 2 O 2... c n O n, B, C ).Thenu,v c 1 + c+ 2...c+ n.bω. Recll tht c 1, c 2,...,c n re pirwise distinct nd B Act {c 1,...,c n }. Intuitively, for every 1 i n, we replce the first trnsition step of σ 1 lbelled with c i by the sequence of trnsition steps of σ 1 lbelled with c i,ndthen we cncel the other trnsition steps of σ 1 lbelled with c i. 3 Further, the first trnsition step of σ 1 lbelled with n ction of B is replced with the miniml prefix of the remining prt of σ 1 stisfying γ(ε,b ). Finlly, the remining trnsition steps of σ 1 re orderly replced with the remining trnsition steps of σ 1.Thecsewhenσ 1 nd its trivil equivlent σ 1 re finite is similr. It is esy to see tht the described replcement opertion preserves the fulfilment of β(σ) nd the obtined derivtion σ stisfies SEQ(σ )< SEQ(σ ). With this clim, we cn esily derive contrdiction. Let σ = X u be n infinite derivtion such tht SEQ(σ ) = k nd it hs no trivil equivlent. Further, let β(σ) = (w, B, C ). Note tht C is nonempty. Clim 2 sys tht there is derivtion X u 1 v 1 pr p 1 where p 1 is prllel term, u 1 γ(w, B ),ndv 1 stisfies β(ε,c, C ). Applying this clim on the suffix p 1,wegetderivtionp 1 pr p 2 where p 2 is prllel term, u 2 γ(ε,c ), v 1 u 2 v 2 nd v 2 stisfies β(ε,c, C u i+1 ). Iterting this rgument, we get sequence (p i pr p i+1 ) i N of derivtions stisfying γ(ε,c ). These derivtions re nonempty s C is nonempty. Let us 3 v By replcement of trnsition step s 1 s 2 of σ 1 by sequence Y 1 tri Y 2 of trnsition steps of σ 1 we men tht the corresponding trnsition step s 1 t s 2 t of σ is replced by Y 1 t v tri Y 2 t, nd ll immeditely succeeding steps s 2 t b s 2 t of σ re replced by Y 2 t b Y 2 t. Further, by c i cncelltion of trnsition step s 1 s 2 of σ 1 we men tht the corresponding trnsition step s 1 t c i s 2 t of σ is replced by Y 2 t,wherey 2 is the lst process constnt of σ 1 such tht trnsition under c i leds to Y 2, nd ll immeditely succeeding steps s 2 t b s 2 t of σ re replced by Y 2 t b Y 2 t.

15 On decidbility of LTL model checking for PRS 15 consider the derivtion σ = X u 1 u 2 u 3 u 4 pr p 1 pr p 2 pr p 3 pr... Flt (w, B, C)-form of (Condition 4) implies tht σ hs trivil equivlent. However, this is lso trivil equivlent of σ s both σ, σ strt with X nd σ stisfies β(σ).thisis contrdiction. Theorem 2 The problem whether given PRS in norml form hs n infinite run stisfying given formul β(w, B, C) is decidble. Proof Due to Lemms 3 nd 4, the problem cn be reduced to the problem whether there is n infinite derivtion X v tri stisfying β(w, B, C). This problem corresponds to LTL model checking of finite-stte systems, which is decidble. The following three theorems show tht Theorem 2 holds even for wprs ndα-formule. Theorem 3 The problem whether given PRS in norml form hs n infinite run stisfying given α-formul is decidble. Proof Let be PRS in norml form nd α(θ 1 O 1...θ n O n ξ,b) be n α-formul. For every b i θ i nd every rule t 1 t 2 such tht b stisfies θ i,weddrulet 1 t 2,where i is b fresh ction corresponding to θ i. Similrly, for every ψ B {ξ} nd every rule t 1 t 2 ψ t 2,where ψ is fresh ction. Let such tht b stisfies ψ ξ, weddrulet 1 be the resulting PRS system. Note tht is lso in norml form. Obviously, hs n infinite run stisfying the originl α-formul if nd only if hs n infinite run stisfying α( 1 O 1... n O n ( ξ b C b), C),whereC ={ ψ ψ B}. It is n esy exercise to show tht this new α-formul cn be effectively trnsformed into disjunction of β-formule which is equivlent with respect to infinite words. Hence, the problem is decidble due to Theorem 2. Theorem 4 The problem whether given PRS hs n infinite run stisfying given α-formul is decidble. Proof Let beprs,α(δ, B) be n α-formul, nd e Act( ) be fresh ction. First of ll, we describe our modifiction of the stndrd lgorithm [17] tht trnsforms into PRS in norml form. Let t 0 be the initil stte of. Ift 0 is not process constnt, we replce it by fresh process constnt X 0 nd we dd rewrite rule X 0 t for ech ction nd ech term t such tht t 0 t. Note tht the number of dded rules is lwys finite. If is still not in norml form, then there exists rule r which is neither prllel nor sequentil; r hs one of the following forms: 1. r = t t 1 t 2 (resp., r = t 1 t 2 t) wheret or t 1 or t 2 is not prllel term. Let e Z 1, Z 2, Z Const( ) be fresh process constnts. We replce r with the rules t Z, Z e e e e Z 1 Z 2, Z 1 t 1,ndZ 2 t 2 (resp., t 1 Z 1, t 2 Z 2, Z 1 Z 2 Z, nd Z e t). 2. r = t t 1.(t 2 t 3 ) (resp., r = t 1.(t 2 t 3 ) t). Let Z Const( ) be fresh process constnt. We modify in two steps. First, we replce t 2 t 3 by Z in left-hnd nd righthnd sides of ll rules of. Then, we dd the rules Z e e t 2 t 3 nd t 2 t 3 Z.

16 16 L. Bozzelli et l. 3. r = t 1 t 2.X (resp., r = t 2.X t 1 )wheret 1 or t 2 is not process constnt. Let e Z 1, Z 2 Const( ) be fresh process constnts. We replce r with the rules t 1 Z 1, e e Z 1 Z 2.X, ndz 2 t 2 (resp., t 2 Z 2, Z 2.X e Z 1,ndZ 1 t 1 ). After finite number of pplictions of this procedure (with the sme ction e), we obtin PRS in norml form. Wedefineformulα(δ, B ),whereb = B { Act( ) } nd δ rises from δ = θ 1 O 1...θ n O n ξ by the following substitution for every i, 1 i n. If O i is U, then replce the pir θ i U by the pir (e θ i ) U. If O i is U +, then replce the pir θ i U + by the sequence (e θ i ) U θ i U +. If O i is X, then replce the pir θ i X by the sequence e U θ i X. θ n O n = θ n G s is replced by the sequence e U θ n G s. ξ is replced by (ξ e). Let us note tht the construction of B ensures tht ny word with suffix e ω does not stisfy α(δ, B ). Observe tht u α(δ, B ) if nd only if u α(δ, B),whereu is obtined from u by eliminting ll occurrences of ction e. Clerly, hs n infinite run stisfying α(δ, B) if nd only if hs n infinite run stisfying α(δ, B ).As is in norml form, we cn now pply Theorem 3. Theorem 5 The problem whether given wprs system hs n infinite run stisfying given α-formul is decidble. Proof Let be wprs with the initil stte p 0 t 0 nd α(δ, B) be n α-formul. We construct PRS with the initil stte t 0 which cn simulte. We lso define set of formule recognizing correct simultions. The system is very similr to. We chnge only ctions of rules to hold informtion bout control sttes in the rules nd then we remove ll control sttes. To be more precise, [p] for every rule of the form pt 1 pt 2 of,weddtherulet 1 t 2 to, nd for every rule [p<q] of the form pt 1 qt 2 of, weddtherulet 1 t 2 to. Further, we modify the formul α(δ, B) in such wy tht every occurrence of ech ction is replced by q M( ) ( [q] p<q [p<q]). Letα(δ, B ) be the resulting formul. Moreover, for every nonempty subset {p 1, p 2,...,p k } M( ) of control sttes stisfying p 1 < p 2 < < p k nd p 1 = p 0,wedefinenα-formul ϕ [p1 < <p k ] = α(θ [p1 ] U θ [p1 <p 2 ] X θ [p2 ] U θ [p2 <p 3 ] X... θ [pk 1 <p k ] G s θ [pk ], ) where θ [pi ] = Act( ) [p i ] nd θ [pi <p j ] = Act( ) [p i <p j ]. It is esy to see tht there is n infinite run of stisfying α(δ, B) if nd only if there is n infinite run of stisfying α(δ, B ) nd ϕ [p1 <p 2 < <p k ] for some control sttes p 1, p 2,...,p k such tht p 1 < p 2 < < p k nd p 1 = p 0. As the number of such sequences is finite nd ech ϕ [p1 <p 2 < <p k ] is n α-formul, Theorem 4 nd Lemm 1 imply tht the considered problem is decidble. Theorems 1 nd 5 imply the following corollry. Corollry 1 The modelchecking problemfor wprs ndnegtedformule ofa is decidble.

17 On decidbility of LTL model checking for PRS 17 4 Model checking for LTL(F s, G s ) This section focuses on the frgment LTL(F s, G s ): we show tht formule of this frgment cn be trnslted into A nd thus the model checking problem for LTL(F s, G s ) nd wprs is decidble. Theorem 6 Every LTL(F s, G s ) formul cn be trnslted into n equivlent disjunction of α-formule. Proof As F s nd G s re dul modlities, we cn ssume tht every LTL(F s, G s ) formul contins negtions only in front of ctions. Given n LTL(F s, G s ) formul ϕ, we construct finite set A ϕ of α-formule such tht ϕ is equivlent to the disjunction of formule in A ϕ. Although our proof looks like by induction on the structure of ϕ, it is in fct by induction on the length of ϕ. Thus,ifϕ LTL(), then we ssume tht for every LTL(F s, G s ) formul ϕ shorter thn ϕ we cn construct the corresponding set A ϕ. In this proof, p represents formul of LTL(). The structure of ϕ fits into one of the following cses. p Cse p In this cse, ϕ is equivlent to p G s tt. Hence A ϕ ={α(p G s tt, )}. Cse ϕ 1 ϕ 2 Due to induction hypothesis, we cn ssume tht we hve sets A ϕ1 nd A ϕ2. Clerly, A ϕ = A ϕ1 A ϕ2. Cse ϕ 1 ϕ 2 Due to Lemm 1, theseta ϕ cn be constructed from the sets A ϕ1 nd A ϕ2. F s Cse F s ϕ 1 As F s (α 1 α 2 ) (F s α 1 ) (F s α 2 ) nd F s (α G s F s φ) (F s α) (G s F s φ), we set A ϕ ={α(tt U + δ, B) α(δ, B) A ϕ1 }. G s Cse G s ϕ 1 This cse is divided into the following subcses ccording to the structure of ϕ 1. p Cse G s p As G s p is equivlent to tt G s p,weseta ϕ ={α(tt G s p, )}. Cse G s (ϕ 2 ϕ 3 ) As G s (ϕ 2 ϕ 3 ) (G s ϕ 2 ) (G s ϕ 3 ),theseta ϕ cn be constructed from A Gs ϕ 2 nd A Gs ϕ 3 using Lemm 1. Note tht A Gs ϕ 2 nd A Gs ϕ 3 cn be constructed becuse G s ϕ 2 nd G s ϕ 3 re shorter thn G s (ϕ 2 ϕ 3 ). F s Cse G s F s ϕ 2 This cse is gin divided into the following subcses. p Cse G s F s p As p LTL(), we directly set A ϕ ={α(tt G s tt, {p})}. Cse G s F s (ϕ 3 ϕ 4 ) As G s F s (ϕ 3 ϕ 4 ) (G s F s ϕ 3 ) (G s F s ϕ 4 ),weset A ϕ = A Gs F s ϕ 3 A Gs F s ϕ 4. Cse G s F s (ϕ 3 ϕ 4 ) This cse is lso divided into subcses depending on the formule ϕ 3 nd ϕ 4. p Cse G s F s (p 3 p 4 ) As p 3 p 4 LTL(), this subcse hs lredy been covered by Cse G s F s p. Cse G s F s (ϕ 3 (ϕ 5 ϕ 6 )) As G s F s (ϕ 3 (ϕ 5 ϕ 6 )) G s F s (ϕ 3 ϕ 5 ) G s F s (ϕ 3 ϕ 6 ),weseta ϕ = A Gs F s (ϕ 3 ϕ 5 ) A Gs F s (ϕ 3 ϕ 6 ). F s Cse G s F s (ϕ 3 F s ϕ 5 ) As G s F s (ϕ 3 F s ϕ 5 ) (G s F s ϕ 3 ) (G s F s ϕ 5 ),the set A ϕ cn be constructed from A Gs F s ϕ 3 nd A Gs F s ϕ 5 using Lemm 1. G s Cse G s F s (ϕ 3 G s ϕ 5 ) As G s F s (ϕ 3 G s ϕ 5 ) (G s F s ϕ 3 ) (G s F s G s ϕ 5 ), the set A ϕ cn be constructed from A Gs F s ϕ 3 nd A Gs F s G s ϕ 5 using Lemm 1. F s Cse G s F s F s ϕ 3 As G s F s F s ϕ 3 G s F s ϕ 3,wesetA ϕ = A Gs F s ϕ 1. G s Cse G s F s G s ϕ 3 Awordu stisfies G s F s G s ϕ 3 iff u =1oru is n infinite word stisfying F s G s ϕ 3.NotethtG s tt is stisfied only by finite words of length one. Further, word u stisfies (F s tt) (G s F s tt) iff u is infinite. Thus, G s F s G s ϕ 3 (G s tt) ϕ where ϕ = (F s tt) (G s F s tt) (F s G s ϕ 3 ).

18 18 L. Bozzelli et l. Hence, A ϕ = A Gs tt A ϕ where A ϕ is constructed from A Fs tt, A Gs F s tt, nd A Fs G s ϕ 3 using Lemm 1. Cse G s (ϕ 2 ϕ 3 ) According to the structure of ϕ 2 nd ϕ 3, there re the following subcses. p Cse G s (p 2 p 3 ) As p 2 p 3 LTL(), this subcse hs lredy been covered by Cse G s p. Cse G s (ϕ 2 (ϕ 4 ϕ 5 )) As G s (ϕ 2 (ϕ 4 ϕ 5 )) G s (ϕ 2 ϕ 4 ) G s (ϕ 2 ϕ 5 ),theseta ϕ cn be constructed from A Gs (ϕ 2 ϕ 4 ) nd A Gs (ϕ 2 ϕ 5 ) using Lemm 1. F s Cse G s (ϕ 2 F s ϕ 4 ) It holds tht G s (ϕ 2 F s ϕ 4 ) (G s ϕ 2 ) F s (ϕ 4 ϕ 2 G s ϕ 2 ) G s F s ϕ 4. Therefore, the set A ϕ cn be constructed s A Gs ϕ 2 {α(tt U + δ, B) α(δ, B) A ϕ4 ϕ 2 G s ϕ 2 } A Gs F s ϕ 4,whereA ϕ4 ϕ 2 G s ϕ 2 is constructed from A ϕ4, A ϕ2,nda Gs ϕ 2 due to Lemm 1. G s Cse G s (ϕ 2 G s ϕ 4 ) There re only the following two subcses (the others fit to some of the previous cses). (i) Cse G s ( ϕ G G sϕ ) It holds tht G s ( ϕ G G sϕ ) (G s tt) ϕ G (XG sϕ ). Therefore, the set A ϕ cn be constructed s A Gs tt ϕ G {α(tt Xδ, B) α(δ, B) A G s ϕ }. (ii) Cse G s (p 2 ϕ 1 G G sϕ 1 ) As G s (p 2 ϕ G G sϕ ) (G s p 2 ) ϕ G (X(p 2 UG s ϕ )), theseta ϕ cn be constructed s A Gs p 2 ϕ G {α(tt X p 2 U δ, B) α(δ, B) A Gs ϕ }. G s Cse G s (G s ϕ 2 ) As G s (G s ϕ 2 ) (G s tt) (XG s ϕ 2 ),theseta ϕ cn be constructed s A Gs tt {α(tt Xδ, B) α(δ, B) A Gs ϕ 2 }. As LTL(F s, G s ) is closed under negtion, Theorem 6 nd Corollry 1 give us the following. Corollry 2 The model checking problem for wprs nd LTL(F s, G s ) is decidble. This problem is EXPSPACE-hrd due to EXPSPACE-hrdness of the model checking problem for LTL(F, G) nd PN [8]. Our decidbility proof does not provide ny primitive recursive upper bound s it employs rechbility for PN (for exmple, it is used in decision procedure for rechbility for wprs [9]), for which no primitive recursive upper bound is known. 5 Model checking for LTL(F s, G s, P s, H s ) This section extends the results of the previous two sections to hndle pst modlities eventully in the strict pst nd lwys in the strict pst s well. We strt with pst extension of α-formule clled Pα-formule. Intuitively, Pα-formul is conjunction of n α-formul nd pst version of the α-formul. A forml definition of Pα-formul mkes use of ϕ 1 S + ϕ 2 to bbrevite ϕ 1 Y(ϕ 1 S ϕ 2 ). Definition 4 Let η = ι 1 P 1 ι 2 P 2...ι m P m ι m+1,wherem > 0, ech ι j LTL(), P m is H s, nd, for ech j < m, P j is either S or S + or Y. Further, let α(δ, B) be n α-formul. Then Pα-formul is defined s Pα(η, δ, B) = (ι 1 P 1 (ι 2 P 2...(ι m P m ι m+1 )...)) α(δ, B). The frgment PA consists of ll finite disjunctions of Pα-formule.

19 On decidbility of LTL model checking for PRS 19 Note tht the definition of Pα-formul does not contin ny pst counterprt of ψ B G s F s ψ s every history is finite. Therefore, pointed word (u, k), whereu = , stisfies Pα(η, δ, B) if nd only if k cn be written s conctention v m+1.v m..v 2.v 1, where ech word v i consists only of ctions stisfying ι i nd v i 0ifi = m + 1orP i is S, v i > 0ifP i is S +, v i =1ifP i is Y or H s. The following lemm sys tht the frgment PA is semnticlly closed under conjunction nd ppliction of some temporl opertors. As in the cse of Lemm 1, the proof is intuitively cler but some prts re quite technicl. We refer to [21] for some hints. Lemm 5 Let ϕ be Pα-formul nd p LTL(). Formule Xϕ, Yϕ, pu ϕ, ps ϕ, F s ϕ, P s ϕ, nd lso ny conjunction of Pα-formule cn be effectively converted into globlly equivlent disjunction of Pα-formule. The next step is to show tht we cn decide whether given wprs system hs run stisfying given Pα-formul. The proof utilizes Corollry 1. Theorem 7 The problem whether given wprs system hs run stisfying given Pα-formul is decidble. Proof A run over nonempty (finite or infinite) word u = stisfies formul ϕ iff (u, 0) ϕ. Moreover, (u, 0) Pα(η, δ, B) iff ( 0, 0) η nd (u, 0) α(δ, B). Let η = ι 1 P 1 ι 2 P 2...ι m P m ι m+1. It follows from the semntics of LTL tht ( 0, 0) η if nd only if ( 0, 0) ι m nd P i = S for ll i < m. Therefore, the problem is to check whether P i = S for ll i < m nd whether the given wprs system hs run stisfying ι m α(δ, B). As ι m α(δ, B) cn be esily trnslted into disjunction of α-formule, Corollry 1 finishes the proof. It remins to show tht every LTL(F s, G s, P s, H s ) formul cn be trnslted into PA formul. The proof uses the sme pproch s the one of Theorem 6: it proceeds by thorough nlysis of the structure of trnslted formul. The full proof is in Appendix A. Theorem 8 Every LTL(F s, G s, P s, H s ) formul ϕ cn be trnslted into globlly equivlent disjunction of Pα-formule. As LTL(F s, G s, P s, H s ) is closed under negtion, Theorems 8 nd 7 give us the following. Corollry 3 The model checking problem for wprs nd LTL(F s, G s, P s, H s ) is decidble. Moreover, we cn show tht the pointed model checking problem is decidble for wprs nd LTL(F s, G s, P s, H s ) s well. Agin, we solve the dul problem for Pα-formule. Theorem 9 Let be wprs nd pt be rechble nonterminl stte of. The problem whether L( pt, ) contins pointed word (u, i) stisfying given Pα-formul is decidble. Proof Let = (R, p 0, t 0 ) be wprs nd pt be rechble nonterminl stte of. We construct wprs = (R, p 0, t 0.X) where X Const( ) is fresh process constnt, R = R {(p(t.x) px ), (px f py ), (py p t ) pt p t },

20 20 L. Bozzelli et l. f Act( ) is fresh ction, nd X, Y Const( ) re fresh process constnts for ech Act( ). Let u = be word. It is esy to see tht (u, i) is in L(pt, )iff i 1 i. f. i. i+1... is in L( ). Hence, for ny given Pα-formul ϕ = Pα(η, δ, B) we construct Pα-formul ϕ = Pα(η, tt X f Xδ, B). We get tht L(pt, ) Pα(η, δ, B) L( ) F(Pα(η, tt X f Xδ, B)) nd due to Lemm 5 nd Theorem 7 the proof is done. As LTL(F s, G s, P s, H s ) is closed under negtion nd Theorem 8 works with globl equivlence, Theorem 9 gives us the following. Corollry 4 The pointed model checking problem is decidble for wprs nd LTL(F s, G s, P s, H s ). 6 Undecidbility results Obviously, the model checking for wprs nd LTL(X) is decidble. Hence, to show tht the decidbility boundry of Fig. 2 is drwn correctly, we hve to prove tht the model checking problem is undecidble for wprs nd the frgments LTL(U) nd LTL( F, X). Infct,we show tht the problem is undecidble even for the subclss of PA systems nd the mentioned LTL frgments. The undecidbility proofs re bsed on reductions from the non-hlting problem for Minsky 2-counter mchines, which is known to be undecidble [19]. First of ll, we recll the definition of Minsky mchines. A Minsky 2-counter mchine, or mchine for short, is finite sequence N = l 1 : i 1, l 2 : i 2,...,l n 1 : i n 1, l n : hlt,where n 1, l 1, l 2,...,l n re lbels, nd ech i j is n instruction for either increment: c k := c k +1; goto l r,or test-nd-decrement: if c k >0 then c k := c k -1; goto l r else goto l s where k {1, 2} nd 1 r, s n. The mchine N induces trnsition reltion over configurtions of the form (l j,v 1,v 2 ),wherel j is lbel of n instruction to be executed nd v 1,v 2 0represent current vlues of counters c 1 nd c 2, respectively. We sy tht the mchine N hlts if (l 1, 0, 0) (l n,v 1,v 2 ) for some numbers v 1,v 2 0, where denotes the reflexive nd trnsitive closure of.thenon-hlting problem is to decide whether given mchine N does not hlt. The problem is undecidble [19]. Theorem 10 Model checking of PA ginst LTL(U) is undecidble. Proof Given mchine N, we construct PA system N with the initil stte D 1 D 2 H nd set of rules contining for every instruction l i : c k := c k +1; goto l r,therules D k l i S k.d k C k l i S k.c k inc i S k C k.s k for every instruction l i : if c k >0 then c k := c k -1; goto l r else goto l s, the rules D k l i E k E k zero i D k C k l i ε dec i S k ε the rule H l n H corresponding to the instruction l n : hlt.

Regular Sets and Expressions

Regular Sets and Expressions Regulr Sets nd Expressions Finite utomt re importnt in science, mthemtics, nd engineering. Engineers like them ecuse they re super models for circuits (And, since the dvent of VLSI systems sometimes finite

More information

LINEAR TRANSFORMATIONS AND THEIR REPRESENTING MATRICES

LINEAR TRANSFORMATIONS AND THEIR REPRESENTING MATRICES LINEAR TRANSFORMATIONS AND THEIR REPRESENTING MATRICES DAVID WEBB CONTENTS Liner trnsformtions 2 The representing mtrix of liner trnsformtion 3 3 An ppliction: reflections in the plne 6 4 The lgebr of

More information

Polynomial Functions. Polynomial functions in one variable can be written in expanded form as ( )

Polynomial Functions. Polynomial functions in one variable can be written in expanded form as ( ) Polynomil Functions Polynomil functions in one vrible cn be written in expnded form s n n 1 n 2 2 f x = x + x + x + + x + x+ n n 1 n 2 2 1 0 Exmples of polynomils in expnded form re nd 3 8 7 4 = 5 4 +

More information

Homework 3 Solutions

Homework 3 Solutions CS 341: Foundtions of Computer Science II Prof. Mrvin Nkym Homework 3 Solutions 1. Give NFAs with the specified numer of sttes recognizing ech of the following lnguges. In ll cses, the lphet is Σ = {,1}.

More information

and thus, they are similar. If k = 3 then the Jordan form of both matrices is

and thus, they are similar. If k = 3 then the Jordan form of both matrices is Homework ssignment 11 Section 7. pp. 249-25 Exercise 1. Let N 1 nd N 2 be nilpotent mtrices over the field F. Prove tht N 1 nd N 2 re similr if nd only if they hve the sme miniml polynomil. Solution: If

More information

Section 7-4 Translation of Axes

Section 7-4 Translation of Axes 62 7 ADDITIONAL TOPICS IN ANALYTIC GEOMETRY Section 7-4 Trnsltion of Aes Trnsltion of Aes Stndrd Equtions of Trnslted Conics Grphing Equtions of the Form A 2 C 2 D E F 0 Finding Equtions of Conics In the

More information

2005-06 Second Term MAT2060B 1. Supplementary Notes 3 Interchange of Differentiation and Integration

2005-06 Second Term MAT2060B 1. Supplementary Notes 3 Interchange of Differentiation and Integration Source: http://www.mth.cuhk.edu.hk/~mt26/mt26b/notes/notes3.pdf 25-6 Second Term MAT26B 1 Supplementry Notes 3 Interchnge of Differentition nd Integrtion The theme of this course is bout vrious limiting

More information

All pay auctions with certain and uncertain prizes a comment

All pay auctions with certain and uncertain prizes a comment CENTER FOR RESEARC IN ECONOMICS AND MANAGEMENT CREAM Publiction No. 1-2015 All py uctions with certin nd uncertin prizes comment Christin Riis All py uctions with certin nd uncertin prizes comment Christin

More information

9.3. The Scalar Product. Introduction. Prerequisites. Learning Outcomes

9.3. The Scalar Product. Introduction. Prerequisites. Learning Outcomes The Sclr Product 9.3 Introduction There re two kinds of multipliction involving vectors. The first is known s the sclr product or dot product. This is so-clled becuse when the sclr product of two vectors

More information

Example A rectangular box without lid is to be made from a square cardboard of sides 18 cm by cutting equal squares from each corner and then folding

Example A rectangular box without lid is to be made from a square cardboard of sides 18 cm by cutting equal squares from each corner and then folding 1 Exmple A rectngulr box without lid is to be mde from squre crdbord of sides 18 cm by cutting equl squres from ech corner nd then folding up the sides. 1 Exmple A rectngulr box without lid is to be mde

More information

4.11 Inner Product Spaces

4.11 Inner Product Spaces 314 CHAPTER 4 Vector Spces 9. A mtrix of the form 0 0 b c 0 d 0 0 e 0 f g 0 h 0 cnnot be invertible. 10. A mtrix of the form bc d e f ghi such tht e bd = 0 cnnot be invertible. 4.11 Inner Product Spces

More information

Mathematics. Vectors. hsn.uk.net. Higher. Contents. Vectors 128 HSN23100

Mathematics. Vectors. hsn.uk.net. Higher. Contents. Vectors 128 HSN23100 hsn.uk.net Higher Mthemtics UNIT 3 OUTCOME 1 Vectors Contents Vectors 18 1 Vectors nd Sclrs 18 Components 18 3 Mgnitude 130 4 Equl Vectors 131 5 Addition nd Subtrction of Vectors 13 6 Multipliction by

More information

Integration. 148 Chapter 7 Integration

Integration. 148 Chapter 7 Integration 48 Chpter 7 Integrtion 7 Integrtion t ech, by supposing tht during ech tenth of second the object is going t constnt speed Since the object initilly hs speed, we gin suppose it mintins this speed, but

More information

PROF. BOYAN KOSTADINOV NEW YORK CITY COLLEGE OF TECHNOLOGY, CUNY

PROF. BOYAN KOSTADINOV NEW YORK CITY COLLEGE OF TECHNOLOGY, CUNY MAT 0630 INTERNET RESOURCES, REVIEW OF CONCEPTS AND COMMON MISTAKES PROF. BOYAN KOSTADINOV NEW YORK CITY COLLEGE OF TECHNOLOGY, CUNY Contents 1. ACT Compss Prctice Tests 1 2. Common Mistkes 2 3. Distributive

More information

Modular Generic Verification of LTL Properties for Aspects

Modular Generic Verification of LTL Properties for Aspects Modulr Generic Verifiction of LTL Properties for Aspects Mx Goldmn Shmuel Ktz Computer Science Deprtment Technion Isrel Institute of Technology {mgoldmn, ktz}@cs.technion.c.il ABSTRACT Aspects re seprte

More information

Integration by Substitution

Integration by Substitution Integrtion by Substitution Dr. Philippe B. Lvl Kennesw Stte University August, 8 Abstrct This hndout contins mteril on very importnt integrtion method clled integrtion by substitution. Substitution is

More information

Physics 43 Homework Set 9 Chapter 40 Key

Physics 43 Homework Set 9 Chapter 40 Key Physics 43 Homework Set 9 Chpter 4 Key. The wve function for n electron tht is confined to x nm is. Find the normliztion constnt. b. Wht is the probbility of finding the electron in. nm-wide region t x

More information

MATH 150 HOMEWORK 4 SOLUTIONS

MATH 150 HOMEWORK 4 SOLUTIONS MATH 150 HOMEWORK 4 SOLUTIONS Section 1.8 Show tht the product of two of the numbers 65 1000 8 2001 + 3 177, 79 1212 9 2399 + 2 2001, nd 24 4493 5 8192 + 7 1777 is nonnegtive. Is your proof constructive

More information

5.2. LINE INTEGRALS 265. Let us quickly review the kind of integrals we have studied so far before we introduce a new one.

5.2. LINE INTEGRALS 265. Let us quickly review the kind of integrals we have studied so far before we introduce a new one. 5.2. LINE INTEGRALS 265 5.2 Line Integrls 5.2.1 Introduction Let us quickly review the kind of integrls we hve studied so fr before we introduce new one. 1. Definite integrl. Given continuous rel-vlued

More information

Virtual Machine. Part II: Program Control. Building a Modern Computer From First Principles. www.nand2tetris.org

Virtual Machine. Part II: Program Control. Building a Modern Computer From First Principles. www.nand2tetris.org Virtul Mchine Prt II: Progrm Control Building Modern Computer From First Principles www.nnd2tetris.org Elements of Computing Systems, Nisn & Schocken, MIT Press, www.nnd2tetris.org, Chpter 8: Virtul Mchine,

More information

9 CONTINUOUS DISTRIBUTIONS

9 CONTINUOUS DISTRIBUTIONS 9 CONTINUOUS DISTIBUTIONS A rndom vrible whose vlue my fll nywhere in rnge of vlues is continuous rndom vrible nd will be ssocited with some continuous distribution. Continuous distributions re to discrete

More information

Example 27.1 Draw a Venn diagram to show the relationship between counting numbers, whole numbers, integers, and rational numbers.

Example 27.1 Draw a Venn diagram to show the relationship between counting numbers, whole numbers, integers, and rational numbers. 2 Rtionl Numbers Integers such s 5 were importnt when solving the eqution x+5 = 0. In similr wy, frctions re importnt for solving equtions like 2x = 1. Wht bout equtions like 2x + 1 = 0? Equtions of this

More information

Protocol Analysis. 17-654/17-764 Analysis of Software Artifacts Kevin Bierhoff

Protocol Analysis. 17-654/17-764 Analysis of Software Artifacts Kevin Bierhoff Protocol Anlysis 17-654/17-764 Anlysis of Softwre Artifcts Kevin Bierhoff Tke-Awys Protocols define temporl ordering of events Cn often be cptured with stte mchines Protocol nlysis needs to py ttention

More information

Babylonian Method of Computing the Square Root: Justifications Based on Fuzzy Techniques and on Computational Complexity

Babylonian Method of Computing the Square Root: Justifications Based on Fuzzy Techniques and on Computational Complexity Bbylonin Method of Computing the Squre Root: Justifictions Bsed on Fuzzy Techniques nd on Computtionl Complexity Olg Koshelev Deprtment of Mthemtics Eduction University of Texs t El Pso 500 W. University

More information

Reasoning to Solve Equations and Inequalities

Reasoning to Solve Equations and Inequalities Lesson4 Resoning to Solve Equtions nd Inequlities In erlier work in this unit, you modeled situtions with severl vriles nd equtions. For exmple, suppose you were given usiness plns for concert showing

More information

SPECIAL PRODUCTS AND FACTORIZATION

SPECIAL PRODUCTS AND FACTORIZATION MODULE - Specil Products nd Fctoriztion 4 SPECIAL PRODUCTS AND FACTORIZATION In n erlier lesson you hve lernt multipliction of lgebric epressions, prticulrly polynomils. In the study of lgebr, we come

More information

PHY 140A: Solid State Physics. Solution to Homework #2

PHY 140A: Solid State Physics. Solution to Homework #2 PHY 140A: Solid Stte Physics Solution to Homework # TA: Xun Ji 1 October 14, 006 1 Emil: jixun@physics.ucl.edu Problem #1 Prove tht the reciprocl lttice for the reciprocl lttice is the originl lttice.

More information

Algebra Review. How well do you remember your algebra?

Algebra Review. How well do you remember your algebra? Algebr Review How well do you remember your lgebr? 1 The Order of Opertions Wht do we men when we write + 4? If we multiply we get 6 nd dding 4 gives 10. But, if we dd + 4 = 7 first, then multiply by then

More information

EQUATIONS OF LINES AND PLANES

EQUATIONS OF LINES AND PLANES EQUATIONS OF LINES AND PLANES MATH 195, SECTION 59 (VIPUL NAIK) Corresponding mteril in the ook: Section 12.5. Wht students should definitely get: Prmetric eqution of line given in point-direction nd twopoint

More information

4 Approximations. 4.1 Background. D. Levy

4 Approximations. 4.1 Background. D. Levy D. Levy 4 Approximtions 4.1 Bckground In this chpter we re interested in pproximtion problems. Generlly speking, strting from function f(x) we would like to find different function g(x) tht belongs to

More information

Use Geometry Expressions to create a more complex locus of points. Find evidence for equivalence using Geometry Expressions.

Use Geometry Expressions to create a more complex locus of points. Find evidence for equivalence using Geometry Expressions. Lerning Objectives Loci nd Conics Lesson 3: The Ellipse Level: Preclculus Time required: 120 minutes In this lesson, students will generlize their knowledge of the circle to the ellipse. The prmetric nd

More information

Vectors 2. 1. Recap of vectors

Vectors 2. 1. Recap of vectors Vectors 2. Recp of vectors Vectors re directed line segments - they cn be represented in component form or by direction nd mgnitude. We cn use trigonometry nd Pythgors theorem to switch between the forms

More information

Lecture 3 Gaussian Probability Distribution

Lecture 3 Gaussian Probability Distribution Lecture 3 Gussin Probbility Distribution Introduction l Gussin probbility distribution is perhps the most used distribution in ll of science. u lso clled bell shped curve or norml distribution l Unlike

More information

MODULE 3. 0, y = 0 for all y

MODULE 3. 0, y = 0 for all y Topics: Inner products MOULE 3 The inner product of two vectors: The inner product of two vectors x, y V, denoted by x, y is (in generl) complex vlued function which hs the following four properties: i)

More information

Operations with Polynomials

Operations with Polynomials 38 Chpter P Prerequisites P.4 Opertions with Polynomils Wht you should lern: Write polynomils in stndrd form nd identify the leding coefficients nd degrees of polynomils Add nd subtrct polynomils Multiply

More information

Novel Methods of Generating Self-Invertible Matrix for Hill Cipher Algorithm

Novel Methods of Generating Self-Invertible Matrix for Hill Cipher Algorithm Bibhudendr chry, Girij Snkr Rth, Srt Kumr Ptr, nd Sroj Kumr Pnigrhy Novel Methods of Generting Self-Invertible Mtrix for Hill Cipher lgorithm Bibhudendr chry Deprtment of Electronics & Communiction Engineering

More information

Java CUP. Java CUP Specifications. User Code Additions You may define Java code to be included within the generated parser:

Java CUP. Java CUP Specifications. User Code Additions You may define Java code to be included within the generated parser: Jv CUP Jv CUP is prser-genertion tool, similr to Ycc. CUP uilds Jv prser for LALR(1) grmmrs from production rules nd ssocited Jv code frgments. When prticulr production is recognized, its ssocited code

More information

Regular Languages and Finite Automata

Regular Languages and Finite Automata N Lecture Notes on Regulr Lnguges nd Finite Automt for Prt IA of the Computer Science Tripos Mrcelo Fiore Cmbridge University Computer Lbortory First Edition 1998. Revised 1999, 2000, 2001, 2002, 2003,

More information

One Minute To Learn Programming: Finite Automata

One Minute To Learn Programming: Finite Automata Gret Theoreticl Ides In Computer Science Steven Rudich CS 15-251 Spring 2005 Lecture 9 Fe 8 2005 Crnegie Mellon University One Minute To Lern Progrmming: Finite Automt Let me tech you progrmming lnguge

More information

Lecture 5. Inner Product

Lecture 5. Inner Product Lecture 5 Inner Product Let us strt with the following problem. Given point P R nd line L R, how cn we find the point on the line closest to P? Answer: Drw line segment from P meeting the line in right

More information

Or more simply put, when adding or subtracting quantities, their uncertainties add.

Or more simply put, when adding or subtracting quantities, their uncertainties add. Propgtion of Uncertint through Mthemticl Opertions Since the untit of interest in n eperiment is rrel otined mesuring tht untit directl, we must understnd how error propgtes when mthemticl opertions re

More information

Review guide for the final exam in Math 233

Review guide for the final exam in Math 233 Review guide for the finl exm in Mth 33 1 Bsic mteril. This review includes the reminder of the mteril for mth 33. The finl exm will be cumultive exm with mny of the problems coming from the mteril covered

More information

Small Business Networking

Small Business Networking Why network is n essentil productivity tool for ny smll business Effective technology is essentil for smll businesses looking to increse the productivity of their people nd business. Introducing technology

More information

RIGHT TRIANGLES AND THE PYTHAGOREAN TRIPLETS

RIGHT TRIANGLES AND THE PYTHAGOREAN TRIPLETS RIGHT TRIANGLES AND THE PYTHAGOREAN TRIPLETS Known for over 500 yers is the fct tht the sum of the squres of the legs of right tringle equls the squre of the hypotenuse. Tht is +b c. A simple proof is

More information

Graphs on Logarithmic and Semilogarithmic Paper

Graphs on Logarithmic and Semilogarithmic Paper 0CH_PHClter_TMSETE_ 3//00 :3 PM Pge Grphs on Logrithmic nd Semilogrithmic Pper OBJECTIVES When ou hve completed this chpter, ou should be ble to: Mke grphs on logrithmic nd semilogrithmic pper. Grph empiricl

More information

FUNCTIONS AND EQUATIONS. xεs. The simplest way to represent a set is by listing its members. We use the notation

FUNCTIONS AND EQUATIONS. xεs. The simplest way to represent a set is by listing its members. We use the notation FUNCTIONS AND EQUATIONS. SETS AND SUBSETS.. Definition of set. A set is ny collection of objects which re clled its elements. If x is n element of the set S, we sy tht x belongs to S nd write If y does

More information

A.7.1 Trigonometric interpretation of dot product... 324. A.7.2 Geometric interpretation of dot product... 324

A.7.1 Trigonometric interpretation of dot product... 324. A.7.2 Geometric interpretation of dot product... 324 A P P E N D I X A Vectors CONTENTS A.1 Scling vector................................................ 321 A.2 Unit or Direction vectors...................................... 321 A.3 Vector ddition.................................................

More information

Bayesian Updating with Continuous Priors Class 13, 18.05, Spring 2014 Jeremy Orloff and Jonathan Bloom

Bayesian Updating with Continuous Priors Class 13, 18.05, Spring 2014 Jeremy Orloff and Jonathan Bloom Byesin Updting with Continuous Priors Clss 3, 8.05, Spring 04 Jeremy Orloff nd Jonthn Bloom Lerning Gols. Understnd prmeterized fmily of distriutions s representing continuous rnge of hypotheses for the

More information

Small Business Networking

Small Business Networking Why network is n essentil productivity tool for ny smll business Effective technology is essentil for smll businesses looking to increse the productivity of their people nd business. Introducing technology

More information

Econ 4721 Money and Banking Problem Set 2 Answer Key

Econ 4721 Money and Banking Problem Set 2 Answer Key Econ 472 Money nd Bnking Problem Set 2 Answer Key Problem (35 points) Consider n overlpping genertions model in which consumers live for two periods. The number of people born in ech genertion grows in

More information

Factoring Polynomials

Factoring Polynomials Fctoring Polynomils Some definitions (not necessrily ll for secondry school mthemtics): A polynomil is the sum of one or more terms, in which ech term consists of product of constnt nd one or more vribles

More information

g(y(a), y(b)) = o, B a y(a)+b b y(b)=c, Boundary Value Problems Lecture Notes to Accompany

g(y(a), y(b)) = o, B a y(a)+b b y(b)=c, Boundary Value Problems Lecture Notes to Accompany Lecture Notes to Accompny Scientific Computing An Introductory Survey Second Edition by Michel T Heth Boundry Vlue Problems Side conditions prescribing solution or derivtive vlues t specified points required

More information

1.00/1.001 Introduction to Computers and Engineering Problem Solving Fall 2011 - Final Exam

1.00/1.001 Introduction to Computers and Engineering Problem Solving Fall 2011 - Final Exam 1./1.1 Introduction to Computers nd Engineering Problem Solving Fll 211 - Finl Exm Nme: MIT Emil: TA: Section: You hve 3 hours to complete this exm. In ll questions, you should ssume tht ll necessry pckges

More information

Learning Workflow Petri Nets

Learning Workflow Petri Nets Lerning Workflow Petri Nets Jvier Esprz, Mrtin Leucker, nd Mximilin Schlund Technische Universität München, Boltzmnnstr. 3, 85748 Grching, Germny {esprz,leucker,schlund}@in.tum.de Abstrct. Workflow mining

More information

Online Multicommodity Routing with Time Windows

Online Multicommodity Routing with Time Windows Konrd-Zuse-Zentrum für Informtionstechnik Berlin Tkustrße 7 D-14195 Berlin-Dhlem Germny TOBIAS HARKS 1 STEFAN HEINZ MARC E. PFETSCH TJARK VREDEVELD 2 Online Multicommodity Routing with Time Windows 1 Institute

More information

Small Business Networking

Small Business Networking Why network is n essentil productivity tool for ny smll business Effective technology is essentil for smll businesses looking to increse the productivity of their people nd processes. Introducing technology

More information

Math 135 Circles and Completing the Square Examples

Math 135 Circles and Completing the Square Examples Mth 135 Circles nd Completing the Squre Exmples A perfect squre is number such tht = b 2 for some rel number b. Some exmples of perfect squres re 4 = 2 2, 16 = 4 2, 169 = 13 2. We wish to hve method for

More information

The Velocity Factor of an Insulated Two-Wire Transmission Line

The Velocity Factor of an Insulated Two-Wire Transmission Line The Velocity Fctor of n Insulted Two-Wire Trnsmission Line Problem Kirk T. McDonld Joseph Henry Lbortories, Princeton University, Princeton, NJ 08544 Mrch 7, 008 Estimte the velocity fctor F = v/c nd the

More information

Generating In-Line Monitors For Rabin Automata

Generating In-Line Monitors For Rabin Automata Generting In-Line Monitors For Rin Automt Hugues Chot, Rphel Khoury, nd Ndi Twi Lvl University, Deprtment of Computer Science nd Softwre Engineering, Pvillon Adrien-Pouliot, 1065, venue de l Medecine Queec

More information

Assumption Generation for Software Component Verification

Assumption Generation for Software Component Verification Assumption Genertion for Softwre Component Verifiction Dimitr Ginnkopoulou Corin S. Păsărenu RIACS/USRA Kestrel Technologies LLC NASA Ames Reserch Center Moffett Field, CA 94035-1000, USA {dimitr, pcorin}@emil.rc.ns.gov

More information

6.2 Volumes of Revolution: The Disk Method

6.2 Volumes of Revolution: The Disk Method mth ppliction: volumes of revolution, prt ii Volumes of Revolution: The Disk Method One of the simplest pplictions of integrtion (Theorem ) nd the ccumultion process is to determine so-clled volumes of

More information

Data replication in mobile computing

Data replication in mobile computing Technicl Report, My 2010 Dt repliction in mobile computing Bchelor s Thesis in Electricl Engineering Rodrigo Christovm Pmplon HALMSTAD UNIVERSITY, IDE SCHOOL OF INFORMATION SCIENCE, COMPUTER AND ELECTRICAL

More information

Network Configuration Independence Mechanism

Network Configuration Independence Mechanism 3GPP TSG SA WG3 Security S3#19 S3-010323 3-6 July, 2001 Newbury, UK Source: Title: Document for: AT&T Wireless Network Configurtion Independence Mechnism Approvl 1 Introduction During the lst S3 meeting

More information

Appendix D: Completing the Square and the Quadratic Formula. In Appendix A, two special cases of expanding brackets were considered:

Appendix D: Completing the Square and the Quadratic Formula. In Appendix A, two special cases of expanding brackets were considered: Appendi D: Completing the Squre nd the Qudrtic Formul Fctoring qudrtic epressions such s: + 6 + 8 ws one of the topics introduced in Appendi C. Fctoring qudrtic epressions is useful skill tht cn help you

More information

AntiSpyware Enterprise Module 8.5

AntiSpyware Enterprise Module 8.5 AntiSpywre Enterprise Module 8.5 Product Guide Aout the AntiSpywre Enterprise Module The McAfee AntiSpywre Enterprise Module 8.5 is n dd-on to the VirusScn Enterprise 8.5i product tht extends its ility

More information

Lectures 8 and 9 1 Rectangular waveguides

Lectures 8 and 9 1 Rectangular waveguides 1 Lectures 8 nd 9 1 Rectngulr wveguides y b x z Consider rectngulr wveguide with 0 < x b. There re two types of wves in hollow wveguide with only one conductor; Trnsverse electric wves

More information

How To Network A Smll Business

How To Network A Smll Business Why network is n essentil productivity tool for ny smll business Effective technology is essentil for smll businesses looking to increse the productivity of their people nd processes. Introducing technology

More information

Euler Euler Everywhere Using the Euler-Lagrange Equation to Solve Calculus of Variation Problems

Euler Euler Everywhere Using the Euler-Lagrange Equation to Solve Calculus of Variation Problems Euler Euler Everywhere Using the Euler-Lgrnge Eqution to Solve Clculus of Vrition Problems Jenine Smllwood Principles of Anlysis Professor Flschk My 12, 1998 1 1. Introduction Clculus of vritions is brnch

More information

3 The Utility Maximization Problem

3 The Utility Maximization Problem 3 The Utility Mxiiztion Proble We hve now discussed how to describe preferences in ters of utility functions nd how to forulte siple budget sets. The rtionl choice ssuption, tht consuers pick the best

More information

Module Summary Sheets. C3, Methods for Advanced Mathematics (Version B reference to new book) Topic 2: Natural Logarithms and Exponentials

Module Summary Sheets. C3, Methods for Advanced Mathematics (Version B reference to new book) Topic 2: Natural Logarithms and Exponentials MEI Mthemtics in Ection nd Instry Topic : Proof MEI Structured Mthemtics Mole Summry Sheets C, Methods for Anced Mthemtics (Version B reference to new book) Topic : Nturl Logrithms nd Eponentils Topic

More information

INTERCHANGING TWO LIMITS. Zoran Kadelburg and Milosav M. Marjanović

INTERCHANGING TWO LIMITS. Zoran Kadelburg and Milosav M. Marjanović THE TEACHING OF MATHEMATICS 2005, Vol. VIII, 1, pp. 15 29 INTERCHANGING TWO LIMITS Zorn Kdelburg nd Milosv M. Mrjnović This pper is dedicted to the memory of our illustrious professor of nlysis Slobodn

More information

Section 5-4 Trigonometric Functions

Section 5-4 Trigonometric Functions 5- Trigonometric Functions Section 5- Trigonometric Functions Definition of the Trigonometric Functions Clcultor Evlution of Trigonometric Functions Definition of the Trigonometric Functions Alternte Form

More information

Experiment 6: Friction

Experiment 6: Friction Experiment 6: Friction In previous lbs we studied Newton s lws in n idel setting, tht is, one where friction nd ir resistnce were ignored. However, from our everydy experience with motion, we know tht

More information

Decision Rule Extraction from Trained Neural Networks Using Rough Sets

Decision Rule Extraction from Trained Neural Networks Using Rough Sets Decision Rule Extrction from Trined Neurl Networks Using Rough Sets Alin Lzr nd Ishwr K. Sethi Vision nd Neurl Networks Lbortory Deprtment of Computer Science Wyne Stte University Detroit, MI 48 ABSTRACT

More information

Helicopter Theme and Variations

Helicopter Theme and Variations Helicopter Theme nd Vritions Or, Some Experimentl Designs Employing Pper Helicopters Some possible explntory vribles re: Who drops the helicopter The length of the rotor bldes The height from which the

More information

2 DIODE CLIPPING and CLAMPING CIRCUITS

2 DIODE CLIPPING and CLAMPING CIRCUITS 2 DIODE CLIPPING nd CLAMPING CIRCUITS 2.1 Ojectives Understnding the operting principle of diode clipping circuit Understnding the operting principle of clmping circuit Understnding the wveform chnge of

More information

Small Business Networking

Small Business Networking Why network is n essentil productivity tool for ny smll business Effective technology is essentil for smll businesses looking to increse the productivity of their people nd processes. Introducing technology

More information

Solution to Problem Set 1

Solution to Problem Set 1 CSE 5: Introduction to the Theory o Computtion, Winter A. Hevi nd J. Mo Solution to Prolem Set Jnury, Solution to Prolem Set.4 ). L = {w w egin with nd end with }. q q q q, d). L = {w w h length t let

More information

. At first sight a! b seems an unwieldy formula but use of the following mnemonic will possibly help. a 1 a 2 a 3 a 1 a 2

. At first sight a! b seems an unwieldy formula but use of the following mnemonic will possibly help. a 1 a 2 a 3 a 1 a 2 7 CHAPTER THREE. Cross Product Given two vectors = (,, nd = (,, in R, the cross product of nd written! is defined to e: " = (!,!,! Note! clled cross is VECTOR (unlike which is sclr. Exmple (,, " (4,5,6

More information

SE3BB4: Software Design III Concurrent System Design. Sample Solutions to Assignment 1

SE3BB4: Software Design III Concurrent System Design. Sample Solutions to Assignment 1 SE3BB4: Softwre Design III Conurrent System Design Winter 2011 Smple Solutions to Assignment 1 Eh question is worth 10pts. Totl of this ssignment is 70pts. Eh ssignment is worth 9%. If you think your solution

More information

Model Checking for Software Architectures

Model Checking for Software Architectures Model Checking for Softwre Architectures position pper Rdu Mteescu INRIA Rhône-Alpes / VASY 655, venue de l Europe F-38330 Montbonnot Sint Mrtin http://www.inrilpes.fr/vsy 1 Outline Introduction Constructing

More information

AREA OF A SURFACE OF REVOLUTION

AREA OF A SURFACE OF REVOLUTION AREA OF A SURFACE OF REVOLUTION h cut r πr h A surfce of revolution is formed when curve is rotted bout line. Such surfce is the lterl boundr of solid of revolution of the tpe discussed in Sections 7.

More information

When Simulation Meets Antichains (on Checking Language Inclusion of NFAs)

When Simulation Meets Antichains (on Checking Language Inclusion of NFAs) When Simultion Meets Antichins (on Checking Lnguge Inclusion of NFAs) Prosh Aziz Abdull 1, Yu-Fng Chen 1, Lukáš Holík 2, Richrd Myr 3, nd Tomáš Vojnr 2 1 Uppsl University 2 Brno University of Technology

More information

How To Set Up A Network For Your Business

How To Set Up A Network For Your Business Why Network is n Essentil Productivity Tool for Any Smll Business TechAdvisory.org SME Reports sponsored by Effective technology is essentil for smll businesses looking to increse their productivity. Computer

More information

19. The Fermat-Euler Prime Number Theorem

19. The Fermat-Euler Prime Number Theorem 19. The Fermt-Euler Prime Number Theorem Every prime number of the form 4n 1 cn be written s sum of two squres in only one wy (side from the order of the summnds). This fmous theorem ws discovered bout

More information

Regular Repair of Specifications

Regular Repair of Specifications Regulr Repir of Specifictions Michel Benedikt Oxford University michel.enedikt@coml.ox.c.uk Griele Puppis Oxford University griele.puppis@coml.ox.c.uk Cristin Riveros Oxford University cristin.riveros@coml.ox.c.uk

More information

Hillsborough Township Public Schools Mathematics Department Computer Programming 1

Hillsborough Township Public Schools Mathematics Department Computer Programming 1 Essentil Unit 1 Introduction to Progrmming Pcing: 15 dys Common Unit Test Wht re the ethicl implictions for ming in tody s world? There re ethicl responsibilities to consider when writing computer s. Citizenship,

More information

CURVES ANDRÉ NEVES. that is, the curve α has finite length. v = p q p q. a i.e., the curve of smallest length connecting p to q is a straight line.

CURVES ANDRÉ NEVES. that is, the curve α has finite length. v = p q p q. a i.e., the curve of smallest length connecting p to q is a straight line. CURVES ANDRÉ NEVES 1. Problems (1) (Ex 1 of 1.3 of Do Crmo) Show tht the tngent line to the curve α(t) (3t, 3t 2, 2t 3 ) mkes constnt ngle with the line z x, y. (2) (Ex 6 of 1.3 of Do Crmo) Let α(t) (e

More information

Binary Representation of Numbers Autar Kaw

Binary Representation of Numbers Autar Kaw Binry Representtion of Numbers Autr Kw After reding this chpter, you should be ble to: 1. convert bse- rel number to its binry representtion,. convert binry number to n equivlent bse- number. In everydy

More information

Basic Analysis of Autarky and Free Trade Models

Basic Analysis of Autarky and Free Trade Models Bsic Anlysis of Autrky nd Free Trde Models AUTARKY Autrky condition in prticulr commodity mrket refers to sitution in which country does not engge in ny trde in tht commodity with other countries. Consequently

More information

FAULT TREES AND RELIABILITY BLOCK DIAGRAMS. Harry G. Kwatny. Department of Mechanical Engineering & Mechanics Drexel University

FAULT TREES AND RELIABILITY BLOCK DIAGRAMS. Harry G. Kwatny. Department of Mechanical Engineering & Mechanics Drexel University SYSTEM FAULT AND Hrry G. Kwtny Deprtment of Mechnicl Engineering & Mechnics Drexel University OUTLINE SYSTEM RBD Definition RBDs nd Fult Trees System Structure Structure Functions Pths nd Cutsets Reliility

More information

QUADRATURE METHODS. July 19, 2011. Kenneth L. Judd. Hoover Institution

QUADRATURE METHODS. July 19, 2011. Kenneth L. Judd. Hoover Institution QUADRATURE METHODS Kenneth L. Judd Hoover Institution July 19, 2011 1 Integrtion Most integrls cnnot be evluted nlyticlly Integrls frequently rise in economics Expected utility Discounted utility nd profits

More information

In-circuit temporal monitors for runtime verification of reconfigurable designs

In-circuit temporal monitors for runtime verification of reconfigurable designs In-circuit temporl monitors for runtime verifiction of reconfigurble designs Tim Todmn Deprtment of Computing Imperil College London tephn tilkerich Airbus Group Innovtions Willy-Messerschmitt tr., Wyne

More information

On the degrees of freedom in GR

On the degrees of freedom in GR On the degrees of freedom in GR István Rácz Wigner RCP Budpest rcz.istvn@wigner.mt.hu University of the Bsque Country Bilbo, 27 My, 2015 István Rácz (Wigner RCP, Budpest) degrees of freedom 27 My, 2015

More information

The Semantics of Graph Programs

The Semantics of Graph Programs The Semntics of Grph Progrms Detlef Plump Deprtment of Computer Science The University of York, UK Sndr Steinert Deprtment of Computer Science The University of York, UK GP (for Grph Progrms) is rule-bsed,

More information

Optiml Control of Seril, Multi-Echelon Inventory (E&I) & Mixed Erlng demnds

Optiml Control of Seril, Multi-Echelon Inventory (E&I) & Mixed Erlng demnds Optiml Control of Seril, Multi-Echelon Inventory/Production Systems with Periodic Btching Geert-Jn vn Houtum Deprtment of Technology Mngement, Technische Universiteit Eindhoven, P.O. Box 513, 56 MB, Eindhoven,

More information

Orthogonally modeling video structuration and annotation: exploiting the concept of granularity

Orthogonally modeling video structuration and annotation: exploiting the concept of granularity From: I Technicl Report WS-00-08. Compiltion copyright 2000, I (www.i.org). ll rights reserved. Orthogonlly modeling video structurtion nd nnottion: exploiting the concept of grnulrity M. Dums, R. Lozno,M.-C.Fuvet,H.MrtinndP.-C.Scholl

More information

#A12 INTEGERS 13 (2013) THE DISTRIBUTION OF SOLUTIONS TO XY = N (MOD A) WITH AN APPLICATION TO FACTORING INTEGERS

#A12 INTEGERS 13 (2013) THE DISTRIBUTION OF SOLUTIONS TO XY = N (MOD A) WITH AN APPLICATION TO FACTORING INTEGERS #A1 INTEGERS 13 (013) THE DISTRIBUTION OF SOLUTIONS TO XY = N (MOD A) WITH AN APPLICATION TO FACTORING INTEGERS Michel O. Rubinstein 1 Pure Mthemtics, University of Wterloo, Wterloo, Ontrio, Cnd mrubinst@uwterloo.c

More information

Learning to Search Better than Your Teacher

Learning to Search Better than Your Teacher Ki-Wei Chng University of Illinois t Urbn Chmpign, IL Akshy Krishnmurthy Crnegie Mellon University, Pittsburgh, PA Alekh Agrwl Microsoft Reserch, New York, NY Hl Dumé III University of Mrylnd, College

More information