01451cam2 22002891 450 SOBE0005011820220207133137.0978348713835020151120e20151729|||||ita|0103 bagerDE<<143: >>Natürliche Erkentniss Gottes, der Welt und des Menschen, nebst andern dahin gehöringen Wrheiten, welche die Grund-Sätze aller wahren Gelehrsamkeit, fürnemlich der Welt-Weissheit in sich enthaltenJohann Liborius Zimmermannmit einem Vorwort von Robert TheisHildesheim [etc.]Olms201524, 798, [30] p.21 cmRiproduzione facsimilare dell'ed.: Jena, 1729001SOBE000180942001 <<3. Abteilung: >>Materialien und Dokumente [101- ]143Zimmermann, Johann LiboriusSOBA00012033070773495Theis, RobertA600200049097070ITUNISOB20220207RICAUNISOBUNISOB100|Coll|28|C166471SOBE00050118M 102 Monografia moderna SBNM100|Coll|28|C000143SI16647120151116acquistoVmenleUNISOBUNISOB20151120121815.020220207133129.0AlfanoNatürliche Erkentniss Gottes, der Welt und des Menschen, nebst andern dahin gehöringen Wrheiten, welche die Grund-Sätze aller wahren Gelehrsamkeit, fürnemlich der Welt-Weissheit in sich enthalten1725718UNISOB04027nam 22007215 450 991088781690332120251225202045.03-031-72621-910.1007/978-3-031-72621-7(MiAaPQ)EBC31683202(Au-PeEL)EBL31683202(CKB)36129182800041(DE-He213)978-3-031-72621-7(EXLCZ)993612918280004120240919d2024 u| 0engurcnu||||||||txtrdacontentcrdamediacrrdacarrierReachability Problems 18th International Conference, RP 2024, Vienna, Austria, September 25–27, 2024, Proceedings /edited by Laura Kovács, Ana Sokolova1st ed. 2024.Cham :Springer Nature Switzerland :Imprint: Springer,2024.1 online resource (251 pages)Lecture Notes in Computer Science,1611-3349 ;150503-031-72620-0 Invited Papers -- Quantifying Uncertainty in Probabilistic Loops without Sampling: a Fully Automated Approach.-The Satis ability and Validity Problems for Probabilistic CTL.-Computability and Reachability -- Computing Reachable Simulations on Transition Systems -- Computing All Minimal Ways to Reach a Context-Free Language -- On Solving All-Path Reachability Problems for Starvation Freedom of Concurrent Rewrite Systems under Process Fairness -- Automata and Complexity -- Rollercoasters with Plateaus -- Quantum Automata and Languages of Finite Index -- On Shortest Products for Nonnegative Matrix Mortality -- Hardness of Busy Beaver Value BB(15) -- Linear Systems and Recurrences -- On the Complexity of Reachability and Mortality for Bounded Piecewise Affine Maps -- Semi-Linear VASR for Over-Approximate Semi-Linear System Reachability.-Reachability in Linear Recurrence Automata -- Games and Abstractions -- Robust Deterministic Abstractions for Supervising Discrete-time Continuous Systems -- Markov Decision Processes with Sure Parity and Multiple Reachability Objectives -- Modelling Dynamical Systems: Learning ODEs with No Internal ODE Resolution.This book constitutes the proceedings of the 18th International Conference on Reachability Problems, RP 2024, which took place in Vienna, Austria, during September 25–27, 2024. The 13 full papers included in these proceedings were carefully reviewed and selected from 37 submissions. The book also contains two invited talks in full paper length. The contributions in these proceedings cover topics from computability and reachability; automata and complexity; linear systems and recurrences; and games and abstractions.Lecture Notes in Computer Science,1611-3349 ;15050Machine theoryComputer scienceSoftware engineeringLogic programmingAlgorithmsComputer scienceMathematicsFormal Languages and Automata TheoryComputer Science Logic and Foundations of ProgrammingSoftware EngineeringLogic in AIDesign and Analysis of AlgorithmsMathematics of ComputingMachine theory.Computer science.Software engineering.Logic programming.Algorithms.Computer scienceMathematics.Formal Languages and Automata Theory.Computer Science Logic and Foundations of Programming.Software Engineering.Logic in AI.Design and Analysis of Algorithms.Mathematics of Computing.004.0151Kovács LauraSokolova AnaMiAaPQMiAaPQMiAaPQBOOK9910887816903321Reachability Problems3573647UNINA