"Computation Tree Logic"@de . . . . . "L\u00F3gica de \u00C1rvore de Computa\u00E7\u00E3o (LAC) \u00E9 uma ramifica\u00E7\u00E3o-temporal da L\u00F3gica, significando que seu modelo de tempo \u00E9 como a estrutura \u00E1rvore no qual o futuro n\u00E3o \u00E9 determinado. N\u00E3o tem caminhos diferentes no futuro, qualquer um deles pode ser um caminho atual que \u00E9 realizado. \u00C9 usado na verifica\u00E7\u00E3o formal de artefatos de software ou hardware, tipicamente por aplica\u00E7\u00F5es de software conhecidas como verificadores de modelos que determina se um dado artefato possui propriedades de seguran\u00E7a ou liveness. Por exemplo, ALC pode especificar que quando alguma condi\u00E7\u00E3o inicial \u00E9 satisfeita (ex: todas as vari\u00E1veis do programa s\u00E3o positivas ou n\u00E3o h\u00E1 carros na estrada que escarrancham duas pistas ), ent\u00E3o todas as poss\u00EDveis execu\u00E7\u00F5es do programa evitam alguma condi\u00E7\u00E3o indesej\u00E1vel (ex: dividir um n\u00FAmero por zero ou o a colis\u00E3o de dois carros na estrada) . Neste exemplo, a propriedade de seguran\u00E7a pode ser verificada por um modelo verificador que explora todas as possibilidades de transa\u00E7\u00F5es para fora de um programa de estados satisfazendo a condi\u00E7\u00E3o inicial que garante que todos as execu\u00E7\u00F5es satisfazem esta propriedade. \u00C1rvore L\u00F3gica Computacional est\u00E1 na classe de L\u00F3gica temporal que inclui L\u00F3gica Temporal (LLT). Embora aqui existam propriedades express\u00E1veis em apenas uma das ALC ou LLT, todas as propriedades em ambas as l\u00F3gicas podem ser expressas em ."@pt . . . "L\u00F3gica de \u00C1rvore de Computa\u00E7\u00E3o"@pt . . "\u8A08\u7B97\u6728\u8AD6\u7406\uFF08\u3051\u3044\u3055\u3093\u304D\u308D\u3093\u308A\u3001Computational Tree Logic\u3001CTL\uFF09\u306F\u3001\u5206\u5C90\u6642\u76F8\u8AD6\u7406\u306E\u4E00\u7A2E\u3067\u3042\u308B\u3002\u305D\u306E\u6642\u9593\u30E2\u30C7\u30EB\u3067\u306F\u672A\u6765\u306F\u6C7A\u5B9A\u3055\u308C\u3066\u304A\u3089\u305A\u6728\u69CB\u9020\u306E\u3088\u3046\u306B\u5206\u5C90\u3057\u3066\u3044\u308B\u3002\u672A\u6765\u306E\u8907\u6570\u306E\u7D4C\u8DEF\u306E\u3046\u3061\u306E1\u3064\u304C\u5B9F\u969B\u306B\u73FE\u5B9F\u306E\u7D4C\u8DEF\u3068\u306A\u308B\u3002"@ja . . . "\u8A08\u7B97\u6728\u8AD6\u7406\uFF08\u3051\u3044\u3055\u3093\u304D\u308D\u3093\u308A\u3001Computational Tree Logic\u3001CTL\uFF09\u306F\u3001\u5206\u5C90\u6642\u76F8\u8AD6\u7406\u306E\u4E00\u7A2E\u3067\u3042\u308B\u3002\u305D\u306E\u6642\u9593\u30E2\u30C7\u30EB\u3067\u306F\u672A\u6765\u306F\u6C7A\u5B9A\u3055\u308C\u3066\u304A\u3089\u305A\u6728\u69CB\u9020\u306E\u3088\u3046\u306B\u5206\u5C90\u3057\u3066\u3044\u308B\u3002\u672A\u6765\u306E\u8907\u6570\u306E\u7D4C\u8DEF\u306E\u3046\u3061\u306E1\u3064\u304C\u5B9F\u969B\u306B\u73FE\u5B9F\u306E\u7D4C\u8DEF\u3068\u306A\u308B\u3002"@ja . . . . . . . . . "Logika CTL"@pl . . . . . . . . . . "Logika CTL \u2013 jedna z logik temporalnych. Jest oparta na liniowej strukturze czasu."@pl . . . . "\uACC4\uC0B0 \uD2B8\uB9AC \uB17C\uB9AC"@ko . . . "\u0397 \u03BB\u03BF\u03B3\u03B9\u03BA\u03AE \u03C5\u03C0\u03BF\u03BB\u03BF\u03B3\u03B9\u03C3\u03C4\u03B9\u03BA\u03BF\u03CD \u03B4\u03AD\u03BD\u03B4\u03C1\u03BF\u03C5 (Computation tree logic, CTL) \u03B5\u03AF\u03BD\u03B1\u03B9 \u03BC\u03B9\u03B1 \u03BB\u03BF\u03B3\u03B9\u03BA\u03AE \u03B4\u03B9\u03B1\u03BA\u03BB\u03B1\u03B4\u03B9\u03B6\u03CC\u03BC\u03B5\u03BD\u03BF\u03C5 \u03C7\u03C1\u03CC\u03BD\u03BF\u03C5 (branching-time), \u03C4\u03BF \u03BF\u03C0\u03BF\u03AF\u03BF \u03C3\u03B7\u03BC\u03B1\u03AF\u03BD\u03B5\u03B9 \u03CC\u03C4\u03B9 \u03C4\u03BF \u03BC\u03BF\u03BD\u03C4\u03AD\u03BB\u03BF \u03C4\u03B7\u03C2 \u03B3\u03B9\u03B1 \u03C4\u03BF \u03C7\u03C1\u03CC\u03BD\u03BF \u03B5\u03AF\u03BD\u03B1\u03B9 \u03BC\u03B9\u03B1 \u03B4\u03B5\u03BD\u03B4\u03C1\u03B9\u03BA\u03AE \u03B4\u03BF\u03BC\u03AE, \u03C3\u03C4\u03B7\u03BD \u03BF\u03C0\u03BF\u03AF\u03B1 \u03C4\u03BF \u03BC\u03AD\u03BB\u03BB\u03BF\u03BD \u03B4\u03B5\u03BD \u03AD\u03C7\u03B5\u03B9 \u03BF\u03C1\u03B9\u03C3\u03C4\u03B5\u03AF \u03B1\u03BB\u03BB\u03AC \u03C5\u03C0\u03AC\u03C1\u03C7\u03BF\u03C5\u03BD \u03B4\u03B9\u03B1\u03C6\u03BF\u03C1\u03B5\u03C4\u03B9\u03BA\u03AC \u03BC\u03BF\u03BD\u03BF\u03C0\u03AC\u03C4\u03B9\u03B1 \u03C3\u03B5 \u03B1\u03C5\u03C4\u03CC \u03BA\u03B1\u03B9 \u03BA\u03AC\u03B8\u03B5 \u03AD\u03BD\u03B1 \u03B1\u03C0\u03CC \u03B1\u03C5\u03C4\u03AC \u03C4\u03B1 \u03BC\u03BF\u03BD\u03BF\u03C0\u03AC\u03C4\u03B9\u03B1 \u03BC\u03C0\u03BF\u03C1\u03B5\u03AF \u03BD\u03B1 \u03B5\u03AF\u03BD\u03B1\u03B9 \u03AD\u03BD\u03B1 \u03BC\u03BF\u03BD\u03BF\u03C0\u03AC\u03C4\u03B9 \u03C0\u03BF\u03C5 \u03B8\u03B1 \u03C0\u03C1\u03B1\u03B3\u03BC\u03B1\u03C4\u03BF\u03C0\u03BF\u03B9\u03B7\u03B8\u03B5\u03AF. \u03A7\u03C1\u03B7\u03C3\u03B9\u03BC\u03BF\u03C0\u03BF\u03B9\u03B5\u03AF\u03C4\u03B1\u03B9 \u03C3\u03C4\u03B7\u03BD \u03C4\u03C5\u03C0\u03B9\u03BA\u03AE \u03B5\u03C0\u03B1\u03BB\u03AE\u03B8\u03B5\u03C5\u03C3\u03B7 \u03BB\u03BF\u03B3\u03B9\u03C3\u03BC\u03B9\u03BA\u03BF\u03CD \u03AE \u03C5\u03BB\u03B9\u03BA\u03BF\u03CD, \u03C3\u03C5\u03BD\u03AE\u03B8\u03C9\u03C2 \u03B1\u03C0\u03CC \u03BB\u03BF\u03B3\u03B9\u03C3\u03BC\u03B9\u03BA\u03CC \u03C0\u03BF\u03C5 \u03BF\u03BD\u03BF\u03BC\u03AC\u03B6\u03B5\u03C4\u03B1\u03B9 \u03B5\u03BB\u03B5\u03B3\u03BA\u03C4\u03AE\u03C2 \u03BC\u03BF\u03BD\u03C4\u03AD\u03BB\u03C9\u03BD. \u03A4\u03BF \u03BB\u03BF\u03B3\u03B9\u03C3\u03BC\u03B9\u03BA\u03CC \u03B1\u03C5\u03C4\u03CC \u03C0\u03C1\u03BF\u03C3\u03B4\u03B9\u03BF\u03C1\u03AF\u03B6\u03B5\u03B9 \u03B1\u03BD \u03C4\u03BF \u03BB\u03BF\u03B3\u03B9\u03C3\u03BC\u03B9\u03BA\u03CC \u03AE \u03C4\u03BF \u03C5\u03BB\u03B9\u03BA\u03CC \u03C0\u03BF\u03C5 \u03B5\u03BB\u03AD\u03B3\u03C7\u03B5\u03C4\u03B1\u03B9 \u03AD\u03C7\u03B5\u03B9 \u03BA\u03AC\u03C0\u03BF\u03B9\u03B5\u03C2 \u03C3\u03C5\u03B3\u03BA\u03B5\u03BA\u03C1\u03B9\u03BC\u03AD\u03BD\u03B5\u03C2 \u03B9\u03B4\u03B9\u03CC\u03C4\u03B7\u03C4\u03B5\u03C2 \u03B1\u03C3\u03C6\u03AC\u03BB\u03B5\u03B9\u03B1\u03C2 (safety) \u03AE \u03B6\u03C9\u03C4\u03B9\u03BA\u03CC\u03C4\u03B7\u03C4\u03B1\u03C2 (liveness). \u0391\u03BD\u03AE\u03BA\u03B5\u03B9 \u03C3\u03C4\u03B7\u03BD \u03BA\u03B1\u03C4\u03B7\u03B3\u03BF\u03C1\u03AF\u03B1 \u03C4\u03C9\u03BD \u03C7\u03C1\u03BF\u03BD\u03B9\u03BA\u03CE\u03BD \u03BB\u03BF\u03B3\u03B9\u03BA\u03CE\u03BD, \u03CC\u03C0\u03C9\u03C2 \u03BA\u03B1\u03B9 \u03B7 \u03B3\u03C1\u03B1\u03BC\u03BC\u03B9\u03BA\u03AE \u03C7\u03C1\u03BF\u03BD\u03B9\u03BA\u03AE \u03BB\u03BF\u03B3\u03B9\u03BA\u03AE."@el . . "\u039B\u03BF\u03B3\u03B9\u03BA\u03AE \u03C5\u03C0\u03BF\u03BB\u03BF\u03B3\u03B9\u03C3\u03C4\u03B9\u03BA\u03BF\u03CD \u03B4\u03AD\u03BD\u03B4\u03C1\u03BF\u03C5"@el . . . . "Die Computation Tree Logic (kurz CTL) ist eine Temporale Logik, deren Modell der Zeit eine baumartige Struktur hat. Die zeitliche \u00C4nderung von Zust\u00E4nden und deren Eigenschaften wird durch Pfade innerhalb dieser Baumstruktur modelliert. Hierbei hat die Zukunft mehrere Pfade, wobei nicht festgelegt ist, welche letztendlich realisiert werden. Demnach k\u00F6nnen Aussagen \u00FCber die m\u00F6gliche Entwicklungen getroffen werden. Die CTL wird zur Verifikation von Hard- und Software verwendet, \u00FCblicherweise von Model Checkern. Zu der Familie der temporalen Logiken geh\u00F6rt auch die Linear temporale Logik (LTL), wobei hier nur eine Zukunft m\u00F6glich ist. Eine Verallgemeinerung der beiden Logiken wird als CTL* bezeichnet."@de . "Computation tree logic"@en . . . . "\u8A08\u7B97\u6728\u8AD6\u7406"@ja . . "Die Computation Tree Logic (kurz CTL) ist eine Temporale Logik, deren Modell der Zeit eine baumartige Struktur hat. Die zeitliche \u00C4nderung von Zust\u00E4nden und deren Eigenschaften wird durch Pfade innerhalb dieser Baumstruktur modelliert. Hierbei hat die Zukunft mehrere Pfade, wobei nicht festgelegt ist, welche letztendlich realisiert werden. Demnach k\u00F6nnen Aussagen \u00FCber die m\u00F6gliche Entwicklungen getroffen werden. Die CTL wird zur Verifikation von Hard- und Software verwendet, \u00FCblicherweise von Model Checkern."@de . "L\u00F3gica de \u00C1rvore de Computa\u00E7\u00E3o (LAC) \u00E9 uma ramifica\u00E7\u00E3o-temporal da L\u00F3gica, significando que seu modelo de tempo \u00E9 como a estrutura \u00E1rvore no qual o futuro n\u00E3o \u00E9 determinado. N\u00E3o tem caminhos diferentes no futuro, qualquer um deles pode ser um caminho atual que \u00E9 realizado. \u00C9 usado na verifica\u00E7\u00E3o formal de artefatos de software ou hardware, tipicamente por aplica\u00E7\u00F5es de software conhecidas como verificadores de modelos que determina se um dado artefato possui propriedades de seguran\u00E7a ou liveness. Por exemplo, LAC pode especificar que quando alguma condi\u00E7\u00E3o inicial \u00E9 satisfeita (ex: todas as vari\u00E1veis do programa s\u00E3o positivas ou n\u00E3o h\u00E1 carros na estrada que escarrancham duas pistas ), ent\u00E3o todas as poss\u00EDveis execu\u00E7\u00F5es do programa evitam alguma condi\u00E7\u00E3o indesej\u00E1vel (ex: dividir um n\u00FAmero por zero ou o a colis\u00E3o de dois carros na estrada) . Neste exemplo, a propriedade de seguran\u00E7a pode ser verificada por um modelo verificador que explora todas as possibilidades de transa\u00E7\u00F5es para fora de um programa de estados satisfazendo a condi\u00E7\u00E3o inicial que garante que todos as execu\u00E7\u00F5es satisfazem esta propriedade. L\u00F3gica de \u00C1rvore de Computa\u00E7\u00E3o est\u00E1 na classe de L\u00F3gica temporal que inclui L\u00F3gica Temporal (LLT). Embora aqui existam propriedades express\u00E1veis em apenas uma das LAC ou LLT, todas as propriedades em ambas as l\u00F3gicas podem ser expressas em ."@pt . . . "840894"^^ . . . . . . "Computation tree logic (CTL) is a branching-time logic, meaning that its model of time is a tree-like structure in which the future is not determined; there are different paths in the future, any one of which might be an actual path that is realized. It is used in formal verification of software or hardware artifacts, typically by software applications known as model checkers, which determine if a given artifact possesses safety or liveness properties. For example, CTL can specify that when some initial condition is satisfied (e.g., all program variables are positive or no cars on a highway straddle two lanes), then all possible executions of a program avoid some undesirable condition (e.g., dividing a number by zero or two cars colliding on a highway). In this example, the safety property"@en . . "L\u00F3gica de \u00C1rvore de Computa\u00E7\u00E3o (LAC) \u00E9 uma ramifica\u00E7\u00E3o-temporal da L\u00F3gica, significando que seu modelo de tempo \u00E9 como a estrutura \u00E1rvore no qual o futuro n\u00E3o \u00E9 determinado. N\u00E3o tem caminhos diferentes no futuro, qualquer um deles pode ser um caminho atual que \u00E9 realizado. \u00C9 usado na verifica\u00E7\u00E3o formal de artefatos de software ou hardware, tipicamente por aplica\u00E7\u00F5es de software conhecidas como verificadores de modelos que determina se um dado artefato possui propriedades de seguran\u00E7a ou liveness. Por exemplo, LAC pode especificar que quando alguma condi\u00E7\u00E3o inicial \u00E9 satisfeita (ex: todas as vari\u00E1veis do programa s\u00E3o positivas ou n\u00E3o h\u00E1 carros na estrada que escarrancham duas pistas ), ent\u00E3o todas as poss\u00EDveis execu\u00E7\u00F5es do programa evitam alguma condi\u00E7\u00E3o indesej\u00E1vel (ex: dividir um n\u00FAmero p"@pt . "Logika CTL \u2013 jedna z logik temporalnych. Jest oparta na liniowej strukturze czasu."@pl . "\uACC4\uC0B0 \uD2B8\uB9AC \uB17C\uB9AC \uB610\uB294 \uACC4\uC0B0 \uB098\uBB34 \uB17C\uB9AC(Computational Tree Logic, CTL)\uC740 \uC758 \uD55C \uC885\uB958\uB85C, \uC5B4\uB5A4 \uC0C1\uD0DC\uC5D0\uC11C \uC2E4\uD589\uC774 \uAC00\uB2A5\uD55C \uC0C1\uD0DC\uB85C\uC758 \uACBD\uB85C\uB97C \uD2B8\uB9AC \uAD6C\uC870\uB85C \uC804\uAC1C\uD55C \uACB0\uACFC\uC778 \uACC4\uC0B0 \uD2B8\uB9AC\uC640 \uC758\uBBF8\uB860\uC774 \uC815\uC758\uB41C \uB17C\uB9AC \uCCB4\uACC4\uC774\uB2E4. CTL\uC5D0\uC11C\uB294 \uC5D0\uC11C \uC0AC\uC6A9\uB418\uB294 \uC2DC\uAC04 \uC5F0\uC0B0\uC790\uC778 F, G, X, U, R \uC678\uC5D0 '\uBAA8\uB4E0 \uC2E4\uD589 \uAC00\uB2A5\uD55C \uACBD\uB85C\uC5D0 \uB300\uD574'\uB97C \uC758\uBBF8\uD558\uB294 A, '\uC5B4\uB5A4 \uC2E4\uD589\uAC00\uB2A5\uD55C \uACBD\uB85C\uC5D0 \uB300\uD574'\uB97C \uC758\uBBF8\uD558\uB294 E\uAC00 \uD3EC\uD568\uB418\uC5B4 \uC0AC\uC6A9\uB41C\uB2E4."@ko . . . "L\u00F3gica de \u00C1rvore de Computa\u00E7\u00E3o (LAC) \u00E9 uma ramifica\u00E7\u00E3o-temporal da L\u00F3gica, significando que seu modelo de tempo \u00E9 como a estrutura \u00E1rvore no qual o futuro n\u00E3o \u00E9 determinado. N\u00E3o tem caminhos diferentes no futuro, qualquer um deles pode ser um caminho atual que \u00E9 realizado. \u00C9 usado na verifica\u00E7\u00E3o formal de artefatos de software ou hardware, tipicamente por aplica\u00E7\u00F5es de software conhecidas como verificadores de modelos que determina se um dado artefato possui propriedades de seguran\u00E7a ou liveness. Por exemplo, ALC pode especificar que quando alguma condi\u00E7\u00E3o inicial \u00E9 satisfeita (ex: todas as vari\u00E1veis do programa s\u00E3o positivas ou n\u00E3o h\u00E1 carros na estrada que escarrancham duas pistas ), ent\u00E3o todas as poss\u00EDveis execu\u00E7\u00F5es do programa evitam alguma condi\u00E7\u00E3o indesej\u00E1vel (ex: dividir um n\u00FAmero p"@pt . . . "\uACC4\uC0B0 \uD2B8\uB9AC \uB17C\uB9AC \uB610\uB294 \uACC4\uC0B0 \uB098\uBB34 \uB17C\uB9AC(Computational Tree Logic, CTL)\uC740 \uC758 \uD55C \uC885\uB958\uB85C, \uC5B4\uB5A4 \uC0C1\uD0DC\uC5D0\uC11C \uC2E4\uD589\uC774 \uAC00\uB2A5\uD55C \uC0C1\uD0DC\uB85C\uC758 \uACBD\uB85C\uB97C \uD2B8\uB9AC \uAD6C\uC870\uB85C \uC804\uAC1C\uD55C \uACB0\uACFC\uC778 \uACC4\uC0B0 \uD2B8\uB9AC\uC640 \uC758\uBBF8\uB860\uC774 \uC815\uC758\uB41C \uB17C\uB9AC \uCCB4\uACC4\uC774\uB2E4. CTL\uC5D0\uC11C\uB294 \uC5D0\uC11C \uC0AC\uC6A9\uB418\uB294 \uC2DC\uAC04 \uC5F0\uC0B0\uC790\uC778 F, G, X, U, R \uC678\uC5D0 '\uBAA8\uB4E0 \uC2E4\uD589 \uAC00\uB2A5\uD55C \uACBD\uB85C\uC5D0 \uB300\uD574'\uB97C \uC758\uBBF8\uD558\uB294 A, '\uC5B4\uB5A4 \uC2E4\uD589\uAC00\uB2A5\uD55C \uACBD\uB85C\uC5D0 \uB300\uD574'\uB97C \uC758\uBBF8\uD558\uB294 E\uAC00 \uD3EC\uD568\uB418\uC5B4 \uC0AC\uC6A9\uB41C\uB2E4."@ko . "1113052654"^^ . . "Computation tree logic (CTL) is a branching-time logic, meaning that its model of time is a tree-like structure in which the future is not determined; there are different paths in the future, any one of which might be an actual path that is realized. It is used in formal verification of software or hardware artifacts, typically by software applications known as model checkers, which determine if a given artifact possesses safety or liveness properties. For example, CTL can specify that when some initial condition is satisfied (e.g., all program variables are positive or no cars on a highway straddle two lanes), then all possible executions of a program avoid some undesirable condition (e.g., dividing a number by zero or two cars colliding on a highway). In this example, the safety property could be verified by a model checker that explores all possible transitions out of program states satisfying the initial condition and ensures that all such executions satisfy the property. Computation tree logic belongs to a class of temporal logics that includes linear temporal logic (LTL). Although there are properties expressible only in CTL and properties expressible only in LTL, all properties expressible in either logic can also be expressed in CTL*. CTL was first proposed by Edmund M. Clarke and E. Allen Emerson in 1981, who used it to synthesize so-called synchronisation skeletons, i.e abstractions of concurrent programs."@en . . "\u0397 \u03BB\u03BF\u03B3\u03B9\u03BA\u03AE \u03C5\u03C0\u03BF\u03BB\u03BF\u03B3\u03B9\u03C3\u03C4\u03B9\u03BA\u03BF\u03CD \u03B4\u03AD\u03BD\u03B4\u03C1\u03BF\u03C5 (Computation tree logic, CTL) \u03B5\u03AF\u03BD\u03B1\u03B9 \u03BC\u03B9\u03B1 \u03BB\u03BF\u03B3\u03B9\u03BA\u03AE \u03B4\u03B9\u03B1\u03BA\u03BB\u03B1\u03B4\u03B9\u03B6\u03CC\u03BC\u03B5\u03BD\u03BF\u03C5 \u03C7\u03C1\u03CC\u03BD\u03BF\u03C5 (branching-time), \u03C4\u03BF \u03BF\u03C0\u03BF\u03AF\u03BF \u03C3\u03B7\u03BC\u03B1\u03AF\u03BD\u03B5\u03B9 \u03CC\u03C4\u03B9 \u03C4\u03BF \u03BC\u03BF\u03BD\u03C4\u03AD\u03BB\u03BF \u03C4\u03B7\u03C2 \u03B3\u03B9\u03B1 \u03C4\u03BF \u03C7\u03C1\u03CC\u03BD\u03BF \u03B5\u03AF\u03BD\u03B1\u03B9 \u03BC\u03B9\u03B1 \u03B4\u03B5\u03BD\u03B4\u03C1\u03B9\u03BA\u03AE \u03B4\u03BF\u03BC\u03AE, \u03C3\u03C4\u03B7\u03BD \u03BF\u03C0\u03BF\u03AF\u03B1 \u03C4\u03BF \u03BC\u03AD\u03BB\u03BB\u03BF\u03BD \u03B4\u03B5\u03BD \u03AD\u03C7\u03B5\u03B9 \u03BF\u03C1\u03B9\u03C3\u03C4\u03B5\u03AF \u03B1\u03BB\u03BB\u03AC \u03C5\u03C0\u03AC\u03C1\u03C7\u03BF\u03C5\u03BD \u03B4\u03B9\u03B1\u03C6\u03BF\u03C1\u03B5\u03C4\u03B9\u03BA\u03AC \u03BC\u03BF\u03BD\u03BF\u03C0\u03AC\u03C4\u03B9\u03B1 \u03C3\u03B5 \u03B1\u03C5\u03C4\u03CC \u03BA\u03B1\u03B9 \u03BA\u03AC\u03B8\u03B5 \u03AD\u03BD\u03B1 \u03B1\u03C0\u03CC \u03B1\u03C5\u03C4\u03AC \u03C4\u03B1 \u03BC\u03BF\u03BD\u03BF\u03C0\u03AC\u03C4\u03B9\u03B1 \u03BC\u03C0\u03BF\u03C1\u03B5\u03AF \u03BD\u03B1 \u03B5\u03AF\u03BD\u03B1\u03B9 \u03AD\u03BD\u03B1 \u03BC\u03BF\u03BD\u03BF\u03C0\u03AC\u03C4\u03B9 \u03C0\u03BF\u03C5 \u03B8\u03B1 \u03C0\u03C1\u03B1\u03B3\u03BC\u03B1\u03C4\u03BF\u03C0\u03BF\u03B9\u03B7\u03B8\u03B5\u03AF. \u03A7\u03C1\u03B7\u03C3\u03B9\u03BC\u03BF\u03C0\u03BF\u03B9\u03B5\u03AF\u03C4\u03B1\u03B9 \u03C3\u03C4\u03B7\u03BD \u03C4\u03C5\u03C0\u03B9\u03BA\u03AE \u03B5\u03C0\u03B1\u03BB\u03AE\u03B8\u03B5\u03C5\u03C3\u03B7 \u03BB\u03BF\u03B3\u03B9\u03C3\u03BC\u03B9\u03BA\u03BF\u03CD \u03AE \u03C5\u03BB\u03B9\u03BA\u03BF\u03CD, \u03C3\u03C5\u03BD\u03AE\u03B8\u03C9\u03C2 \u03B1\u03C0\u03CC \u03BB\u03BF\u03B3\u03B9\u03C3\u03BC\u03B9\u03BA\u03CC \u03C0\u03BF\u03C5 \u03BF\u03BD\u03BF\u03BC\u03AC\u03B6\u03B5\u03C4\u03B1\u03B9 \u03B5\u03BB\u03B5\u03B3\u03BA\u03C4\u03AE\u03C2 \u03BC\u03BF\u03BD\u03C4\u03AD\u03BB\u03C9\u03BD. \u03A4\u03BF \u03BB\u03BF\u03B3\u03B9\u03C3\u03BC\u03B9\u03BA\u03CC \u03B1\u03C5\u03C4\u03CC \u03C0\u03C1\u03BF\u03C3\u03B4\u03B9\u03BF\u03C1\u03AF\u03B6\u03B5\u03B9 \u03B1\u03BD \u03C4\u03BF \u03BB\u03BF\u03B3\u03B9\u03C3\u03BC\u03B9\u03BA\u03CC \u03AE \u03C4\u03BF \u03C5\u03BB\u03B9\u03BA\u03CC \u03C0\u03BF\u03C5 \u03B5\u03BB\u03AD\u03B3\u03C7\u03B5\u03C4\u03B1\u03B9 \u03AD\u03C7\u03B5\u03B9 \u03BA\u03AC\u03C0\u03BF\u03B9\u03B5\u03C2 \u03C3\u03C5\u03B3\u03BA\u03B5\u03BA\u03C1\u03B9\u03BC\u03AD\u03BD\u03B5\u03C2 \u03B9\u03B4\u03B9\u03CC\u03C4\u03B7\u03C4\u03B5\u03C2 \u03B1\u03C3\u03C6\u03AC\u03BB\u03B5\u03B9\u03B1\u03C2 (safety) \u03AE \u03B6\u03C9\u03C4\u03B9\u03BA\u03CC\u03C4\u03B7\u03C4\u03B1\u03C2 (liveness). \u0391\u03BD\u03AE\u03BA\u03B5\u03B9 \u03C3\u03C4\u03B7\u03BD \u03BA\u03B1\u03C4\u03B7\u03B3\u03BF\u03C1\u03AF\u03B1 \u03C4\u03C9\u03BD \u03C7\u03C1\u03BF\u03BD\u03B9\u03BA\u03CE\u03BD \u03BB\u03BF\u03B3\u03B9\u03BA\u03CE\u03BD, \u03CC\u03C0\u03C9\u03C2 \u03BA\u03B1\u03B9 \u03B7 \u03B3\u03C1\u03B1\u03BC\u03BC\u03B9\u03BA\u03AE \u03C7\u03C1\u03BF\u03BD\u03B9\u03BA\u03AE \u03BB\u03BF\u03B3\u03B9\u03BA\u03AE."@el . . . . . . "\u00C1rvore L\u00F3gica Computacional"@pt . . . "17529"^^ . .