Probabilistic verification and approximation
We study the existence of efficient approximation methods to verify quantitative specifications of probabilistic systems. Models of such systems are labelled discrete time Markov chains and checking specifications consists of computing satisfaction probabilities of linear temporal logic formulas. We...
Gespeichert in:
| Veröffentlicht in: | Annals of pure and applied logic Jg. 152; H. 1; S. 122 - 131 |
|---|---|
| Hauptverfasser: | , |
| Format: | Journal Article |
| Sprache: | Englisch |
| Veröffentlicht: |
Elsevier B.V
01.03.2008
|
| Schlagworte: | |
| ISSN: | 0168-0072 |
| Online-Zugang: | Volltext |
| Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
| Abstract | We study the existence of efficient approximation methods to verify quantitative specifications of probabilistic systems. Models of such systems are labelled discrete time Markov chains and checking specifications consists of computing satisfaction probabilities of linear temporal logic formulas. We prove that, in general, there is no polynomial time randomized approximation scheme with relative error for probabilistic verification. However, in many applications, specifications can be expressed by monotone formulas or negation of monotone formulas and randomized approximation schemes with absolute error are sufficient. We show how some simple randomized approximation algorithms can improve the efficiency of verification of such probabilistic specifications and can be implemented in a probabilistic model checker. |
|---|---|
| AbstractList | We study the existence of efficient approximation methods to verify quantitative specifications of probabilistic systems. Models of such systems are labelled discrete time Markov chains and checking specifications consists of computing satisfaction probabilities of linear temporal logic formulas. We prove that, in general, there is no polynomial time randomized approximation scheme with relative error for probabilistic verification. However, in many applications, specifications can be expressed by monotone formulas or negation of monotone formulas and randomized approximation schemes with absolute error are sufficient. We show how some simple randomized approximation algorithms can improve the efficiency of verification of such probabilistic specifications and can be implemented in a probabilistic model checker. |
| Author | Lassaigne, Richard Peyronnet, Sylvain |
| Author_xml | – sequence: 1 givenname: Richard surname: Lassaigne fullname: Lassaigne, Richard email: lassaign@logique.jussieu.fr organization: Equipe de Logique, UMR 7056 CNRS, University Paris VII, France – sequence: 2 givenname: Sylvain surname: Peyronnet fullname: Peyronnet, Sylvain email: syp@lix.polytechnique.fr organization: Equipe de Logique, UMR 7056 CNRS, University Paris VII, France |
| BookMark | eNp9j01Lw0AQhvdQwbb6Bzz1B5g4k83HFrxI8QsKetDzMruZwJSYhN1Q9N-btp489DTwDs_L-yzUrOs7VuoGIUXA8m6X0kBtmgFUKWIKUM7UfHqYZEqyS7WIcQcARV7pubp9D70jJ63EUfxqz0Ea8TRK362oq1c0DKH_lq9jcqUuGmojX__dpfp8evzYvCTbt-fXzcM28RpgTDirHee5M02ROVNSZYzmtW_YOb1GAwWRKcsKuUA0GoqKGajg3BGjb7TTS2VOvT70MQZurJfxuGAMJK1FsAdTu7MHU3swtYh2Mp3Q7B86hGl9-DkP3Z8gnqT2wsFGL9x5riWwH23dyzn8F082ccg |
| CitedBy_id | crossref_primary_10_1016_j_ic_2014_01_014 crossref_primary_10_3390_sym10110638 crossref_primary_10_1145_3060139 crossref_primary_10_1007_s10009_014_0344_z crossref_primary_10_1145_3158668 crossref_primary_10_1007_s10009_015_0368_z crossref_primary_10_3390_info11120588 |
| Cites_doi | 10.1109/SFCS.1985.12 10.1137/S0097539797315306 10.1080/01621459.1963.10500830 10.1145/5397.5399 10.1145/210332.210339 10.1007/978-1-4757-3124-8_7 10.1016/j.entcs.2007.05.027 10.1145/3828.3837 10.1007/BF01211866 10.1016/0304-3975(86)90174-X 10.1137/S0097539796298340 10.1016/0196-6774(89)90038-2 |
| ContentType | Journal Article |
| Copyright | 2007 Elsevier B.V. |
| Copyright_xml | – notice: 2007 Elsevier B.V. |
| DBID | 6I. AAFTH AAYXX CITATION |
| DOI | 10.1016/j.apal.2007.11.006 |
| DatabaseName | ScienceDirect Open Access Titles Elsevier:ScienceDirect:Open Access CrossRef |
| DatabaseTitle | CrossRef |
| DatabaseTitleList | |
| DeliveryMethod | fulltext_linktorsrc |
| Discipline | Mathematics Philosophy |
| EndPage | 131 |
| ExternalDocumentID | 10_1016_j_apal_2007_11_006 S016800720700111X |
| GroupedDBID | --K --M -ET -~X .~1 0R~ 1B1 1RT 1~. 1~5 23M 4.4 457 4G. 5GY 5VS 6I. 6TJ 7-5 71M 8P~ 9JN AACTN AAEDT AAEDW AAFTH AAIAV AAIKJ AAKOC AALRI AAOAW AAQFI AAQXK AAXUO ABAOU ABFNM ABMAC ABTAH ABVKL ABXDB ABYKQ ACAZW ACDAQ ACGFS ACRLP ADBBV ADEZE ADMUD AEBSH AEKER AENEX AETEA AEXQZ AFFNX AFKWA AFTJW AGHFR AGUBO AGYEJ AHHHB AIEXJ AIGVJ AIKHN AITUG AJBFU AJOXV ALMA_UNASSIGNED_HOLDINGS AMFUW AMRAJ ARUGR ASPBG AVWKF AXJTR AZFZN BKOJK BLXMC CS3 EBS EFJIC EFLBG EJD EO8 EO9 EP2 EP3 FDB FGOYB FIRID FNPLU FYGXN G-2 G-Q GBLVA HZ~ H~9 IHE IXB J1W KOM M26 M41 MHUIS MO0 MVM N9A NCXOZ O-L O9- OAUVE OK1 OZT P-8 P-9 P2P PC. Q38 R2- RIG ROL RPZ SCC SDF SDG SDP SES SEW SPC SPCBC SSW SSZ T5K TN5 WH7 WUQ XJT YYP ZY4 ~G- 9DU AATTM AAXKI AAYWO AAYXX ABJNI ABWVN ACLOT ACRPL ACVFH ADCNI ADMHG ADNMO ADVLN ADXHL AEIPS AEUPX AFJKZ AFPUW AGQPQ AIGII AIIUN AKBMS AKRWK AKYEP ANKPU APXCP CITATION EFKBS ~HD |
| ID | FETCH-LOGICAL-c300t-e2dbe44b8f52b86a7883e9cfebb391805aa86671e51183057ee0a5e4bae1cf3b3 |
| ISICitedReferencesCount | 18 |
| ISICitedReferencesURI | http://www.webofscience.com/api/gateway?GWVersion=2&SrcApp=Summon&SrcAuth=ProQuest&DestLinkType=CitingArticles&DestApp=WOS_CPL&KeyUT=000254378600008&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D |
| ISSN | 0168-0072 |
| IngestDate | Tue Nov 18 22:18:54 EST 2025 Sat Nov 29 01:52:30 EST 2025 Fri Feb 23 02:27:25 EST 2024 |
| IsDoiOpenAccess | true |
| IsOpenAccess | true |
| IsPeerReviewed | true |
| IsScholarly | true |
| Issue | 1 |
| Keywords | 68W20 Probabilistic verification Randomized approximation algorithms 68Q60 |
| Language | English |
| License | http://www.elsevier.com/open-access/userlicense/1.0 https://www.elsevier.com/tdm/userlicense/1.0 https://www.elsevier.com/open-access/userlicense/1.0 |
| LinkModel | OpenURL |
| MergedId | FETCHMERGED-LOGICAL-c300t-e2dbe44b8f52b86a7883e9cfebb391805aa86671e51183057ee0a5e4bae1cf3b3 |
| OpenAccessLink | https://dx.doi.org/10.1016/j.apal.2007.11.006 |
| PageCount | 10 |
| ParticipantIDs | crossref_citationtrail_10_1016_j_apal_2007_11_006 crossref_primary_10_1016_j_apal_2007_11_006 elsevier_sciencedirect_doi_10_1016_j_apal_2007_11_006 |
| PublicationCentury | 2000 |
| PublicationDate | 2008-03-01 |
| PublicationDateYYYYMMDD | 2008-03-01 |
| PublicationDate_xml | – month: 03 year: 2008 text: 2008-03-01 day: 01 |
| PublicationDecade | 2000 |
| PublicationTitle | Annals of pure and applied logic |
| PublicationYear | 2008 |
| Publisher | Elsevier B.V |
| Publisher_xml | – name: Elsevier B.V |
| References | Duflot, Fribourg, Herault, Lassaigne, Magniette, Messika, Peyronnet, Picaronny (b8) 2005; 128 Hoeffding (b15) 1963; 58 Jerrum, Valiant, Vazirani (b16) 1986; 43 Younes, Simmons (b28) 2002; vol. 2404 Hansson, Jonsson (b11) 1994; 6 Lichtenstein, Pnueli (b21) 1985 S. Peyronnet, Can verification be approximated? in: Proc. 1st Int. Workshop on Automated Verification of Critical Systems, Programming Research Group Research, Report RR-01-07, Oxford University, 2001 M. Cadilhac, T. Herault, R. Lassaigne, S. Peyronnet, Sebastien Tixeuil, Evaluating complex MAC protocols for sensor networks with APMC. Proc. 6th Int. Workshop on Automated Verification of Critical Systems, 2006 E. Seneta, Non-negative Matrices and Markov Chains. Springer Series in Statistics, 1973 Sen, Viswanathan, Agha (b23) 2004; vol. 3114 Bianco, de Alfaro (b1) 1995; vol. 1026 de Alfaro, Kwiatkowska, Norman, Parker, Segala (b7) 2000; vol. 1785 M.Y. Vardi, Automatic verification of probabilistic concurrent finite-state programs, in: Proc. 26th Annual IEEE Symposium on Foundations of Computer Science, 1985, pp. 327–338 Clarke, Emerson, Sistla (b4) 1986; 8 Karp, Luby, Madras (b19) 1989; 10 Lassaigne, Peyronnet (b20) 2002; vol. 2399 Dagum, Karp, Luby, Ross (b6) 2000; 29 R. Grosu, S.A. Smolka, Quantitative model checking, in: Proc. 1st Int. Symposium on Leveraging Applications of Formal Methods, 2004 Herault, Lassaigne, Magniette, Peyronnet (b13) 2004; vol. 2937 Sistla, Clarke (b26) 1985; 32 Sinclair (b25) 1993 Courcoubetis, Yannakakis (b5) 1995; 42 Herault, Lassaigne, Peyronnet (b14) 2006 Karger (b17) 1999; 29 Younes (b29) 2006; vol. 3855 Guirado, Herault, Lassaigne, Peyronnet (b12) 2006; 135 Brémaud (b2) 1999 Grosu, Smolka (b10) 2005; vol. 3440 Karp, Luby (b18) 1983 Dagum (10.1016/j.apal.2007.11.006_b6) 2000; 29 Duflot (10.1016/j.apal.2007.11.006_b8) 2005; 128 Lichtenstein (10.1016/j.apal.2007.11.006_b21) 1985 Lassaigne (10.1016/j.apal.2007.11.006_b20) 2002; vol. 2399 Guirado (10.1016/j.apal.2007.11.006_b12) 2006; 135 Sen (10.1016/j.apal.2007.11.006_b23) 2004; vol. 3114 Younes (10.1016/j.apal.2007.11.006_b29) 2006; vol. 3855 de Alfaro (10.1016/j.apal.2007.11.006_b7) 2000; vol. 1785 Courcoubetis (10.1016/j.apal.2007.11.006_b5) 1995; 42 Hansson (10.1016/j.apal.2007.11.006_b11) 1994; 6 Hoeffding (10.1016/j.apal.2007.11.006_b15) 1963; 58 Bianco (10.1016/j.apal.2007.11.006_b1) 1995; vol. 1026 Clarke (10.1016/j.apal.2007.11.006_b4) 1986; 8 Karp (10.1016/j.apal.2007.11.006_b18) 1983 10.1016/j.apal.2007.11.006_b24 10.1016/j.apal.2007.11.006_b22 Herault (10.1016/j.apal.2007.11.006_b13) 2004; vol. 2937 Jerrum (10.1016/j.apal.2007.11.006_b16) 1986; 43 10.1016/j.apal.2007.11.006_b27 Brémaud (10.1016/j.apal.2007.11.006_b2) 1999 Sinclair (10.1016/j.apal.2007.11.006_b25) 1993 10.1016/j.apal.2007.11.006_b3 Sistla (10.1016/j.apal.2007.11.006_b26) 1985; 32 Karger (10.1016/j.apal.2007.11.006_b17) 1999; 29 Younes (10.1016/j.apal.2007.11.006_b28) 2002; vol. 2404 10.1016/j.apal.2007.11.006_b9 Grosu (10.1016/j.apal.2007.11.006_b10) 2005; vol. 3440 Karp (10.1016/j.apal.2007.11.006_b19) 1989; 10 Herault (10.1016/j.apal.2007.11.006_b14) 2006 |
| References_xml | – reference: R. Grosu, S.A. Smolka, Quantitative model checking, in: Proc. 1st Int. Symposium on Leveraging Applications of Formal Methods, 2004 – start-page: 56 year: 1983 end-page: 64 ident: b18 article-title: Monte-Carlo algorithms for enumeration and reliability problems publication-title: Proc. 24th Annual IEEE Symposium on Foundations of Computer Science – volume: vol. 3855 start-page: 142 year: 2006 end-page: 156 ident: b29 article-title: Error control for probabilistic model checking publication-title: Proc. 7th Int. Conf. Verification, Model Checking, and Abstract Interpretation – volume: vol. 3440 start-page: 271 year: 2005 end-page: 286 ident: b10 article-title: Monte-Carlo model checking publication-title: Proc. 11th Int. Conf. Tools and Algorithms for Construction and Analysis of Systems – start-page: 129 year: 2006 end-page: 130 ident: b14 article-title: APMC 3.0: Approximate verification of discrete and continuous time Markov chains publication-title: Proc. 3rd Int. Conf. on Quantitative Evaluation of Systems – volume: 43 start-page: 169 year: 1986 end-page: 188 ident: b16 article-title: Random generation of combinatorial structures from a uniform distribution publication-title: Theoretical Computer Science – volume: vol. 3114 start-page: 202 year: 2004 end-page: 215 ident: b23 article-title: Statistical model checking of black-box probabilistic systems publication-title: Proc. 16th Int. Conf. Computer Aided Verification – volume: 32 start-page: 733 year: 1985 end-page: 749 ident: b26 article-title: The complexity of propositional linear temporal logics publication-title: Journal of the ACM – reference: M. Cadilhac, T. Herault, R. Lassaigne, S. Peyronnet, Sebastien Tixeuil, Evaluating complex MAC protocols for sensor networks with APMC. Proc. 6th Int. Workshop on Automated Verification of Critical Systems, 2006 – volume: 6 start-page: 512 year: 1994 end-page: 535 ident: b11 article-title: A logic for reasoning about time and reliability publication-title: Formal Aspects of Computing – volume: vol. 2937 start-page: 73 year: 2004 end-page: 84 ident: b13 article-title: Approximate probabilistic model checking publication-title: Proc. 5th Int. Conf. Verification, Model Checking, and Abstract Interpretation – start-page: 97 year: 1985 end-page: 107 ident: b21 article-title: Checking that finite state concurrent programs satisfy their linear specification publication-title: Proc. 12th ACM Symposium on Principles of Programming Languages – reference: M.Y. Vardi, Automatic verification of probabilistic concurrent finite-state programs, in: Proc. 26th Annual IEEE Symposium on Foundations of Computer Science, 1985, pp. 327–338 – volume: vol. 1785 start-page: 395 year: 2000 end-page: 410 ident: b7 article-title: Symbolic model checking of concurrent probabilistic processes using MTBDDs and the kronecker representation publication-title: Proc. 6th Int. Conf. Tools and Algorithms for Construction and Analysis of Systems – volume: vol. 2399 start-page: 213 year: 2002 end-page: 214 ident: b20 article-title: Approximate verification of probabilistic systems publication-title: Proc. 2nd Int. Workshop Process Algebra and Probabilistic Methods, Performance Modeling and Verification – reference: E. Seneta, Non-negative Matrices and Markov Chains. Springer Series in Statistics, 1973 – year: 1993 ident: b25 article-title: Algorithms for random generation and counting: A Markov chain approach publication-title: Progress in Theoretical Computer Science – volume: 29 start-page: 1484 year: 2000 end-page: 1496 ident: b6 article-title: An optimal algorithm for Monte Carlo estimation publication-title: SIAM Journal of Computing – volume: 135 start-page: 19 year: 2006 end-page: 30 ident: b12 article-title: Distribution, approximation and probabilistic model checking publication-title: Proc. Int. Workshop on Parallel and Distributed Methods in Verification – volume: 10 start-page: 429 year: 1989 end-page: 448 ident: b19 article-title: Monte-Carlo algorithms for enumeration and reliability problems publication-title: Journal of Algorithms – volume: 42 start-page: 857 year: 1995 end-page: 907 ident: b5 article-title: The complexity of probabilistic verification publication-title: Journal of the ACM – reference: S. Peyronnet, Can verification be approximated? in: Proc. 1st Int. Workshop on Automated Verification of Critical Systems, Programming Research Group Research, Report RR-01-07, Oxford University, 2001 – volume: 8 start-page: 244 year: 1986 end-page: 263 ident: b4 article-title: Automatic verification of finite-state concurrent systems using temporal logic specifications publication-title: ACM Transactions on Programming Languages and Systems – volume: 29 start-page: 492 year: 1999 end-page: 514 ident: b17 article-title: A randomized fully polynomial time approximation scheme for the all terminal network reliability problem publication-title: SIAM Journal on Computing – volume: vol. 2404 start-page: 223 year: 2002 end-page: 235 ident: b28 article-title: Probabilistic verification of discrete event systems using acceptance sampling publication-title: Proc. 14th Int. Conf. Computer Aided Verification – volume: vol. 1026 start-page: 499 year: 1995 end-page: 513 ident: b1 article-title: Model checking of probabilistic and nondeterministic systems publication-title: Proc. 15th Conf. Foundations of Software Technology and Theoretical Computer Science – volume: 128 start-page: 195 year: 2005 end-page: 214 ident: b8 article-title: Probabilistic model checking of the CSMA/CD protocol using PRISM and APMC publication-title: Proc. 4th Int. Workshop on Automated Verification of Critical Systems – year: 1999 ident: b2 article-title: Markov chains, Gibbs fields, Monte Carlo simulation, and queues publication-title: Texts in Applied Mathematics – volume: 58 start-page: 13 year: 1963 end-page: 30 ident: b15 article-title: Probability inequalities for sums of bounded random variables publication-title: Journal of the American Statistical Association – ident: 10.1016/j.apal.2007.11.006_b27 doi: 10.1109/SFCS.1985.12 – volume: vol. 2399 start-page: 213 year: 2002 ident: 10.1016/j.apal.2007.11.006_b20 article-title: Approximate verification of probabilistic systems – volume: 135 start-page: 19 issue: 2 year: 2006 ident: 10.1016/j.apal.2007.11.006_b12 article-title: Distribution, approximation and probabilistic model checking publication-title: ENTCS – start-page: 97 year: 1985 ident: 10.1016/j.apal.2007.11.006_b21 article-title: Checking that finite state concurrent programs satisfy their linear specification – volume: vol. 3855 start-page: 142 year: 2006 ident: 10.1016/j.apal.2007.11.006_b29 article-title: Error control for probabilistic model checking – ident: 10.1016/j.apal.2007.11.006_b24 – volume: vol. 1785 start-page: 395 year: 2000 ident: 10.1016/j.apal.2007.11.006_b7 article-title: Symbolic model checking of concurrent probabilistic processes using MTBDDs and the kronecker representation – volume: 128 start-page: 195 issue: 6 year: 2005 ident: 10.1016/j.apal.2007.11.006_b8 article-title: Probabilistic model checking of the CSMA/CD protocol using PRISM and APMC publication-title: ENTCS – ident: 10.1016/j.apal.2007.11.006_b22 – volume: vol. 2937 start-page: 73 year: 2004 ident: 10.1016/j.apal.2007.11.006_b13 article-title: Approximate probabilistic model checking – volume: vol. 3440 start-page: 271 year: 2005 ident: 10.1016/j.apal.2007.11.006_b10 article-title: Monte-Carlo model checking – volume: 29 start-page: 1484 issue: 5 year: 2000 ident: 10.1016/j.apal.2007.11.006_b6 article-title: An optimal algorithm for Monte Carlo estimation publication-title: SIAM Journal of Computing doi: 10.1137/S0097539797315306 – volume: 58 start-page: 13 year: 1963 ident: 10.1016/j.apal.2007.11.006_b15 article-title: Probability inequalities for sums of bounded random variables publication-title: Journal of the American Statistical Association doi: 10.1080/01621459.1963.10500830 – volume: 8 start-page: 244 issue: 2 year: 1986 ident: 10.1016/j.apal.2007.11.006_b4 article-title: Automatic verification of finite-state concurrent systems using temporal logic specifications publication-title: ACM Transactions on Programming Languages and Systems doi: 10.1145/5397.5399 – volume: 42 start-page: 857 issue: 4 year: 1995 ident: 10.1016/j.apal.2007.11.006_b5 article-title: The complexity of probabilistic verification publication-title: Journal of the ACM doi: 10.1145/210332.210339 – start-page: 56 year: 1983 ident: 10.1016/j.apal.2007.11.006_b18 article-title: Monte-Carlo algorithms for enumeration and reliability problems – year: 1999 ident: 10.1016/j.apal.2007.11.006_b2 article-title: Markov chains, Gibbs fields, Monte Carlo simulation, and queues doi: 10.1007/978-1-4757-3124-8_7 – ident: 10.1016/j.apal.2007.11.006_b9 – ident: 10.1016/j.apal.2007.11.006_b3 doi: 10.1016/j.entcs.2007.05.027 – start-page: 129 year: 2006 ident: 10.1016/j.apal.2007.11.006_b14 article-title: APMC 3.0: Approximate verification of discrete and continuous time Markov chains – volume: vol. 3114 start-page: 202 year: 2004 ident: 10.1016/j.apal.2007.11.006_b23 article-title: Statistical model checking of black-box probabilistic systems – volume: 32 start-page: 733 issue: 3 year: 1985 ident: 10.1016/j.apal.2007.11.006_b26 article-title: The complexity of propositional linear temporal logics publication-title: Journal of the ACM doi: 10.1145/3828.3837 – volume: vol. 2404 start-page: 223 year: 2002 ident: 10.1016/j.apal.2007.11.006_b28 article-title: Probabilistic verification of discrete event systems using acceptance sampling – volume: 6 start-page: 512 year: 1994 ident: 10.1016/j.apal.2007.11.006_b11 article-title: A logic for reasoning about time and reliability publication-title: Formal Aspects of Computing doi: 10.1007/BF01211866 – volume: vol. 1026 start-page: 499 year: 1995 ident: 10.1016/j.apal.2007.11.006_b1 article-title: Model checking of probabilistic and nondeterministic systems – year: 1993 ident: 10.1016/j.apal.2007.11.006_b25 article-title: Algorithms for random generation and counting: A Markov chain approach – volume: 43 start-page: 169 year: 1986 ident: 10.1016/j.apal.2007.11.006_b16 article-title: Random generation of combinatorial structures from a uniform distribution publication-title: Theoretical Computer Science doi: 10.1016/0304-3975(86)90174-X – volume: 29 start-page: 492 year: 1999 ident: 10.1016/j.apal.2007.11.006_b17 article-title: A randomized fully polynomial time approximation scheme for the all terminal network reliability problem publication-title: SIAM Journal on Computing doi: 10.1137/S0097539796298340 – volume: 10 start-page: 429 year: 1989 ident: 10.1016/j.apal.2007.11.006_b19 article-title: Monte-Carlo algorithms for enumeration and reliability problems publication-title: Journal of Algorithms doi: 10.1016/0196-6774(89)90038-2 |
| SSID | ssj0005473 |
| Score | 1.8731767 |
| Snippet | We study the existence of efficient approximation methods to verify quantitative specifications of probabilistic systems. Models of such systems are labelled... |
| SourceID | crossref elsevier |
| SourceType | Enrichment Source Index Database Publisher |
| StartPage | 122 |
| SubjectTerms | Probabilistic verification Randomized approximation algorithms |
| Title | Probabilistic verification and approximation |
| URI | https://dx.doi.org/10.1016/j.apal.2007.11.006 |
| Volume | 152 |
| WOSCitedRecordID | wos000254378600008&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D |
| hasFullText | 1 |
| inHoldings | 1 |
| isFullTextHit | |
| isPrint | |
| journalDatabaseRights | – providerCode: PRVESC databaseName: Elsevier SD Freedom Collection Journals 2021 issn: 0168-0072 databaseCode: AIEXJ dateStart: 19950115 customDbUrl: isFulltext: true dateEnd: 20180131 titleUrlDefault: https://www.sciencedirect.com omitProxy: false ssIdentifier: ssj0005473 providerName: Elsevier |
| link | http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwtV1NS8MwGA6iHvQgfuL8ogdvWkmatkmPIooKykCF3UqTJTKZdWxTtn_vmybtuk1FD15KyfqZJ3n6JnvyvAgdc4LbMZGBT7KM-6GGcYrAmvo6ChVVOFNCyCLZBLu_561W0nQ5NgdFOgGW53w0Snr_CjWUAdhm6ewf4K4uCgWwD6DDFmCH7a-Ab_ahixrJq3FgPoHHN2IgC3NhzGpMxEed1wkic1bKvfJPhcyFqAU_VtIdCLezzrOdCa2ty7cEO-4b5UzB7A_j7kfmjL3LeQU-EVaVU40xlGE2zZVRUG8UPq1xH7ELjN1nlFhyn2NoO1nwcgahQNc6SBoTVfyFHfbMZ6oSD5a6tJfUXMPk0WQwjkkL4_WlgEUJ8PPS-c1l63ai9Qmt1KB8Jbd6ygr9Zp_k6wilFnU8rqM1N1zwzi3MG2hB5Zto9a7y2h1sopVmmY1ivIVOp9D36uh7gKg3hf42erq6fLy49l1CDF9SjIe-CtpChaHgOgoEjzPGOVWJ1NChaEI4jqC_xTEjygwbgciZgt4WqVBkikhNBd1Bi_lbrnaRp9u4neg4IFTC7xGFQyQEnzrEgkHELRqIlJWQSucWb5KWdNPvq7-BTqpzetYr5cejo7JuUxft2Sguhabyw3l7f7rLPlqZNO4DtDjsv6tDtCw_hp1B_8i1k0_nmnac |
| linkProvider | Elsevier |
| openUrl | ctx_ver=Z39.88-2004&ctx_enc=info%3Aofi%2Fenc%3AUTF-8&rfr_id=info%3Asid%2Fsummon.serialssolutions.com&rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Ajournal&rft.genre=article&rft.atitle=Probabilistic+verification+and+approximation&rft.jtitle=Annals+of+pure+and+applied+logic&rft.au=Lassaigne%2C+Richard&rft.au=Peyronnet%2C+Sylvain&rft.date=2008-03-01&rft.issn=0168-0072&rft.volume=152&rft.issue=1-3&rft.spage=122&rft.epage=131&rft_id=info:doi/10.1016%2Fj.apal.2007.11.006&rft.externalDBID=n%2Fa&rft.externalDocID=10_1016_j_apal_2007_11_006 |
| thumbnail_l | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/lc.gif&issn=0168-0072&client=summon |
| thumbnail_m | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/mc.gif&issn=0168-0072&client=summon |
| thumbnail_s | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/sc.gif&issn=0168-0072&client=summon |