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.
Formal Modeling and Analysis of Timed Systems [[electronic resource] ] : 8th International Conference, FORMATS 2010, Klosterneuburg, Austria, September 8-10, 2010, Proceedings / / edited by Krishnendu Chatterjee, Thomas A. Henzinger
| Formal Modeling and Analysis of Timed Systems [[electronic resource] ] : 8th International Conference, FORMATS 2010, Klosterneuburg, Austria, September 8-10, 2010, Proceedings / / edited by Krishnendu Chatterjee, Thomas A. Henzinger |
| Edizione | [1st ed. 2010.] |
| Pubbl/distr/stampa | Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2010 |
| Descrizione fisica | 1 online resource (X, 257 p. 55 illus.) |
| Disciplina | 004.01/51 |
| Collana | Theoretical Computer Science and General Issues |
| Soggetto topico |
Computer science
System theory Control theory Computer programming Software engineering Compilers (Computer programs) Machine theory Computer Science Logic and Foundations of Programming Systems Theory, Control Programming Techniques Software Engineering Compilers and Interpreters Formal Languages and Automata Theory |
| ISBN |
1-280-38846-3
9786613566386 3-642-15297-X |
| Formato | Materiale a stampa  |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Interdisciplinary Foundations for Open Cyber-Physical Systems -- Safraless Procedures for Timed Specifications -- Property-Based Monitoring of Analog and Mixed-Signal Systems -- A Framework for Verification of Software with Time and Probabilities -- Synchrony and Time in Fault-Tolerant Distributed Algorithms -- Reconciling Urgency and Variable Abstraction in a Hybrid Compositional Setting -- Computing Equilibria in Two-Player Timed Games via Turn-Based Finite Games -- Natural Domain SMT: A Preliminary Assessment -- Robust Satisfaction of Temporal Logic over Real-Valued Signals -- Combining Symbolic Representations for Solving Timed Games -- Expected Reachability-Time Games -- Diagnosis Using Unfoldings of Parametric Time Petri Nets -- From Mtl to Deterministic Timed Automata -- Unambiguity in Timed Regular Languages: Automata and Logics -- A Process Algebraic Framework for Modeling Resource Demand and Supply -- Memory Event Clocks -- Simulation and Bisimulation for Probabilistic Timed Automata -- Layered Composition for Timed Automata -- A Conformance Testing Relation for Symbolic Timed Automata. |
| Record Nr. | UNISA-996465683503316 |
| Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2010 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. di Salerno | ||
| ||
Formal modeling and analysis of timed systems : 8th International Conference, FORMATS 2010, Klosterneuburg, Austria, September 8-10, 2010 : proceedings / / Krishnendu Chatterjee, Thomas A. Henzinger (eds.)
| Formal modeling and analysis of timed systems : 8th International Conference, FORMATS 2010, Klosterneuburg, Austria, September 8-10, 2010 : proceedings / / Krishnendu Chatterjee, Thomas A. Henzinger (eds.) |
| Edizione | [1st ed. 2010.] |
| Pubbl/distr/stampa | New York, : Springer, 2010 |
| Descrizione fisica | 1 online resource (X, 257 p. 55 illus.) |
| Disciplina | 004.01/51 |
| Altri autori (Persone) |
ChatterjeeKrishnendu
HenzingerT. A (Thomas A.) |
| Collana | Lecture notes in computer science, 0302-9743 |
| Soggetto topico |
Computer simulation
Temporal automata Formal methods (Computer science) Machine theory |
| ISBN |
1-280-38846-3
9786613566386 3-642-15297-X |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Interdisciplinary Foundations for Open Cyber-Physical Systems -- Safraless Procedures for Timed Specifications -- Property-Based Monitoring of Analog and Mixed-Signal Systems -- A Framework for Verification of Software with Time and Probabilities -- Synchrony and Time in Fault-Tolerant Distributed Algorithms -- Reconciling Urgency and Variable Abstraction in a Hybrid Compositional Setting -- Computing Equilibria in Two-Player Timed Games via Turn-Based Finite Games -- Natural Domain SMT: A Preliminary Assessment -- Robust Satisfaction of Temporal Logic over Real-Valued Signals -- Combining Symbolic Representations for Solving Timed Games -- Expected Reachability-Time Games -- Diagnosis Using Unfoldings of Parametric Time Petri Nets -- From Mtl to Deterministic Timed Automata -- Unambiguity in Timed Regular Languages: Automata and Logics -- A Process Algebraic Framework for Modeling Resource Demand and Supply -- Memory Event Clocks -- Simulation and Bisimulation for Probabilistic Timed Automata -- Layered Composition for Timed Automata -- A Conformance Testing Relation for Symbolic Timed Automata. |
| Record Nr. | UNINA-9910483179603321 |
| New York, : Springer, 2010 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. Federico II | ||
| ||
Mathematical Foundations of Computer Science 2013 [[electronic resource] ] : 38th International Symposium, MFCS 2013, Klosterneuburg, Austria, August 26-30, 2013, Proceedings / / edited by Krishnendu Chatterjee, Jirí Sgall
| Mathematical Foundations of Computer Science 2013 [[electronic resource] ] : 38th International Symposium, MFCS 2013, Klosterneuburg, Austria, August 26-30, 2013, Proceedings / / edited by Krishnendu Chatterjee, Jirí Sgall |
| Edizione | [1st ed. 2013.] |
| Pubbl/distr/stampa | Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2013 |
| Descrizione fisica | 1 online resource (XVI, 854 p. 92 illus.) |
| Disciplina | 004.0151 |
| Collana | Theoretical Computer Science and General Issues |
| Soggetto topico |
Algorithms
Computer science—Mathematics Discrete mathematics Numerical analysis Artificial intelligence—Data processing Machine theory Discrete Mathematics in Computer Science Numerical Analysis Data Science Formal Languages and Automata Theory Mathematical Applications in Computer Science |
| ISBN | 3-642-40313-1 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Alternation Trading Proofs and Their Limitations -- Bin Packing Games with Selfish Items -- A Constructive Proof of the Topological Kruskal Theorem -- Prior-Free Auctions of Digital Goods -- Clustering on k-Edge-Colored Graphs -- How to Pack Your Items When You Have to Buy Your Knapsack.-Computing Behavioral Distances, Compositionally -- Rewriting Guarded Negation Queries -- Parity Games and Propositional Proofs -- Bringing Order to Special Cases of Klee’s Measure Problem -- Learning Reductions to Sparse Sets -- Probabilistic Automata with Isolated Cut-Points -- On Stochastic Games with Multiple Objectives -- Paradigms for Parameterized Enumeration -- Noninterference with Local Policies -- Ordering Metro Lines by Block Crossings -- Meta-kernelization with Structural Parameters -- Polynomial Threshold Functions and Boolean Threshold Circuits -- Detecting Regularities on Grammar-Compressed Strings -- An Unusual Temporal Logic. |
| Record Nr. | UNISA-996465710303316 |
| Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2013 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. di Salerno | ||
| ||
Mathematical Foundations of Computer Science 2013 : 38th International Symposium, MFCS 2013, Klosterneuburg, Austria, August 26-30, 2013, Proceedings / / edited by Krishnendu Chatterjee, Jirí Sgall
| Mathematical Foundations of Computer Science 2013 : 38th International Symposium, MFCS 2013, Klosterneuburg, Austria, August 26-30, 2013, Proceedings / / edited by Krishnendu Chatterjee, Jirí Sgall |
| Edizione | [1st ed. 2013.] |
| Pubbl/distr/stampa | Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2013 |
| Descrizione fisica | 1 online resource (XVI, 854 p. 92 illus.) |
| Disciplina | 004.0151 |
| Collana | Theoretical Computer Science and General Issues |
| Soggetto topico |
Algorithms
Computer science—Mathematics Discrete mathematics Numerical analysis Artificial intelligence—Data processing Machine theory Discrete Mathematics in Computer Science Numerical Analysis Data Science Formal Languages and Automata Theory Mathematical Applications in Computer Science |
| ISBN | 3-642-40313-1 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Alternation Trading Proofs and Their Limitations -- Bin Packing Games with Selfish Items -- A Constructive Proof of the Topological Kruskal Theorem -- Prior-Free Auctions of Digital Goods -- Clustering on k-Edge-Colored Graphs -- How to Pack Your Items When You Have to Buy Your Knapsack.-Computing Behavioral Distances, Compositionally -- Rewriting Guarded Negation Queries -- Parity Games and Propositional Proofs -- Bringing Order to Special Cases of Klee’s Measure Problem -- Learning Reductions to Sparse Sets -- Probabilistic Automata with Isolated Cut-Points -- On Stochastic Games with Multiple Objectives -- Paradigms for Parameterized Enumeration -- Noninterference with Local Policies -- Ordering Metro Lines by Block Crossings -- Meta-kernelization with Structural Parameters -- Polynomial Threshold Functions and Boolean Threshold Circuits -- Detecting Regularities on Grammar-Compressed Strings -- An Unusual Temporal Logic. |
| Record Nr. | UNINA-9910484745903321 |
| Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2013 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. Federico II | ||
| ||