Browse
Publications
Preprints
About
About UCL Open: Env.
Aims and Scope
Editorial Board
Indexing
APCs
How to cite
Publishing policies
Editorial policy
Peer review policy
Equality, Diversity & Inclusion
About UCL Press
Contact us
For authors
Information for authors
How it works
Benefits of publishing with us
Submit
How to submit
Preparing your manuscript
Article types
Open Data
ORCID
APCs
Contributor agreement
For reviewers
Information for reviewers
Review process
How to peer review
Peer review policy
My ScienceOpen
Sign in
Register
Dashboard
Search
Browse
Publications
Preprints
About
About UCL Open: Env.
Aims and Scope
Editorial Board
Indexing
APCs
How to cite
Publishing policies
Editorial policy
Peer review policy
Equality, Diversity & Inclusion
About UCL Press
Contact us
For authors
Information for authors
How it works
Benefits of publishing with us
Submit
How to submit
Preparing your manuscript
Article types
Open Data
ORCID
APCs
Contributor agreement
For reviewers
Information for reviewers
Review process
How to peer review
Peer review policy
My ScienceOpen
Sign in
Register
Dashboard
Search
45
views
3
references
Top references
cited by
0
Cite as...
0 reviews
Review
0
comments
Comment
0
recommends
+1
Recommend
0
collections
Add to
0
shares
Share
Twitter
Sina Weibo
Facebook
Email
2,029
similar
All similar
Record
: found
Abstract
: not found
Book Chapter
: not found
NASA Formal Methods: 6th International Symposium, NFM 2014, Houston, TX, USA, April 29 – May 1, 2014. Proceedings
On Proving Recoverability of Smart Electrical Grids
other
Author(s):
Seppo Horsmanheimo
,
Maryam Kamali
,
Mikko Kolehmainen
,
Mats Neovius
,
Luigia Petre
,
Mauno Rönkkö
,
Petter Sandvik
Publication date
(Print):
2014
Publisher:
Springer International Publishing
Read this book at
Publisher
Buy book
Review
Review book
Invite someone to review
Bookmark
Cite as...
There is no author summary for this book yet. Authors can add summaries to their books on ScienceOpen to make them more accessible to a non-specialist audience.
Related collections
Smart Contracts Programming Languages
Most cited references
3
Record
: found
Abstract
: not found
Book Chapter
: not found
Formal Analysis of BPMN Models Using Event-B
Jeremy Bryans
,
Wei Wei
(2010)
0
comments
Cited
6
times
– based on
0
reviews
Bookmark
Record
: found
Abstract
: not found
Book Chapter
: not found
Applying Atomicity and Model Decomposition to a Space Craft System in Event-B
Asieh Salehi Fathabadi
,
Abdolbaghi Rezazadeh
,
Michael Butler
(2011)
0
comments
Cited
2
times
– based on
0
reviews
Bookmark
Record
: found
Abstract
: not found
Book Chapter
: not found
Node Coordination in Peer-to-Peer Networks
Luigia Petre
,
Petter Sandvik
,
Kaisa Sere
(2012)
0
comments
Cited
1
times
– based on
0
reviews
Bookmark
All references
Author and book information
Book Chapter
Publication date (Print):
2014
Pages
: 77-91
DOI:
10.1007/978-3-319-06200-6_6
SO-VID:
8b714305-311f-4132-9002-bd32db6d1cb0
History
Data availability:
Comments
Comment on this book
Sign in to comment
Book chapters
pp. 1
DO-333 Certification Case Studies
pp. 16
A Compositional Monitoring Framework for Hard Real-Time Systems
pp. 31
Leadership Election: An Industrial SoS Application of Compositional Deadlock Verification
pp. 46
Verification of Certifying Computations through AutoCorres and Simpl
pp. 62
Distinguishing Sequences for Partially Specified FSMs
pp. 77
On Proving Recoverability of Smart Electrical Grids
pp. 92
Providing Early Warnings of Specification Problems
pp. 98
Mechanized, Compositional Verification of Low-Level Code
pp. 113
Formally Verified Computation of Enclosures of Solutions of Ordinary Differential Equations
pp. 128
On the Quantum Formalization of Coherent Light in HOL
pp. 143
Refinement Types for tla +
pp. 158
Using Lightweight Theorem Proving in an Asynchronous Systems Context
pp. 173
JKelloy: A Proof Assistant for Relational Specifications of Java Programs
pp. 188
Verifying Hybrid Systems Involving Transcendental Functions
pp. 203
Verifying Nonpolynomial Hybrid Systems by Qualitative Abstraction and Automated Theorem Proving
pp. 209
Combining PVSio with Stateflow
pp. 215
Qed. Computing What Remains to Be Proved
pp. 230
Warps and Atomics: Beyond Barrier Synchronization in the Verification of GPU Kernels
pp. 246
Testing-Based Compiler Validation for Synchronous Languages
pp. 252
Automated Testcase Generation for Numerical Support Functions in Embedded Systems
pp. 258
REFINER: Towards Formal Verification of Model Transformations
pp. 264
Designing a Deadlock-Free Train Scheduler: A Model Checking Approach
pp. 270
A Synthesized Algorithm for Interactive Consistency
pp. 285
Energy-Utility Quantiles
pp. 300
Incremental Verification of Compiler Optimizations
pp. 307
Memory Efficient Data Structures for Explicit Verification of Timed Systems
pp. 313
The Gradual Verifier
pp. 328
Synthesizing Predicates from Abstract Domain Losses
pp. 343
Formal Verification of kLIBC with the WP Frama-C Plug-in
Similar content
2,029
Recoverably and destructively deformed domain structures in elongation process of thermoplastic elastomer analyzed by graph theory
Authors:
Hiroshi Morita
,
Ayano Miyamoto
,
Motoko Kotani
Secure Storage using Maximally Recoverable Locally Repairable Codes
Authors:
Tim Janz
,
Hedongliang Liu
,
Rawad Bitar
…
Predictors of Recoverability of Renal Function after Pyeloplasty in Adults with Ureteropelvic Junction Obstruction.
Authors:
Xiao-Dong Li
,
Yu-Peng Wu
,
Yong Wei
…
See all similar