scholarly journals The Railroad Crossing Problem: Towards semantics of timed algorithms and their model checking in high level languages

1997 ◽  
pp. 201-212 ◽  
Author(s):  
Danièle Beauquier ◽  
Anatol Slissenko
Keyword(s):  
Model Checking ◽  
High Level

Execution-Based Model Checking for High-Level Designs

2011 ◽  
pp. 51-66
Author(s):  
Sudipta Kundu ◽  
Sorin Lerner ◽  
Rajesh K. Gupta
Keyword(s):  
Model Checking ◽  
High Level

scholarly journals High-Level Petri Net Model Checking with AlPiNA

2011 ◽  
Vol 113 (3-4) ◽  
pp. 229-264 ◽  
Author(s):  
Steve Hostettler ◽  
Alexis Marechal ◽  
Alban Linard ◽  
Matteo Risoldi ◽  
Didier Buchs
Keyword(s):  
Model Checking ◽  
Petri Net ◽  
High Level

scholarly journals Partial-Order Reduction for Parity Games with an Application on Parameterised Boolean Equation Systems

2020 ◽  
pp. 307-324 ◽  
Author(s):  
Thomas Neele ◽  
Tim A. C. Willemse ◽  
Wieger Wesselink
Keyword(s):  
Fixed Point ◽  
Model Checking ◽  
Partial Order ◽  
Order Reduction ◽  
Partial Order Reduction ◽  
State Space Explosion ◽  
Boolean Equation ◽  
Parity Games ◽  
High Level ◽  
Established Technique

Abstract Partial-order reduction (POR) is a well-established technique to combat the problem of state-space explosion. We propose POR techniques that are sound for parity games, a well-established formalism for solving a variety of decision problems. As a consequence, we obtain the first POR method that is sound for model checking for the full modal $$\mu $$-calculus. Our technique is applied to, and implemented for the fixed point logic called parameterised Boolean equation systems, which provides a high-level representation of parity games. Experiments indicate that substantial reductions can be achieved.

A Method to Analyze Predicate Transition Nets Using SPIN Model Checker

2017 ◽  
Vol 27 (09n10) ◽  
pp. 1455-1481 ◽  
Author(s):  
Dewan Mohammad Moksedul Alam ◽  
Xudong He
Keyword(s):  
Model Checking ◽  
Formal Method ◽  
Expressive Power ◽  
Spin Model ◽  
Analysis Method ◽  
Detailed Model ◽  
Liveness Properties ◽  
High Level ◽  
Concurrent And Distributed Systems ◽  
Spin Model Checker

High-level Petri nets (HLPNs) are a formal method for studying concurrent and distributed systems and have been widely used in many application domains. However, their strong expressive power hinders their analyzability. In this paper, we present a new transformational analysis method for analyzing a special class of HLPNs — predicate transition (PrT) nets. This method extends and improves our prior results by covering more PrT net features including full first-order logic formulas and exploring additional alternative translation schemes. This new analysis method is supported by a tool chain — front-end PIPE[Formula: see text] for creating and simulating PrT nets and back-end SPIN for model checking safety and liveness properties. We have applied this method to two benchmark systems used in annual Petri net model checking contest 2015. We discuss several properties and show the detailed model checking results in one system.

scholarly journals Infinite-state high-level MSCs: Model-checking and realizability

2006 ◽  
Vol 72 (4) ◽  
pp. 617-647 ◽  
Author(s):  
Blaise Genest ◽  
Anca Muscholl ◽  
Helmut Seidl ◽  
Marc Zeitoun
Keyword(s):  
Model Checking ◽  
High Level ◽  
Infinite State
Sign in / Sign up

Export Citation Format

Share Document