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.
Application and Theory of Petri Nets 1992 [[electronic resource] ] : 13th International Conference, Sheffield, UK, June 22-26, 1992. Proceedings / / edited by Kurt Jensen
| Application and Theory of Petri Nets 1992 [[electronic resource] ] : 13th International Conference, Sheffield, UK, June 22-26, 1992. Proceedings / / edited by Kurt Jensen |
| Edizione | [1st ed. 1992.] |
| Pubbl/distr/stampa | Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 1992 |
| Descrizione fisica | 1 online resource (VIII, 404 p.) |
| Disciplina | 004.0151 |
| Collana | Lecture Notes in Computer Science |
| Soggetto topico |
Computers
Microprocessors Algorithms Computer communication systems Operating systems (Computers) Theory of Computation Computation by Abstract Devices Processor Architectures Algorithm Analysis and Problem Complexity Computer Communication Networks Operating Systems |
| ISBN | 3-540-47270-3 |
| Formato | Materiale a stampa  |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Performance issues in parallel programming -- Combining Petri Nets and other formal methods -- Place bisimulations in Petri nets -- A polynomial-time graph algorithm to decide liveness of some basic classes of bounded Petri nets -- Refinement and simulation of nets — a categorical characterisation -- Scheduling hard real time systems using high-level Petri nets -- Towards a modular analysis of coloured Petri nets -- A proof of the Rank Theorem for extended free choice nets -- On the product form solution for Stochastic Petri Nets -- Obtaining deadlock-preserving skeletons for coloured nets -- P-superfairness in nets -- Formal verification of an arbiter cascade -- Constructs for modeling information systems with Petri nets -- Construction of a class of safe Petri nets by presenting firing sequences -- An efficient polynomial-time algorithm to decide liveness and boundedness of free-choice nets -- Hierarchical solution of generalized Stochastic Petri Nets by means of traffic processes -- Concurrency relations and the safety problem for Petri nets -- High-level nets and linear logic -- Liveness and boundedness analysis for Petri nets with event graph modules -- On weighted T-systems -- Using Petri Nets to develop programs for PLC systems -- Modelling and control of complex logistic systems for manufacturing -- Modelling and evaluation of a satellite system using EVAL, a Petri Net based industrial tool -- Analysis of an Ada system using coloured Petri nets and occurrence graphs -- The stubborn set method in practice -- Modeling fine grain computation via the Fusion of two extended Petri nets. |
| Record Nr. | UNISA-996465765303316 |
| Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 1992 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. di Salerno | ||
| ||
Tools and Algorithms for the Construction and Analysis of Systems [[electronic resource] ] : 10th International Conference, TACAS 2004, Held as Part of the Joint European Conferences on Theory and Practice of Software, ETAPS 2004, Barcelona, Spain, March 29 - April 2, 2004, Proceedings / / edited by Kurt Jensen, Andreas Podelski
| Tools and Algorithms for the Construction and Analysis of Systems [[electronic resource] ] : 10th International Conference, TACAS 2004, Held as Part of the Joint European Conferences on Theory and Practice of Software, ETAPS 2004, Barcelona, Spain, March 29 - April 2, 2004, Proceedings / / edited by Kurt Jensen, Andreas Podelski |
| Edizione | [1st ed. 2004.] |
| Pubbl/distr/stampa | Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2004 |
| Descrizione fisica | 1 online resource (XIV, 614 p.) |
| Disciplina | 005.1/2 |
| Collana | Lecture Notes in Computer Science |
| Soggetto topico |
Software engineering
Computer logic Computer communication systems Algorithms Software Engineering/Programming and Operating Systems Logics and Meanings of Programs Software Engineering Computer Communication Networks Algorithm Analysis and Problem Complexity |
| ISBN |
1-280-30802-8
9786610308026 3-540-24730-0 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Theorem Proving -- Revisiting Positive Equality -- An Interpolating Theorem Prover -- Minimal Assignments for Bounded Model Checking -- Probabilistic Model Checking -- Numerical vs. Statistical Probabilistic Model Checking: An Empirical Study -- Efficient Computation of Time-Bounded Reachability Probabilities in Uniform Continuous-Time Markov Decision Processes -- Model Checking Discounted Temporal Properties -- Testing -- Automatic Creation of Environment Models via Training -- Error Explanation with Distance Metrics -- Online Efficient Predictive Safety Analysis of Multithreaded Programs -- Tools -- Vooduu: Verification of Object-Oriented Designs Using UPPAAL -- CoPS – Checker of Persistent Security -- Tampere Verification Tool -- SyncGen: An Aspect-Oriented Framework for Synchronization -- MetaGame: An Animation Tool for Model-Checking Games -- A Tool for Checking ANSI-C Programs -- Explicite State/Petri Nets -- Obtaining Memory-Efficient Reachability Graph Representations Using the Sweep-Line Method -- Automated Generation of a Progress Measure for the Sweep-Line Method -- Tarjan’s Algorithm Makes On-the-Fly LTL Verification More Efficient -- Scheduling -- Resource-Optimal Scheduling Using Priced Timed Automata -- Decidable and Undecidable Problems in Schedulability Analysis Using Timed Automata -- Constraint Solving -- The Succinct Solver Suite -- Binding-Time Analysis for MetaML via Type Inference and Constraint Solving -- A Class of Polynomially Solvable Range Constraints for Interval Analysis without Widenings and Narrowings -- Timed Systems -- A Partial Order Semantics Approach to the Clock Explosion Problem of Timed Automata -- Lower and Upper Bounds in Zone Based Abstractions of Timed Automata -- A Scalable Incomplete Test for the Boundedness of UML RT Models -- Automatic Verification of Time Sensitive Cryptographic Protocols -- Case Studies -- Simulation-Based Verification of Autonomous Controllers via Livingstone PathFinder -- Automatic Parametric Verification of a Root Contention Protocol Based on Abstract State Machines and First Order Timed Logic -- Software -- Refining Approximations in Software Predicate Abstraction -- Checking Strong Specifications Using an Extensible Software Model Checking Framework -- Applying Game Semantics to Compositional Software Modeling and Verification -- Temporal Logic -- Solving Disjunctive/Conjunctive Boolean Equation Systems with Alternating Fixed Points -- How Vacuous Is Vacuous? -- A Temporal Logic of Nested Calls and Returns -- Liveness with Incomprehensible Ranking -- Abstraction -- Guided Invariant Model Checking Based on Abstraction and Symbolic Pattern Databases -- Numeric Domains with Summarized Dimensions -- Symbolically Computing Most-Precise Abstract Operations for Shape Analysis -- Monotonic Abstraction-Refinement for CTL -- Automata Techniques -- Omega-Regular Model Checking -- FASTer Acceleration of Counter Automata in Practice -- From Complementation to Certification. |
| Record Nr. | UNISA-996465527703316 |
| Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2004 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. di Salerno | ||
| ||
Tools and Algorithms for the Construction and Analysis of Systems : 10th International Conference, TACAS 2004, Held as Part of the Joint European Conferences on Theory and Practice of Software, ETAPS 2004, Barcelona, Spain, March 29 - April 2, 2004, Proceedings / / edited by Kurt Jensen, Andreas Podelski
| Tools and Algorithms for the Construction and Analysis of Systems : 10th International Conference, TACAS 2004, Held as Part of the Joint European Conferences on Theory and Practice of Software, ETAPS 2004, Barcelona, Spain, March 29 - April 2, 2004, Proceedings / / edited by Kurt Jensen, Andreas Podelski |
| Edizione | [1st ed. 2004.] |
| Pubbl/distr/stampa | Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2004 |
| Descrizione fisica | 1 online resource (XIV, 614 p.) |
| Disciplina | 005.1/2 |
| Collana | Lecture Notes in Computer Science |
| Soggetto topico |
Software engineering
Computer logic Computer networks Algorithms Software Engineering/Programming and Operating Systems Logics and Meanings of Programs Software Engineering Computer Communication Networks Algorithm Analysis and Problem Complexity |
| ISBN |
1-280-30802-8
9786610308026 3-540-24730-0 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Theorem Proving -- Revisiting Positive Equality -- An Interpolating Theorem Prover -- Minimal Assignments for Bounded Model Checking -- Probabilistic Model Checking -- Numerical vs. Statistical Probabilistic Model Checking: An Empirical Study -- Efficient Computation of Time-Bounded Reachability Probabilities in Uniform Continuous-Time Markov Decision Processes -- Model Checking Discounted Temporal Properties -- Testing -- Automatic Creation of Environment Models via Training -- Error Explanation with Distance Metrics -- Online Efficient Predictive Safety Analysis of Multithreaded Programs -- Tools -- Vooduu: Verification of Object-Oriented Designs Using UPPAAL -- CoPS – Checker of Persistent Security -- Tampere Verification Tool -- SyncGen: An Aspect-Oriented Framework for Synchronization -- MetaGame: An Animation Tool for Model-Checking Games -- A Tool for Checking ANSI-C Programs -- Explicite State/Petri Nets -- Obtaining Memory-Efficient Reachability Graph Representations Using the Sweep-Line Method -- Automated Generation of a Progress Measure for the Sweep-Line Method -- Tarjan’s Algorithm Makes On-the-Fly LTL Verification More Efficient -- Scheduling -- Resource-Optimal Scheduling Using Priced Timed Automata -- Decidable and Undecidable Problems in Schedulability Analysis Using Timed Automata -- Constraint Solving -- The Succinct Solver Suite -- Binding-Time Analysis for MetaML via Type Inference and Constraint Solving -- A Class of Polynomially Solvable Range Constraints for Interval Analysis without Widenings and Narrowings -- Timed Systems -- A Partial Order Semantics Approach to the Clock Explosion Problem of Timed Automata -- Lower and Upper Bounds in Zone Based Abstractions of Timed Automata -- A Scalable Incomplete Test for the Boundedness of UML RT Models -- Automatic Verification of Time Sensitive Cryptographic Protocols -- Case Studies -- Simulation-Based Verification of Autonomous Controllers via Livingstone PathFinder -- Automatic Parametric Verification of a Root Contention Protocol Based on Abstract State Machines and First Order Timed Logic -- Software -- Refining Approximations in Software Predicate Abstraction -- Checking Strong Specifications Using an Extensible Software Model Checking Framework -- Applying Game Semantics to Compositional Software Modeling and Verification -- Temporal Logic -- Solving Disjunctive/Conjunctive Boolean Equation Systems with Alternating Fixed Points -- How Vacuous Is Vacuous? -- A Temporal Logic of Nested Calls and Returns -- Liveness with Incomprehensible Ranking -- Abstraction -- Guided Invariant Model Checking Based on Abstraction and Symbolic Pattern Databases -- Numeric Domains with Summarized Dimensions -- Symbolically Computing Most-Precise Abstract Operations for Shape Analysis -- Monotonic Abstraction-Refinement for CTL -- Automata Techniques -- Omega-Regular Model Checking -- FASTer Acceleration of Counter Automata in Practice -- From Complementation to Certification. |
| Record Nr. | UNINA-9910144204003321 |
| Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2004 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. Federico II | ||
| ||
Transactions on Petri Nets and Other Models of Concurrency VII [[electronic resource] /] / edited by Kurt Jensen, Wil M. P. van der Aalst, Gianfranco Balbo, Maciej Koutny, Karsten Wolf
| Transactions on Petri Nets and Other Models of Concurrency VII [[electronic resource] /] / edited by Kurt Jensen, Wil M. P. van der Aalst, Gianfranco Balbo, Maciej Koutny, Karsten Wolf |
| Edizione | [1st ed. 2013.] |
| Pubbl/distr/stampa | Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2013 |
| Descrizione fisica | 1 online resource (XVI, 423 p. 250 illus.) |
| Disciplina | 005.1 |
| Collana | Transactions on Petri Nets and Other Models of Concurrency |
| Soggetto topico |
Software engineering
Computers Computer logic Software Engineering Computation by Abstract Devices Logics and Meanings of Programs |
| ISBN | 3-642-38143-X |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | In Memoriam: Carl Adam Petri -- Strategies for Modeling Complex Processes Using Colored Petri Nets -- Applications of Coloured Petri Nets for Functional Validation of Protocol Designs -- Business Process Modeling Using Petri Nets -- Structure Theory of Petri Nets -- Causality in Extensions of Petri Nets -- External Behaviour of Systems of State Machines with Variables -- The Synthesis Problem -- Models from Scenarios -- Discovering Petri Nets from Event Logs. |
| Record Nr. | UNISA-996466174003316 |
| Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2013 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. di Salerno | ||
| ||
Transactions on Petri Nets and Other Models of Concurrency VII / / edited by Kurt Jensen, Wil M. P. van der Aalst, Gianfranco Balbo, Maciej Koutny, Karsten Wolf
| Transactions on Petri Nets and Other Models of Concurrency VII / / edited by Kurt Jensen, Wil M. P. van der Aalst, Gianfranco Balbo, Maciej Koutny, Karsten Wolf |
| Edizione | [1st ed. 2013.] |
| Pubbl/distr/stampa | Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2013 |
| Descrizione fisica | 1 online resource (XVI, 423 p. 250 illus.) |
| Disciplina | 005.1 |
| Collana | Transactions on Petri Nets and Other Models of Concurrency |
| Soggetto topico |
Software engineering
Computers Computer logic Software Engineering Computation by Abstract Devices Logics and Meanings of Programs |
| ISBN | 3-642-38143-X |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | In Memoriam: Carl Adam Petri -- Strategies for Modeling Complex Processes Using Colored Petri Nets -- Applications of Coloured Petri Nets for Functional Validation of Protocol Designs -- Business Process Modeling Using Petri Nets -- Structure Theory of Petri Nets -- Causality in Extensions of Petri Nets -- External Behaviour of Systems of State Machines with Variables -- The Synthesis Problem -- Models from Scenarios -- Discovering Petri Nets from Event Logs. |
| Record Nr. | UNINA-9910483903403321 |
| Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2013 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. Federico II | ||
| ||