scholarly journals SE-LTL Model-checking on Timed GRAFCETS via ε-TPN

2019 ◽  
pp. 1-12
Author(s):  
Médésu Sogbohossou ◽  
Rodrigue Yehouessi ◽  
Tahirou Djara ◽  
Theophile Aballo ◽  
Antoine Vianou
Keyword(s):  
Model Checking ◽  
State Space ◽  
Temporal Logic ◽  
Petri Net ◽  
Formal Language ◽  
Time Constraints ◽  
Automated Systems ◽  
Usual Practice ◽  
Time Petri Net ◽  
Ltl Model Checking

The GRAFCET standard (IEC 60848) is one of the convenient formalisms used to specify the behaviour of the automated systems. Being just a semi-formal language, the usual practice is to go through an unambiguous formalism such as time Petri net (TPN) in order to validate a specification expressed by a GRAFCET model. In this paper, we propose how to perform model-checking on a GRAFCET model translated into a ε-TPN, specifically with State-Event Linear Temporal Logic (SE-LTL). Especially, we provide a way to take into account quantitative time constraints verification by integrating observers in the ε-TPN intermediate model, since TPN state-space abstractions do not allow directly such kind of model-checking.

Modeling security properties of authentication of cryptographic protocols using spin formal verification

2020 ◽  
pp. 21-25
Author(s):  
E.A. Perevyshina ◽  
L.K. Babenko
Keyword(s):  
Model Checking ◽  
Formal Verification ◽  
Temporal Logic ◽  
Cryptographic Protocols ◽  
Wide Range ◽  
Security Properties ◽  
Verification Tools ◽  
The Stability ◽  
Security Property ◽  
Ltl Model Checking

To assess the quality and security of cryptographic protocols, we use various formal verification tools, such as Scyther tool, Avispa, ProVerif. these formal verifiers can check the protocol for vulnerability to attacks on secrecy and authentication, as these are the most prevalent attacks on protocols. However, this is not enough to fully analyze the security of the protocol. In this article, we will use linear temporal logic (LTL) model checking with SPIN. This tool, unlike the formal verifiers listed above, is not designed for a specific application in the context of cryptographic protocols; however, it has a very wide range of possibilities. In particular, for each security property, it is possible to describe the behavior of an attacker and test for the stability of the protocol model to its various attacks. The purpose of this work is to describe the developed methodology for verifying the security of authentication properties using the SPIN verifier.

scholarly journals Converging from branching to linear metrics on Markov chains

2017 ◽  
Vol 29 (1) ◽  
pp. 3-37 ◽  
Author(s):  
GIORGIO BACCI ◽  
GIOVANNI BACCI ◽  
KIM G. LARSEN ◽  
RADU MARDARE
Keyword(s):  
Model Checking ◽  
Markov Chains ◽  
Temporal Logic ◽  
Polynomial Time ◽  
Linear Time ◽  
Linear Temporal Logic ◽  
Np Hard ◽  
Branching Time ◽  
Threshold Problem ◽  
Ltl Model Checking

We study two well-known linear-time metrics on Markov chains (MCs), namely, the strong and strutter trace distances. Our interest in these metrics is motivated by their relation to the probabilistic linear temporal logic (LTL)-model checking problem: we prove that they correspond to the maximal differences in the probability of satisfying the same LTL and LTL−X(LTL without next operator) formulas, respectively.The threshold problem for these distances (whether their value exceeds a given threshold) is NP-hard and not known to be decidable. Nevertheless, we provide an approximation schema where each lower and upper approximant is computable in polynomial time in the size of the MC.The upper approximants are bisimilarity-like pseudometrics (hence, branching-time distances) that converge point-wise to the linear-time metrics. This convergence is interesting in itself, because it reveals a non-trivial relation between branching and linear-time metric-based semantics that does not hold in equivalence-based semantics.

scholarly journals State space computation and analysis of Time Petri Nets

2006 ◽  
Vol 6 (3) ◽  
pp. 301-320 ◽  
Author(s):  
GUILLAUME GARDEY ◽  
OLIVIER H. ROUX ◽  
OLIVIER F. ROUX
Keyword(s):  
Petri Nets ◽  
State Space ◽  
Petri Net ◽  
Timed Automata ◽  
Reactive Systems ◽  
Time Petri Nets ◽  
Classical State ◽  
Time Petri Net ◽  
Reduction Methods ◽  
Timed Automaton

