scholarly journals Formal Analysis of Fairness for Optimistic Multiparty Contract Signing Protocol

2014 ◽  
Vol 2014 ◽  
pp. 1-10
Author(s):  
Xiaoru Li ◽  
Xiaohong Li ◽  
Guangquan Xu ◽  
Jing Hu ◽  
Zhiyong Feng
Keyword(s):  
State Space ◽  
Temporal Logic ◽  
Formal Analysis ◽  
Modeling Language ◽  
Reduction Algorithm ◽  
State Reduction ◽  
State Space Explosion ◽  
Contract Signing ◽  
Time And Space Complexity ◽  
Redundant States

Optimistic multiparty contract signing (OMPCS) protocols are proposed for exchanging multiparty digital signatures in a contract. Compared with general two-party exchanging protocols, such protocols are more complicated, because the number of protocol messages and states increases considerably when signatories increase. Moreover, fairness property in such protocols requires protection from each signatory rather than from an external hostile agent. It thus presents a challenge for formal verification. In our analysis, we employ and combine the strength of extended modeling language CSP# and linear temporal logic (LTL) to verify the fairness of OMPCS protocols. Furthermore, for solving or mitigating the state space explosion problem, we set a state reduction algorithm which can decrease the redundant states properly and reduce the time and space complexity greatly. Finally, this paper illustrates the feasibility of our approach by analyzing the GM and CKS protocols, and several fairness flaws have been found in certain computation times.

The Quantitative Assessment of Domino Effects Based on Stochastic Petri Nets

2008 ◽  
Vol 44-46 ◽  
pp. 537-544
Author(s):  
Shi Yi Bao ◽  
Jian Xin Zhu ◽  
Li J. Wang ◽  
Ning Jiang ◽  
Zeng Liang Gao
Keyword(s):  
Petri Nets ◽  
State Space ◽  
Petri Net ◽  
Quantitative Assessment ◽  
Stochastic Petri Nets ◽  
Industrial Park ◽  
Domino Effect ◽  
State Space Explosion ◽  
Stochastic Petri Net ◽  
Chemical Industrial Park

The quantitative analysis of “domino” effects is one of the main aspects of hazard assessment in chemical industrial park. This paper demonstrates the application of heterogeneous stochastic Petri net modeling techniques to the quantitative assessment of the probabilities of domino effects of major accidents in chemical industrial park. First, five events are included in the domino effect models of major accidents: pool fire, explosion, boiling liquid expanding vapour explosion (BLEVE) giving rise to a fragment, jet fire and delayed explosion of a vapour cloud. Then, the domino effect models are converted into Generalized Stochastic Petri net (GSPN) in which the probability of the domino effect is calculated automatically. The Stochastic Petri nets’ models, which are state-space based ones, increase the modeling flexibility but create the state-space explosion problems. Finally, in order to alleviate the state-space explosion problems of GSPN models, this paper employs Stochastic Wellformed Net (SWN), a particular class of High-Level (colored) SPN. To conduct a case study on a chemical industrial park, the probability of domino effects of major accidents is calculated by using the GSPN model and SWN model in this paper.

scholarly journals The temporal logic of coalgebras via Galois algebras

2002 ◽  
Vol 12 (6) ◽  
pp. 875-903 ◽  
Author(s):  
BART JACOBS
Keyword(s):  
State Space ◽  
Temporal Logic ◽  
Metric Spaces ◽  
Linear Temporal Logic ◽  
The State ◽  
Temporal Logics ◽  
Computation Tree Logic ◽  
Computation Tree ◽  
Polynomial Functors

This paper introduces a temporal logic for coalgebras. Nexttime and lasttime operators are defined for a coalgebra, acting on predicates on the state space. They give rise to what is called a Galois algebra. Galois algebras form models of temporal logics like Linear Temporal Logic (LTL) and Computation Tree Logic (CTL). The mapping from coalgebras to Galois algebras turns out to be functorial, yielding indexed categorical structures. This construction gives many examples, for coalgebras of polynomial functors on sets. More generally, it will be shown how ‘fuzzy’ predicates on metric spaces, and predicates on presheaves, yield indexed Galois algebras, in basically the same coalgebraic manner.

scholarly journals Inductive Method for Evaluating RFID Security Protocols

