top

  Info

  • Utilizzare la checkbox di selezione a fianco di ciascun documento per attivare le funzionalità di stampa, invio email, download nei formati disponibili del (i) record.

  Info

  • Utilizzare questo link per rimuovere la selezione effettuata.
Reachability problems : 11th International Workshop, RP 2017, London, UK, September 7-9, 2017, Proceedings / Matthew Hague, Igor Potapov (eds.).
Reachability problems : 11th International Workshop, RP 2017, London, UK, September 7-9, 2017, Proceedings / Matthew Hague, Igor Potapov (eds.).
Creatore [RP (Workshop) (11th : 2017 : London, England)]
Estensione 1 online resource (xv, 193 pages) : illustrations.
Accesso persona Hague, Matthew, editor
Potapov, Igor, editor
Genere/Forma Electronic books
Conference papers and proceedings
ISBN 9783319670898
3319670891
9783319670881
3319670883
Formato Materiale a stampa
Livello bibliografico Monografia
Lingua di pubblicazione eng
Record Nr. UCHICAGO-11361262
[RP (Workshop) (11th : 2017 : London, England)]  
Materiale a stampa
Lo trovi qui: University of Chicago
Reachability problems : 10th International Workshop, RP 2016, Aalborg, Denmark, September 19-21, 2016, proceedings / Kim Guldstrand Larsen, Igor Potapov, Jiří Srba (ed.).
Reachability problems : 10th International Workshop, RP 2016, Aalborg, Denmark, September 19-21, 2016, proceedings / Kim Guldstrand Larsen, Igor Potapov, Jiří Srba (ed.).
Creatore [RP (Workshop) (10th : 2016 : Ålborg, Denmark)]
Estensione 1 online resource (xiv, 193 pages) : illustrations.
Accesso persona Larsen, K. G. (Kim G.), 1957-editor.
Potapov, Igor, editor
Srba, Jiří, editor
Genere/Forma Electronic books
Conference papers and proceedings
ISBN 9783319459943
3319459945
9783319459936
Formato Materiale a stampa
Livello bibliografico Monografia
Lingua di pubblicazione eng
Nota di contenuto The Ideal Theory for WSTS -- Rare events for Statistical Model Checking -- On the Complexity of Resource-Bounded Logics -- Plain, Bounded, Reversible, Persistent, and k-marked Petri Nets have Marked Graph Reachability Graphs -- Reachability Predicates for Graph Assertions -- Occam's Razor Applied to the Petri Net Coverability Problem -- Safety Property-driven Stubborn Sets -- Characterizing Word Problems of Groups -- Distributed Synthesis of State-Dependent Switching Control -- Compositional Analysis of Boolean Networks Using Local Fixed-point Iterations -- Decidable Models of Integer-manipulating Programs with Recursive Parallelism -- Robot Games with States in Dimension One -- Insertion-deletion Systems over Relational Words.
Record Nr. UCHICAGO-11266882
[RP (Workshop) (10th : 2016 : Ålborg, Denmark)]  
Materiale a stampa
Lo trovi qui: University of Chicago
Reachability problems : 5th International Workshop, RP 2011, Genoa, Italy, September 28-30, 2011. Proceedings / Giorgio Delzanno, Igor Potapov (eds.).
Reachability problems : 5th International Workshop, RP 2011, Genoa, Italy, September 28-30, 2011. Proceedings / Giorgio Delzanno, Igor Potapov (eds.).
Creatore [RP (Workshop) (5th : 2011 : Genoa, Italy)]
Estensione 1 online resource (xii, 244 pages).
Disciplina 003
Accesso persona Delzanno, Giorgio
Potapov, Igor
Genere/Forma Electronic books
Conference papers and proceedings
Soggetto non controllato Computer science
Software engineering
Computer software
Logic design
Logics and Meanings of Programs
Mathematical Logic and Formal Languages
Programming Languages, Compilers, Interpreters
Algorithm Analysis and Problem Complexity
Computation by Abstract Devices
ISBN 9783642242885
364224288X
9783642242878
3642242871
Classificazione 53.89
Formato Materiale a stampa
Livello bibliografico Monografia
Lingua di pubblicazione eng
Record Nr. NYU-006178508
[RP (Workshop) (5th : 2011 : Genoa, Italy)]  
Materiale a stampa
Lo trovi qui: New York University
Reachability problems : 8th International Workshop, RP 2014, Oxford, UK, September 22-24, 2014. Proceedings / Joël Ouaknine, Igor Potapov, James Worrell (eds.).
Reachability problems : 8th International Workshop, RP 2014, Oxford, UK, September 22-24, 2014. Proceedings / Joël Ouaknine, Igor Potapov, James Worrell (eds.).
Creatore [RP (Workshop) (8th : 2014 : Oxford, England)]
Estensione 1 online resource (xx, 246 pages) : illustrations.
Disciplina 004
Accesso persona Ouaknine, Joël, editor
Potapov, Igor, editor
Worrell, James, editor
Genere/Forma Electronic books
Conference papers and proceedings
ISBN 9783319114392
3319114395
3319114387
9783319114385
Formato Materiale a stampa
Livello bibliografico Monografia
Lingua di pubblicazione eng
Nota di contenuto Complexity Bounds for Ordinal-Based Termination -- On The Complexity of Bounded Time Reachability for Piecewise Affine Systems -- Reachability and Mortality Problems for Restricted Hierarchical Piecewise Constant Derivatives -- Parameterized Verification of Communicating Automata under Context Bounds -- Regular Strategies in Pushdown Reachability Games -- Parameterized Verification of Graph Transformation Systems with Whole Neighbourhood Operations -- Equivalence Between Model-Checking Flat Counter Systems and Presburger Arithmetic -- Synthesising Succinct Strategies in Safety and Reachability Games -- Integer Vector Addition Systems with States -- Reachability in MDPs: Refining Convergence of Value Iteration -- On the Expressiveness of Metric Temporal Logic over Bounded Timed Words -- Trace Inclusion for One-Counter Nets Revisited -- Mean-Payoff Games with Partial-Observation -- Parameter Synthesis for Probabilistic Timed Automata Using Stochastic Game Abstractions -- On Functions Weakly Computable by Petri Nets and Vector Addition Systems -- Generalized Craig Interpolation for Stochastic Satisfiability Modulo Theory Problems -- Transformations for Compositional Verification of Assumption-Commitment Properties -- Compositional Reachability in Petri Nets.
Intro; Preface; Organization; Algorithms for Branching Markov Decision Processes; References; Walking with Data - Where Does it Stop; References; Complexity Bounds for Ordinal-Based Termination; On the Subtle Interaction Between Reachability and Liveness; Table of Contents; Complexity Bounds for Ordinal-Based Termination; 1 Introduction; 2 Well Quasi Orders and Termination; 2.1 Well Quasi Orders; 2.2 Termination; 2.3 Ordinals; 3 Complexity Bounds; 3.1 Controlled Ranking Functions; 3.2 Hardy and Cichon H́ierarchies; 3.3 A Length Function Theorem for ε0; 4 Complexity Classification
Record Nr. NYU-006491623
[RP (Workshop) (8th : 2014 : Oxford, England)]  
Materiale a stampa
Lo trovi qui: New York University
Reachability problems : 11th International Workshop, RP 2017, London, UK, September 7-9, 2017, Proceedings / Matthew Hague, Igor Potapov (eds.).
Reachability problems : 11th International Workshop, RP 2017, London, UK, September 7-9, 2017, Proceedings / Matthew Hague, Igor Potapov (eds.).
Creatore [RP (Workshop) (11th : 2017 : London, England)]
Estensione 1 online resource (xv, 193 pages) : illustrations.
Disciplina 004
Accesso persona Hague, Matthew, editor
Potapov, Igor, editor
Genere/Forma Conference papers and proceedings
ISBN 9783319670898
3319670891
9783319670881
Formato Materiale a stampa
Livello bibliografico Monografia
Lingua di pubblicazione eng
Record Nr. UALBERTA-8063096
[RP (Workshop) (11th : 2017 : London, England)]  
Materiale a stampa
Lo trovi qui: University of Alberta / NEOS Library Consortium
Reachability problems : third international workshop, RP 2009, Palaiseau, France, September 23-25, 2009 : proceedings / Olivier Bournez, Igor Potapov, (eds.).
Reachability problems : third international workshop, RP 2009, Palaiseau, France, September 23-25, 2009 : proceedings / Olivier Bournez, Igor Potapov, (eds.).
Creatore [RP (Workshop) (3rd : 2009 : Palaiseau, France)]
Estensione 1 online resource (x, 232 pages) : illustrations.
Disciplina 003
Accesso persona Bournez, Olivier
Potapov, Igor
Genere/Forma Electronic books
Conference papers and proceedings
ISBN 9783642044205
3642044204
Classificazione TP302-532
Formato Materiale a stampa
Livello bibliografico Monografia
Lingua di pubblicazione eng
Record Nr. NYU-004356469
[RP (Workshop) (3rd : 2009 : Palaiseau, France)]  
Materiale a stampa
Lo trovi qui: New York University
Reachability problems : 12th International Conference, RP 2018, Marseille, France, September 24-26, 2018, Proceedings / Igor Potapov, Pierre-Alain Reynier (eds.).
Reachability problems : 12th International Conference, RP 2018, Marseille, France, September 24-26, 2018, Proceedings / Igor Potapov, Pierre-Alain Reynier (eds.).
Creatore [RP (Workshop) (12th : 2018 : Marseille, France)]
Estensione 1 online resource (xxi, 161 pages) : illustrations.
Disciplina 004
Accesso persona Potapov, Igor, editor
Reynier, Pierre-Alain, editor
Genere/Forma Conference papers and proceedings
ISBN 9783030002503
3030002500
9783030002497
Formato Materiale a stampa
Livello bibliografico Monografia
Lingua di pubblicazione eng
Record Nr. UALBERTA-8357701
[RP (Workshop) (12th : 2018 : Marseille, France)]  
Materiale a stampa
Lo trovi qui: University of Alberta / NEOS Library Consortium
Reachability problems : 6th International Workshop, RP 2012, Bordeaux, France, September 17-19, 2012. Proceedings / Alain Finkel, Jérôme Leroux, Igor Potapov (eds.).
Reachability problems : 6th International Workshop, RP 2012, Bordeaux, France, September 17-19, 2012. Proceedings / Alain Finkel, Jérôme Leroux, Igor Potapov (eds.).
Creatore [RP (Workshop) (6th : 2012 : Bordeaux, France)]
Estensione 1 online resource.
Disciplina 004
Accesso persona Finkel, A. (Alain), 1958-
Leroux, Jérôme
Potapov, Igor
Soggetto non controllato Computer science
Software engineering
Computer software
Logic design
Logics and Meanings of Programs
Mathematical Logic and Formal Languages
Programming Languages, Compilers, Interpreters
Algorithm Analysis and Problem Complexity
Computation by Abstract Devices
ISBN 9783642335129
3642335128
364233511X
9783642335112
9783642326295
3642326293
Classificazione 53.89
Formato Materiale a stampa
Livello bibliografico Monografia
Lingua di pubblicazione eng
Nota di contenuto Fraenkel-Mostowski Sets with Non-homogeneous Atoms / Mikołaj Bojańczyk and Sławomir Lasota -- Recursive Schemes, Krivine Machines, and Collapsible Pushdown Automata / Sylvain Salvati and Igor Walukiewicz -- Decision Problems for Linear Recurrence Sequences / Joël Ouaknine and James Worrell -- Playing Games with Counter Automata / Antonín Kučera -- LTL-Model-Checking via Model Composition / Ingo Felscher -- On the Relationship between Reachability Problems in Timed and Counter Automata / Christoph Haase, Joël Ouaknine and James Worrell -- Smooth Sand Piles / Stefano Brocchi and Paolo Massazza -- Ariadne: Dominance Checking of Nonlinear Hybrid Automata Using Reachability Analysis / Luca Benvenuti, Davide Bresolin, Pieter Collins, Alberto Ferrari and Luca Geretti, et al. -- Robustness of Time Petri Nets under Guard Enlargement / S. Akshay, Loïc Hélouët, Claude Jard and Pierre-Alain Reynier -- Efficient Probabilistic Model Checking of Systems with Ranged Probabilities / Khalil Ghorbal, Parasara Sridhar Duggirala, Vineet Kahlon, Franjo Ivančić and Aarti Gupta -- On the Length of Knot Transformations via Reidemeister Moves I and II / Rafiq Saleh -- Invariants for LTI Systems with Uncertain Input / Paul Hänsch and Stefan Kowalewski.
Record Nr. STANFORD-a9726485
[RP (Workshop) (6th : 2012 : Bordeaux, France)]  
Materiale a stampa
Lo trovi qui: Stanford University
Reachability problems : 10th International Workshop, RP 2016, Aalborg, Denmark, September 19-21, 2016, proceedings / Kim Guldstrand Larsen, Igor Potapov, Jiří Srba (ed.).
Reachability problems : 10th International Workshop, RP 2016, Aalborg, Denmark, September 19-21, 2016, proceedings / Kim Guldstrand Larsen, Igor Potapov, Jiří Srba (ed.).
Creatore [RP (Workshop) (10th : 2016 : Ålborg, Denmark)]
Estensione 1 online resource (xiv, 193 pages) : illustrations.
Disciplina 004
Accesso persona Larsen, K. G. (Kim G.), 1957-editor.
Potapov, Igor, editor
Srba, Jiří, editor
Genere/Forma Electronic books
Conference papers and proceedings
ISBN 9783319459943
3319459945
9783319459936
Formato Materiale a stampa
Livello bibliografico Monografia
Lingua di pubblicazione eng
Nota di contenuto The Ideal Theory for WSTS -- Rare events for Statistical Model Checking -- On the Complexity of Resource-Bounded Logics -- Plain, Bounded, Reversible, Persistent, and k-marked Petri Nets have Marked Graph Reachability Graphs -- Reachability Predicates for Graph Assertions -- Occam's Razor Applied to the Petri Net Coverability Problem -- Safety Property-driven Stubborn Sets -- Characterizing Word Problems of Groups -- Distributed Synthesis of State-Dependent Switching Control -- Compositional Analysis of Boolean Networks Using Local Fixed-point Iterations -- Decidable Models of Integer-manipulating Programs with Recursive Parallelism -- Robot Games with States in Dimension One -- Insertion-deletion Systems over Relational Words.
Record Nr. NYU-006480574
[RP (Workshop) (10th : 2016 : Ålborg, Denmark)]  
Materiale a stampa
Lo trovi qui: New York University
Reachability problems : 6th International Workshop, RP 2012, Bordeaux, France, September 17-19, 2012 : proceedings / Alain Finkel, Jérôme Leroux, Igor Potapov (eds.).
Reachability problems : 6th International Workshop, RP 2012, Bordeaux, France, September 17-19, 2012 : proceedings / Alain Finkel, Jérôme Leroux, Igor Potapov (eds.).
Creatore [RP (Workshop) (6th : 2012 : Bordeaux, France)]
Estensione 1 online resource (xii, 148 p.) : ill.
Disciplina 004.2
Accesso persona Finkel, A. (Alain), 1958-
Leroux, Jérôme
Potapov, Igor
Genere/Forma Electronic books
ISBN 9783642326295
3642326293
9783642335129
3642335128
9783642335112
364233511X
Formato Materiale a stampa
Livello bibliografico Monografia
Lingua di pubblicazione eng
Record Nr. DUKE-005758415
[RP (Workshop) (6th : 2012 : Bordeaux, France)]  
Materiale a stampa
Lo trovi qui: Duke University