The theory of Petri Nets provides a general framework to specify the behaviors of real-time reactive systems and Time Petri Nets were introduced to take also temporal specifications into account. We present in this paper a forward zone-based algorithm to compute the state space of a bounded Time Petri Net: the method is different and more efficient than the classical State Class Graph. We prove the algorithm to be exact with respect to the reachability problem. Furthermore, we propose a translation of the computed state space into a Timed Automaton, proved to be timed bisimilar to the original Time Petri Net. As the method produce a single Timed Automaton, syntactical clocks reduction methods (DAWS and YOVINE for instance) may be applied to produce an automaton with fewer clocks. Then, our method allows to model-check T-TPN by the use of efficient Timed Automata tools.

Web Service Composition Verification of Safety Properties: An Approach Based on Predicate Abstraction

2013 ◽  
Vol 753-755 ◽  
pp. 2892-2899
Author(s):  
Yu Ying Wang ◽  
Ping Chen
Keyword(s):  
Model Checking ◽  
State Space ◽  
Web Service ◽  
Petri Net ◽  
Service Composition ◽  
Web Service Composition ◽  
Predicate Abstraction ◽  
Colored Petri Net ◽  
Safety Properties ◽  
State Space Explosion

The biggest problem in model checking is state space explosion. Using predicate abstraction, state space of colored Petri net models were abstracted, and an algorithm was proposed to obtain the abstracted state space of a colored Petri net model without its original state space generated. A method to verify safety properties of Web service composition by abstracted state space was proposed. The problem of state space explosion is solved to some extend in this way. Finally an application of the method is illustrated with an example, which its efficiency shown.

scholarly journals Automated Logical Verification based on Trace Abstractions

1995 ◽  
Vol 2 (53) ◽  
Author(s):  
Nils Klarlund ◽  
Mogens Nielsen ◽  
Kim Sunesen
Keyword(s):  
Distributed Systems ◽  
Model Checking ◽  
State Space ◽  
Temporal Logic ◽  
Second Order ◽  
Order Logic ◽  
Verification Problem ◽  
Finite State ◽  
Second Order Logic ◽  
Monadic Second Order Logic

We propose a new and practical framework for integrating the behavioral<br />reasoning about distributed systems with model-checking methods.<br />Our proof methods are based on trace abstractions, which relate the<br />behaviors of the program and the specification. We show that for finite-state<br />systems such symbolic abstractions can be specified conveniently in<br />Monadic Second-Order Logic (M2L). Model-checking is then made possible<br />by the reduction of non-determinism implied by the trace abstraction.<br />Our method has been applied to a recent verification problem by Broy<br />and Lamport. We have transcribed their behavioral description of a distributed<br />program into temporal logic and verified it against another distributed<br />system without constructing the global program state space. The<br />reasoning is expressed entirely within M2L and is carried out by a decision<br />procedure. Thus M2L is a practical vehicle for handling complex temporal<br />logic specifications, where formulas decided by a push of a button are as<br />long as 10-15 pages.

SPECIFYING AND VERIFYING TEMPORAL BEHAVIOR OF HIGH ASSURANCE SYSTEMS USING REACHABILITY TREE LOGIC

1999 ◽  
Vol 09 (02) ◽  
pp. 233-249
Author(s):  
STEPHEN J. H. YANG ◽  
WILLIAM CHU ◽  
JONATHAN LEE
Keyword(s):  
Model Checking ◽  
Petri Nets ◽  
Petri Net ◽  
System Modeling ◽  
Model System ◽  
Temporal Behavior ◽  
Time Petri Net ◽  
High Assurance ◽  
System Requirements ◽  
Reachability Tree

This paper presents our reachability tree logic (RTL) and its integration with time Petri nets to specify and verify the temporal behavior of high assurance systems. The specification phase begins with a system modeling to model system requirements into a time Petri net N and construct a reachability tree RT of N. We then use RTL to specify the desired temporal behavior as formula F. The verification phase uses a model-checking algorithm to check whether RT can satisfy F, that is to find firing sequences to satisfy F. If F is not satisfied, we then modify N into N′ and obtain a RT′ of the modified N′. The modification (refinement) continues until the modified RT′ can satisfy F. In addition, we will demonstrate how to reduce the complexity of model-checking by using our RTL-based algorithm. We have implemented a specification and verification toolkit called NCUPN (National Central University Petri Nets toolkit) using Java. NCUPN is now available on the Internet via

Sign in / Sign up

Export Citation Format

Share Document