2019 ◽  
Vol 2019 ◽  
pp. 1-8
Author(s):  
Defu Liu ◽  
Guowu Yang ◽  
Yong Huang ◽  
Jinzhao Wu
Keyword(s):  
State Space ◽  
Denial Of Service ◽  
Difficult Problem ◽  
Mathematical Induction ◽  
Security And Privacy ◽  
Inductive Method ◽  
Denial Of Service Attacks ◽  
State Space Explosion ◽  
Replay Attacks ◽  
Rfid System

Authentication protocol verification is a difficult problem. The problem of “state space explosion” has always been inevitable in the field of verification. Using inductive characteristics, we combine mathematical induction and model detection technology to solve the problem of “state space explosion” in verifying the OSK protocol and VOSK protocol of RFID system. In this paper, the security and privacy of protocols in RFID systems are studied and analysed to verify the effectiveness of the combination of mathematical induction and model detection. We design a (r,s,t)-security experiment on the basis of privacy experiments in the RFID system according to the IND-CPA security standard in cryptography, using mathematical induction to validate the OSK protocol and VOSK protocol. Finally, the following conclusions are presented. The OSK protocol cannot resist denial of service attacks or replay attacks. The VOSK protocol cannot resist denial of service attacks but can resist replay attacks. When there is no limit on communication, the OSK protocol and VOSK protocol possess (r,s,t)-privacy; that is to say they can resist denial of service attacks.

scholarly journals Formal Analysis of Multiparty Contract Signing

2006 ◽  
Vol 36 (1-2) ◽  
pp. 39-83 ◽  
Author(s):  
Rohit Chadha ◽  
Steve Kremer ◽  
Andre Scedrov
Keyword(s):  
Formal Analysis ◽  
Contract Signing

scholarly journals Best-First Heuristic Search for Multicore Machines

2010 ◽  
Vol 39 ◽  
pp. 689-743 ◽  
Author(s):  
E. Burns ◽  
S. Lemons ◽  
W. Ruml ◽  
R. Zhou
Keyword(s):  
State Space ◽  
Shared Memory ◽  
Temporal Logic ◽  
Heuristic Search ◽  
Multicore Processors ◽  
The State ◽  
New Method ◽  
Parallel Search ◽  
Empirical Comparison ◽  
Best First Search

To harness modern multicore processors, it is imperative to develop parallel versions of fundamental algorithms. In this paper, we compare different approaches to parallel best-first search in a shared-memory setting. We present a new method, PBNF, that uses abstraction to partition the state space and to detect duplicate states without requiring frequent locking. PBNF allows speculative expansions when necessary to keep threads busy. We identify and fix potential livelock conditions in our approach, proving its correctness using temporal logic. Our approach is general, allowing it to extend easily to suboptimal and anytime heuristic search. In an empirical comparison on STRIPS planning, grid pathfinding, and sliding tile puzzle problems using 8-core machines, we show that A*, weighted A* and Anytime weighted A* implemented using PBNF yield faster search than improved versions of previous parallel search proposals.

scholarly journals Hybrid SynchAADL: Modeling and Formal Analysis of Virtually Synchronous CPSs in AADL

2021 ◽  
pp. 491-504
Author(s):  
Jaehun Lee ◽  
Sharon Kim ◽  
Kyungmin Bae ◽  
Peter Csaba Ölveczky
Keyword(s):  
Formal Analysis ◽  
Cyber Physical Systems ◽  
Modeling Language ◽  
Analysis Tool ◽  
Physical Systems ◽  
Complex Control ◽  
Control Programs ◽  
Network Delays ◽  
Execution Times

AbstractWe present the $$\textsc {Hybrid}\textsc {Synch}\textsc {AADL}$$ H Y B R I D S Y N C H AADL modeling language and formal analysis tool for virtually synchronous cyber-physical systems with complex control programs, continuous behaviors, bounded clock skews, network delays, and execution times. We leverage the Hybrid PALS equivalence, so that it is sufficient to model and verify the simpler underlying synchronous designs. We define the $$\textsc {Hybrid}\textsc {Synch}\textsc {AADL}$$ H Y B R I D S Y N C H AADL language as a sublanguage of the avionics modeling standard AADL for modeling such designs in AADL, and demonstrate the effectiveness of $$\textsc {Hybrid}\textsc {Synch}\textsc {AADL}$$ H Y B R I D S Y N C H AADL on a number of applications.

Sign in / Sign up

Export Citation Format

Share Document