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.
Formal Methods and Software Engineering [[electronic resource] ] : 16th International Conference on Formal Engineering Methods, ICFEM 2014, Luxembourg, Luxembourg, November 3-5, 2014, Proceedings / / edited by Stephan Merz, Jun Pang
Formal Methods and Software Engineering [[electronic resource] ] : 16th International Conference on Formal Engineering Methods, ICFEM 2014, Luxembourg, Luxembourg, November 3-5, 2014, Proceedings / / edited by Stephan Merz, Jun Pang
Edizione [1st ed. 2014.]
Pubbl/distr/stampa Cham : , : Springer International Publishing : , : Imprint : Springer, , 2014
Descrizione fisica 1 online resource (XVIII, 460 p. 125 illus.)
Disciplina 004.0151
Collana Programming and Software Engineering
Soggetto topico Software engineering
Computer programming
Programming languages (Electronic computers)
Algorithms
Mathematical logic
Computer communication systems
Software Engineering
Programming Techniques
Programming Languages, Compilers, Interpreters
Algorithm Analysis and Problem Complexity
Mathematical Logic and Formal Languages
Computer Communication Networks
ISBN 3-319-11737-8
Formato Materiale a stampa
Livello bibliografico Monografia
Lingua di pubblicazione eng
Nota di contenuto Approximations for Stochastic Graph Rewriting -- Computing Maximal Bisimulations -- Improving the Model Checking of Strategies under Partial Observability and Fairness Constraints -- A Formal Model for Natural-Language Timed Requirements of Reactive Systems -- A Hybrid Model of Connectors in Cyber-Physical Systems -- A Language-Independent Proof System for Mutual Program Equivalence -- PHASE: A Stochastic Formalism for Phase-Type Distributions -- CASSANDRA: An Online Failure Prediction Strategy for Dynamically Evolving Systems -- Modal Characterisations of Probabilistic and Fuzzy Bisimulations -- Pointer Program Derivation Using Coq: Graphs and Schorr-Waite Algorithm -- An LTL Model Checking Approach for Biological Parameter Inference -- SCC-Based Improved Reachability Analysis for Markov Decision Processes -- Comprehension of Spacecraft Telemetry Using Hierarchical Specifications of Behavior -- Timed Automata Verification via IC3 with Zones -- GRL: A Specification Language for Globally Asynchronous Locally Synchronous Systems -- A Formal Framework to Prove the Correctness of Model Driven Engineering Composition Operators -- A Formula-Based Approach for Automatic Fault Localization of Imperative Programs -- A Resource-Based Logic for Termination and Non-termination Proofs -- Practical Analysis Framework for Software-Based Attestation Scheme -- TAuth: Verifying Timed Security Protocols -- On the Formal Analysis of HMM Using Theorem Proving -- Formal Modeling and Analysis of Cassandra in Maude -- Bounded Model Checking High Level Petri Nets in PIPE+Verifier -- Fast Translation from LTL to Büchi Automata via Non-transition-Based Automata -- Complete Model-Based Equivalence Class Testing for the ETCS Ceiling Speed Monitor -- Contract-Based Verification of MATLAB and Simulink Matrix-Manipulating Code -- GPU Accelerated Counterexample Generation in LTL Model Checking -- Formal Throughput and Response Time Analysis of MARTE Models -- Extending MSVL with Function Calls.
Record Nr. UNINA-9910483510803321
Cham : , : Springer International Publishing : , : Imprint : Springer, , 2014
Materiale a stampa
Lo trovi qui: Univ. Federico II
Opac: Controlla la disponibilità qui
Formal Methods and Software Engineering [[electronic resource] ] : 16th International Conference on Formal Engineering Methods, ICFEM 2014, Luxembourg, Luxembourg, November 3-5, 2014, Proceedings / / edited by Stephan Merz, Jun Pang
Formal Methods and Software Engineering [[electronic resource] ] : 16th International Conference on Formal Engineering Methods, ICFEM 2014, Luxembourg, Luxembourg, November 3-5, 2014, Proceedings / / edited by Stephan Merz, Jun Pang
Edizione [1st ed. 2014.]
Pubbl/distr/stampa Cham : , : Springer International Publishing : , : Imprint : Springer, , 2014
Descrizione fisica 1 online resource (XVIII, 460 p. 125 illus.)
Disciplina 004.0151
Collana Programming and Software Engineering
Soggetto topico Software engineering
Computer programming
Programming languages (Electronic computers)
Algorithms
Mathematical logic
Computer communication systems
Software Engineering
Programming Techniques
Programming Languages, Compilers, Interpreters
Algorithm Analysis and Problem Complexity
Mathematical Logic and Formal Languages
Computer Communication Networks
ISBN 3-319-11737-8
Formato Materiale a stampa
Livello bibliografico Monografia
Lingua di pubblicazione eng
Nota di contenuto Approximations for Stochastic Graph Rewriting -- Computing Maximal Bisimulations -- Improving the Model Checking of Strategies under Partial Observability and Fairness Constraints -- A Formal Model for Natural-Language Timed Requirements of Reactive Systems -- A Hybrid Model of Connectors in Cyber-Physical Systems -- A Language-Independent Proof System for Mutual Program Equivalence -- PHASE: A Stochastic Formalism for Phase-Type Distributions -- CASSANDRA: An Online Failure Prediction Strategy for Dynamically Evolving Systems -- Modal Characterisations of Probabilistic and Fuzzy Bisimulations -- Pointer Program Derivation Using Coq: Graphs and Schorr-Waite Algorithm -- An LTL Model Checking Approach for Biological Parameter Inference -- SCC-Based Improved Reachability Analysis for Markov Decision Processes -- Comprehension of Spacecraft Telemetry Using Hierarchical Specifications of Behavior -- Timed Automata Verification via IC3 with Zones -- GRL: A Specification Language for Globally Asynchronous Locally Synchronous Systems -- A Formal Framework to Prove the Correctness of Model Driven Engineering Composition Operators -- A Formula-Based Approach for Automatic Fault Localization of Imperative Programs -- A Resource-Based Logic for Termination and Non-termination Proofs -- Practical Analysis Framework for Software-Based Attestation Scheme -- TAuth: Verifying Timed Security Protocols -- On the Formal Analysis of HMM Using Theorem Proving -- Formal Modeling and Analysis of Cassandra in Maude -- Bounded Model Checking High Level Petri Nets in PIPE+Verifier -- Fast Translation from LTL to Büchi Automata via Non-transition-Based Automata -- Complete Model-Based Equivalence Class Testing for the ETCS Ceiling Speed Monitor -- Contract-Based Verification of MATLAB and Simulink Matrix-Manipulating Code -- GPU Accelerated Counterexample Generation in LTL Model Checking -- Formal Throughput and Response Time Analysis of MARTE Models -- Extending MSVL with Function Calls.
Record Nr. UNISA-996213650603316
Cham : , : Springer International Publishing : , : Imprint : Springer, , 2014
Materiale a stampa
Lo trovi qui: Univ. di Salerno
Opac: Controlla la disponibilità qui
Formal Systems Specification [[electronic resource] ] : The RPC-Memory Specification Case Study / / edited by Manfred Broy, Stephan Merz, Katharina Spies
Formal Systems Specification [[electronic resource] ] : The RPC-Memory Specification Case Study / / edited by Manfred Broy, Stephan Merz, Katharina Spies
Edizione [1st ed. 1996.]
Pubbl/distr/stampa Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 1996
Descrizione fisica 1 online resource (XXIII, 543 p.)
Disciplina 004/.36
Collana Lecture Notes in Computer Science
Soggetto topico Computers
Software engineering
Computer communication systems
Computer logic
Theory of Computation
Software Engineering
Computer Communication Networks
Logics and Meanings of Programs
ISBN 3-540-49573-8
Formato Materiale a stampa
Livello bibliografico Monografia
Lingua di pubblicazione eng
Nota di contenuto The RPC-memory specification problem problem statement -- The RPC-memory case study: A synopsis -- A TLA solution to the RPC-memory specification problem -- A dynamic specification of the RPC-memory problem -- A memory module specification using composable high-level petri nets -- Constraint oriented temporal logic specification -- A functional solution to the RPC-memory specification problem -- A solution relying on the model checking of boolean transition systems -- Applying a temporal logic to the RPC-memory specification problem -- Using PVS for an assertional verification of the RPC-memory specification problem -- Specification and verification using a visual formalism on top of temporal logic -- A case study in verification based on trace abstractions -- Incremental specification with joint actions: The RPC-memory specification problem -- The methodology of modal constraints -- Tackling the RPC-memory specification problem with I/O automata -- Using relations on streams to solve the RPC-memory specification problem -- The RPC-memory specification problem: UNITY + refinement calculus.
Record Nr. UNISA-996465596403316
Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 1996
Materiale a stampa
Lo trovi qui: Univ. di Salerno
Opac: Controlla la disponibilità qui
Integrated Formal Methods [[electronic resource] ] : 8th International Conference, IFM 2010, Nancy, France, October 11-14, 2010, Proceedings / / edited by Dominique Méry, Stephan Merz
Integrated Formal Methods [[electronic resource] ] : 8th International Conference, IFM 2010, Nancy, France, October 11-14, 2010, Proceedings / / edited by Dominique Méry, Stephan Merz
Edizione [1st ed. 2010.]
Pubbl/distr/stampa Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2010
Descrizione fisica 1 online resource (X, 337 p. 110 illus.)
Disciplina 005.1
Collana Programming and Software Engineering
Soggetto topico Software engineering
Computer logic
Programming languages (Electronic computers)
Mathematical logic
Computer programming
Software Engineering/Programming and Operating Systems
Software Engineering
Logics and Meanings of Programs
Programming Languages, Compilers, Interpreters
Mathematical Logic and Formal Languages
Programming Techniques
ISBN 1-280-38968-0
9786613567604
3-642-16265-7
Formato Materiale a stampa
Livello bibliografico Monografia
Lingua di pubblicazione eng
Nota di contenuto On Model Checking Techniques for Randomized Distributed Systems -- Collaborative Modelling and Co-simulation in the Development of Dependable Embedded Systems -- Programming with Miracles -- An Event-B Approach to Data Sharing Agreements -- A Logical Framework to Deal with Variability -- Adding Change Impact Analysis to the Formal Verification of C Programs -- Creating Sequential Programs from Event-B Models -- Symbolic Model-Checking of Optimistic Replication Algorithms -- From Operating-System Correctness to Pervasively Verified Applications -- A Compositional Method for Deciding Equivalence and Termination of Nondeterministic Programs -- Verification Architectures: Compositional Reasoning for Real-Time Systems -- Automatic Verification of Parametric Specifications with Complex Topologies -- Satisfaction Meets Expectations -- Showing Full Semantics Preservation in Model Transformation - A Comparison of Techniques -- Specification and Verification of Model Transformations Using UML-RSDS -- Multiformalism and Transformation Inheritance for Dependability Analysis of Critical Systems -- Translating Pi-Calculus into LOTOS NT -- Systematic Translation Rules from astd to Event-B -- A CSP Approach to Control in Event-B -- Towards Probabilistic Modelling in Event-B -- Safe Commits for Transactional Featherweight Java -- Certified Absence of Dangling Pointers in a Language with Explicit Deallocation -- Integrating Implicit Induction Proofs into Certified Proof Environments.
Record Nr. UNISA-996465670803316
Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2010
Materiale a stampa
Lo trovi qui: Univ. di Salerno
Opac: Controlla la disponibilità qui
Integrated Formal Methods [[electronic resource] ] : 8th International Conference, IFM 2010, Nancy, France, October 11-14, 2010, Proceedings / / edited by Dominique Méry, Stephan Merz
Integrated Formal Methods [[electronic resource] ] : 8th International Conference, IFM 2010, Nancy, France, October 11-14, 2010, Proceedings / / edited by Dominique Méry, Stephan Merz
Edizione [1st ed. 2010.]
Pubbl/distr/stampa Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2010
Descrizione fisica 1 online resource (X, 337 p. 110 illus.)
Disciplina 005.1
Collana Programming and Software Engineering
Soggetto topico Software engineering
Computer logic
Programming languages (Electronic computers)
Mathematical logic
Computer programming
Software Engineering/Programming and Operating Systems
Software Engineering
Logics and Meanings of Programs
Programming Languages, Compilers, Interpreters
Mathematical Logic and Formal Languages
Programming Techniques
ISBN 1-280-38968-0
9786613567604
3-642-16265-7
Formato Materiale a stampa
Livello bibliografico Monografia
Lingua di pubblicazione eng
Nota di contenuto On Model Checking Techniques for Randomized Distributed Systems -- Collaborative Modelling and Co-simulation in the Development of Dependable Embedded Systems -- Programming with Miracles -- An Event-B Approach to Data Sharing Agreements -- A Logical Framework to Deal with Variability -- Adding Change Impact Analysis to the Formal Verification of C Programs -- Creating Sequential Programs from Event-B Models -- Symbolic Model-Checking of Optimistic Replication Algorithms -- From Operating-System Correctness to Pervasively Verified Applications -- A Compositional Method for Deciding Equivalence and Termination of Nondeterministic Programs -- Verification Architectures: Compositional Reasoning for Real-Time Systems -- Automatic Verification of Parametric Specifications with Complex Topologies -- Satisfaction Meets Expectations -- Showing Full Semantics Preservation in Model Transformation - A Comparison of Techniques -- Specification and Verification of Model Transformations Using UML-RSDS -- Multiformalism and Transformation Inheritance for Dependability Analysis of Critical Systems -- Translating Pi-Calculus into LOTOS NT -- Systematic Translation Rules from astd to Event-B -- A CSP Approach to Control in Event-B -- Towards Probabilistic Modelling in Event-B -- Safe Commits for Transactional Featherweight Java -- Certified Absence of Dangling Pointers in a Language with Explicit Deallocation -- Integrating Implicit Induction Proofs into Certified Proof Environments.
Record Nr. UNINA-9910484039803321
Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2010
Materiale a stampa
Lo trovi qui: Univ. Federico II
Opac: Controlla la disponibilità qui
Interactive Theorem Proving [[electronic resource] ] : 7th International Conference, ITP 2016, Nancy, France, August 22-25, 2016, Proceedings / / edited by Jasmin Christian Blanchette, Stephan Merz
Interactive Theorem Proving [[electronic resource] ] : 7th International Conference, ITP 2016, Nancy, France, August 22-25, 2016, Proceedings / / edited by Jasmin Christian Blanchette, Stephan Merz
Edizione [1st ed. 2016.]
Pubbl/distr/stampa Cham : , : Springer International Publishing : , : Imprint : Springer, , 2016
Descrizione fisica 1 online resource (XVII, 502 p. 88 illus.)
Disciplina 004.015113
Collana Theoretical Computer Science and General Issues
Soggetto topico Machine theory
Computer science
Algorithms
Software engineering
Electronic digital computers—Evaluation
Computer simulation
Formal Languages and Automata Theory
Computer Science Logic and Foundations of Programming
Software Engineering
System Performance and Evaluation
Computer Modelling
ISBN 3-319-43144-7
Formato Materiale a stampa
Livello bibliografico Monografia
Lingua di pubblicazione eng
Record Nr. UNISA-996466035703316
Cham : , : Springer International Publishing : , : Imprint : Springer, , 2016
Materiale a stampa
Lo trovi qui: Univ. di Salerno
Opac: Controlla la disponibilità qui
Interactive Theorem Proving [[electronic resource] ] : 7th International Conference, ITP 2016, Nancy, France, August 22-25, 2016, Proceedings / / edited by Jasmin Christian Blanchette, Stephan Merz
Interactive Theorem Proving [[electronic resource] ] : 7th International Conference, ITP 2016, Nancy, France, August 22-25, 2016, Proceedings / / edited by Jasmin Christian Blanchette, Stephan Merz
Edizione [1st ed. 2016.]
Pubbl/distr/stampa Cham : , : Springer International Publishing : , : Imprint : Springer, , 2016
Descrizione fisica 1 online resource (XVII, 502 p. 88 illus.)
Disciplina 004.015113
Collana Theoretical Computer Science and General Issues
Soggetto topico Machine theory
Computer science
Algorithms
Software engineering
Electronic digital computers—Evaluation
Computer simulation
Formal Languages and Automata Theory
Computer Science Logic and Foundations of Programming
Software Engineering
System Performance and Evaluation
Computer Modelling
ISBN 3-319-43144-7
Formato Materiale a stampa
Livello bibliografico Monografia
Lingua di pubblicazione eng
Record Nr. UNINA-9910483136503321
Cham : , : Springer International Publishing : , : Imprint : Springer, , 2016
Materiale a stampa
Lo trovi qui: Univ. Federico II
Opac: Controlla la disponibilità qui
Modeling and verification of real-time systems [[electronic resource] ] : formalisms and software tools / / edited by Stephan Merz, Nicolas Navet
Modeling and verification of real-time systems [[electronic resource] ] : formalisms and software tools / / edited by Stephan Merz, Nicolas Navet
Pubbl/distr/stampa London, : ISTE
Descrizione fisica 1 online resource (395 p.)
Disciplina 004.01/51
004.0151
Altri autori (Persone) NavetNicolas
MerzStephan
Collana ISTE
Soggetto topico Real-time data processing
Computer software - Verification
Formal methods (Computer science)
ISBN 1-282-16492-9
9786612164927
0-470-61101-4
0-470-39359-9
Classificazione ST 170
ST 234
Formato Materiale a stampa
Livello bibliografico Monografia
Lingua di pubblicazione eng
Nota di contenuto Modeling and Verification of Real-Time Systems: Formalisms and Software Tools; Contents; Preface; Chapter 1. Time Petri Nets - Analysis Methods and Verification with TINA; 1.1. Introduction; 1.2. Time Petri nets; 1.2.1. Definition; 1.2.2. States and the state reachability relation; 1.2.3. Illustration; 1.2.4. Some general theorems; 1.3. State class graphs preserving markings and LTL properties; 1.3.1. State classes; 1.3.2. Illustration; 1.3.3. Checking the boundedness property on-the-fly; 1.3.4. Variations; 1.3.4.1. Multiple enabledness; 1.3.4.2. Preservation of markings (only)
1.4. State class graphs preserving states and LTL properties1.4.1. Clock domain; 1.4.2. Construction of the SSCG; 1.4.3. Variants; 1.5. State class graphs preserving states and branching properties; 1.6. Computing firing schedules; 1.6.1. Schedule systems; 1.6.2. Delays (relative dates) versus dates (absolute); 1.6.3. Illustration; 1.7. An implementation: the Tina environment; 1.8. The verification of SE-LTL formulae in Tina; 1.8.1. The temporal logic SE-LTL; 1.8.2. Preservation of LTL properties by tina constructions; 1.8.3. selt: the SE-LTL checker of Tina; 1.8.3.1. Verification technique
1.8.3.2. The selt logic1.9. Some examples of use of selt; 1.9.1. John and Fred; 1.9.1.1. Statement of problem; 1.9.1.2. Are the temporal constraints appearing in this scenario consistent?; 1.9.1.3. Is it possible that Fred took the bus and John the carpool?; 1.9.1.4. At which time could Fred have left home?; 1.9.2. The alternating bit protocol; 1.10. Conclusion; 1.11. Bibliography; Chapter 2. Validation of Reactive Systems by Means of Verification and Conformance Testing; 2.1. Introduction; 2.2. The IOSTS model; 2.2.1. Syntax of IOSTS; 2.2.2. Semantics of IOSTS; 2.3. Basic operations on IOSTS
2.3.1. Parallel product2.3.2. Suspension; 2.3.3. Deterministic IOSTS and determinization; 2.4. Verification and conformance testing with IOSTS; 2.4.1. Verification; 2.4.1.1. Verifying safety properties; 2.4.1.2. Verifying possibility properties; 2.4.1.3. Combining observers; 2.4.2. Conformance testing; 2.5. Test generation; 2.6. Test selection; 2.7. Conclusion and related work; 2.8. Bibliography; Chapter 3. An Introduction to Model Checking; 3.1. Introduction; 3.2. Example: control of an elevator; 3.3. Transition systems and invariant checking; 3.3.1. Transition systems and their runs
3.3.2. Verification of invariants3.4. Temporal logic; 3.4.1. Linear-time temporal logic; 3.4.2. Branching-time temporal logic; 3.4.3. ω-automata; 3.4.4. Automata and PTL; 3.5. Model checking algorithms; 3.5.1. Local PTL model checking; 3.5.2. Global CTL model checking; 3.5.3. Symbolic model checking algorithms; 3.6. Some research topics; 3.7. Bibliography; Chapter 4. Model Checking Timed Automata; 4.1. Introduction; 4.2. Timed automata; 4.2.1. Some notations; 4.2.2. Timed automata, syntax and semantics; 4.2.3. Parallel composition; 4.3. Decision procedure for checking reachability
4.4. Other verification problems
Record Nr. UNINA-9910139523503321
London, : ISTE
Materiale a stampa
Lo trovi qui: Univ. Federico II
Opac: Controlla la disponibilità qui
Modeling and verification of real-time systems [[electronic resource] ] : formalisms and software tools / / edited by Stephan Merz, Nicolas Navet
Modeling and verification of real-time systems [[electronic resource] ] : formalisms and software tools / / edited by Stephan Merz, Nicolas Navet
Pubbl/distr/stampa London, : ISTE
Descrizione fisica 1 online resource (395 p.)
Disciplina 004.01/51
004.0151
Altri autori (Persone) NavetNicolas
MerzStephan
Collana ISTE
Soggetto topico Real-time data processing
Computer software - Verification
Formal methods (Computer science)
ISBN 1-282-16492-9
9786612164927
0-470-61101-4
0-470-39359-9
Classificazione ST 170
ST 234
Formato Materiale a stampa
Livello bibliografico Monografia
Lingua di pubblicazione eng
Nota di contenuto Modeling and Verification of Real-Time Systems: Formalisms and Software Tools; Contents; Preface; Chapter 1. Time Petri Nets - Analysis Methods and Verification with TINA; 1.1. Introduction; 1.2. Time Petri nets; 1.2.1. Definition; 1.2.2. States and the state reachability relation; 1.2.3. Illustration; 1.2.4. Some general theorems; 1.3. State class graphs preserving markings and LTL properties; 1.3.1. State classes; 1.3.2. Illustration; 1.3.3. Checking the boundedness property on-the-fly; 1.3.4. Variations; 1.3.4.1. Multiple enabledness; 1.3.4.2. Preservation of markings (only)
1.4. State class graphs preserving states and LTL properties1.4.1. Clock domain; 1.4.2. Construction of the SSCG; 1.4.3. Variants; 1.5. State class graphs preserving states and branching properties; 1.6. Computing firing schedules; 1.6.1. Schedule systems; 1.6.2. Delays (relative dates) versus dates (absolute); 1.6.3. Illustration; 1.7. An implementation: the Tina environment; 1.8. The verification of SE-LTL formulae in Tina; 1.8.1. The temporal logic SE-LTL; 1.8.2. Preservation of LTL properties by tina constructions; 1.8.3. selt: the SE-LTL checker of Tina; 1.8.3.1. Verification technique
1.8.3.2. The selt logic1.9. Some examples of use of selt; 1.9.1. John and Fred; 1.9.1.1. Statement of problem; 1.9.1.2. Are the temporal constraints appearing in this scenario consistent?; 1.9.1.3. Is it possible that Fred took the bus and John the carpool?; 1.9.1.4. At which time could Fred have left home?; 1.9.2. The alternating bit protocol; 1.10. Conclusion; 1.11. Bibliography; Chapter 2. Validation of Reactive Systems by Means of Verification and Conformance Testing; 2.1. Introduction; 2.2. The IOSTS model; 2.2.1. Syntax of IOSTS; 2.2.2. Semantics of IOSTS; 2.3. Basic operations on IOSTS
2.3.1. Parallel product2.3.2. Suspension; 2.3.3. Deterministic IOSTS and determinization; 2.4. Verification and conformance testing with IOSTS; 2.4.1. Verification; 2.4.1.1. Verifying safety properties; 2.4.1.2. Verifying possibility properties; 2.4.1.3. Combining observers; 2.4.2. Conformance testing; 2.5. Test generation; 2.6. Test selection; 2.7. Conclusion and related work; 2.8. Bibliography; Chapter 3. An Introduction to Model Checking; 3.1. Introduction; 3.2. Example: control of an elevator; 3.3. Transition systems and invariant checking; 3.3.1. Transition systems and their runs
3.3.2. Verification of invariants3.4. Temporal logic; 3.4.1. Linear-time temporal logic; 3.4.2. Branching-time temporal logic; 3.4.3. ω-automata; 3.4.4. Automata and PTL; 3.5. Model checking algorithms; 3.5.1. Local PTL model checking; 3.5.2. Global CTL model checking; 3.5.3. Symbolic model checking algorithms; 3.6. Some research topics; 3.7. Bibliography; Chapter 4. Model Checking Timed Automata; 4.1. Introduction; 4.2. Timed automata; 4.2.1. Some notations; 4.2.2. Timed automata, syntax and semantics; 4.2.3. Parallel composition; 4.3. Decision procedure for checking reachability
4.4. Other verification problems
Record Nr. UNINA-9910830829303321
London, : ISTE
Materiale a stampa
Lo trovi qui: Univ. Federico II
Opac: Controlla la disponibilità qui
Modeling and verification of real-time systems [[electronic resource] ] : formalisms and software tools / / edited by Stephan Merz, Nicolas Navet
Modeling and verification of real-time systems [[electronic resource] ] : formalisms and software tools / / edited by Stephan Merz, Nicolas Navet
Pubbl/distr/stampa London, : ISTE
Descrizione fisica 1 online resource (395 p.)
Disciplina 004.01/51
004.0151
Altri autori (Persone) NavetNicolas
MerzStephan
Collana ISTE
Soggetto topico Real-time data processing
Computer software - Verification
Formal methods (Computer science)
ISBN 1-282-16492-9
9786612164927
0-470-61101-4
0-470-39359-9
Classificazione ST 170
ST 234
Formato Materiale a stampa
Livello bibliografico Monografia
Lingua di pubblicazione eng
Nota di contenuto Modeling and Verification of Real-Time Systems: Formalisms and Software Tools; Contents; Preface; Chapter 1. Time Petri Nets - Analysis Methods and Verification with TINA; 1.1. Introduction; 1.2. Time Petri nets; 1.2.1. Definition; 1.2.2. States and the state reachability relation; 1.2.3. Illustration; 1.2.4. Some general theorems; 1.3. State class graphs preserving markings and LTL properties; 1.3.1. State classes; 1.3.2. Illustration; 1.3.3. Checking the boundedness property on-the-fly; 1.3.4. Variations; 1.3.4.1. Multiple enabledness; 1.3.4.2. Preservation of markings (only)
1.4. State class graphs preserving states and LTL properties1.4.1. Clock domain; 1.4.2. Construction of the SSCG; 1.4.3. Variants; 1.5. State class graphs preserving states and branching properties; 1.6. Computing firing schedules; 1.6.1. Schedule systems; 1.6.2. Delays (relative dates) versus dates (absolute); 1.6.3. Illustration; 1.7. An implementation: the Tina environment; 1.8. The verification of SE-LTL formulae in Tina; 1.8.1. The temporal logic SE-LTL; 1.8.2. Preservation of LTL properties by tina constructions; 1.8.3. selt: the SE-LTL checker of Tina; 1.8.3.1. Verification technique
1.8.3.2. The selt logic1.9. Some examples of use of selt; 1.9.1. John and Fred; 1.9.1.1. Statement of problem; 1.9.1.2. Are the temporal constraints appearing in this scenario consistent?; 1.9.1.3. Is it possible that Fred took the bus and John the carpool?; 1.9.1.4. At which time could Fred have left home?; 1.9.2. The alternating bit protocol; 1.10. Conclusion; 1.11. Bibliography; Chapter 2. Validation of Reactive Systems by Means of Verification and Conformance Testing; 2.1. Introduction; 2.2. The IOSTS model; 2.2.1. Syntax of IOSTS; 2.2.2. Semantics of IOSTS; 2.3. Basic operations on IOSTS
2.3.1. Parallel product2.3.2. Suspension; 2.3.3. Deterministic IOSTS and determinization; 2.4. Verification and conformance testing with IOSTS; 2.4.1. Verification; 2.4.1.1. Verifying safety properties; 2.4.1.2. Verifying possibility properties; 2.4.1.3. Combining observers; 2.4.2. Conformance testing; 2.5. Test generation; 2.6. Test selection; 2.7. Conclusion and related work; 2.8. Bibliography; Chapter 3. An Introduction to Model Checking; 3.1. Introduction; 3.2. Example: control of an elevator; 3.3. Transition systems and invariant checking; 3.3.1. Transition systems and their runs
3.3.2. Verification of invariants3.4. Temporal logic; 3.4.1. Linear-time temporal logic; 3.4.2. Branching-time temporal logic; 3.4.3. ω-automata; 3.4.4. Automata and PTL; 3.5. Model checking algorithms; 3.5.1. Local PTL model checking; 3.5.2. Global CTL model checking; 3.5.3. Symbolic model checking algorithms; 3.6. Some research topics; 3.7. Bibliography; Chapter 4. Model Checking Timed Automata; 4.1. Introduction; 4.2. Timed automata; 4.2.1. Some notations; 4.2.2. Timed automata, syntax and semantics; 4.2.3. Parallel composition; 4.3. Decision procedure for checking reachability
4.4. Other verification problems
Record Nr. UNINA-9910841347503321
London, : ISTE
Materiale a stampa
Lo trovi qui: Univ. Federico II
Opac: Controlla la disponibilità qui