Filters








88 Hits in 3.3 sec

LTSmin: High-Performance Language-Independent Model Checking [chapter]

Gijs Kant, Alfons Laarman, Jeroen Meijer, Jaco van de Pol, Stefan Blom, Tom van Dijk
2015 Lecture Notes in Computer Science  
In LTSmin, the modelling languages and the model checking algorithms are connected through a Partitioned Next-State Interface (Pins), that allows to abstract away from language details in the implementation  ...  In recent years, the LTSmin model checker has been extended with support for several new modelling languages, including probabilistic (Mapa) and timed systems (Uppaal).  ...  LTSmin has been extended with a Mapa language module based on Scoop, allowing for high-performance state space generation for Mapa specifications.  ... 
doi:10.1007/978-3-662-46681-0_61 fatcat:zrnithyfxrh4dpyou2mw22axva

LTSmin: Distributed and Symbolic Reachability [chapter]

Stefan Blom, Jaco van de Pol, Michael Weber
2010 Lecture Notes in Computer Science  
This research has been partially funded by the EC project EC-MOAN (FP6-NEST 043235) 1 http://fmt.cs.utwente.nl/tools/ltsmin/, current version: 1.5, available as open-source software.  ...  Motivation: A Modular, High-Performance Model Checker The LTSMIN toolset provides a new level of modular design to high-performance model checkers.  ...  These models are typically generated from specifications in high-level languages.  ... 
doi:10.1007/978-3-642-14295-6_31 fatcat:aunfmoqinrcfrdbt5o5gwtudoy

SpinS: Extending LTSmin with Promela through SpinJa

Freark van der Berg, Alfons Laarman
2013 Electronical Notes in Theoretical Computer Science  
We show how Promela can be supported by the high-performance generic model checker LTSmin. The success of the Spin model checker has made Promela an important modeling language.  ...  LTSmin aims at language-independence through the definition of the generic Partitioned Next-State Interface (pins).  ...  His ideas and efforts laid the basis for the current state of LTSmin. We thank Stefan Blom for his work on our distributed and symbolic backends.  ... 
doi:10.1016/j.entcs.2013.07.007 fatcat:7rwe3mgnxnbttaeh3eyxof4yza

Symbolic Reachability Analysis of B through ProB and LTSmin [article]

Jens Bendisposto, Philipp Koerner, Michael Leuschel, Jeroen Meijer, Jaco van de Pol, Helen Treharne, Jorden Whitefield
2016 arXiv   pre-print
The symbolic analysis is implemented by linking ProB to LTSmin, a high-performance language independent model checker.  ...  ProB supports model checking of several formal specification languages such as B, Event-B, Z and TLA.  ...  LTSmin is a high-performance language-independent model checker that allows numerous modelling language front-ends to be connected to various analysis algorithms, through a common interface, as shown in  ... 
arXiv:1603.04401v1 fatcat:5jxbdzggurf7xfex5xh2tyi7fu

Symbolic Reachability Analysis of B Through ProB and LTSmin [chapter]

Jens Bendisposto, Philipp Körner, Michael Leuschel, Jeroen Meijer, Jaco van de Pol, Helen Treharne, Jorden Whitefield
2016 Lecture Notes in Computer Science  
The symbolic analysis is implemented by linking ProB to LTSmin, a high-performance language independent model checker.  ...  ProB supports model checking of several formal specification languages such as B, Event-B, Z and Tla + .  ...  LTSmin is a high-performance language-independent model checker that allows numerous modelling language front-ends to be connected to various analysis algorithms, through a common interface, as shown in  ... 
doi:10.1007/978-3-319-33693-0_18 fatcat:wwtyyfeuebabpnww74a2dwygwe

State-of-the-Art Model Checking for B and Event-B Using ProB and LTSmin [chapter]

Philipp Körner, Michael Leuschel, Jeroen Meijer
2018 Lecture Notes in Computer Science  
In previous work, we presented symbolic reachability analysis by linking ProB, an animator and model checker for B and Event-B, and LTSmin, a language-independent model checker offering state-ofthe-art  ...  model checking algorithms.  ...  LTSmin LTSmin [9] is an open-source, language-independent, state-of-the-art model checker that offers many model checking algorithms including partial order reduction, LTL verification and distributed  ... 
doi:10.1007/978-3-319-98938-9_16 fatcat:7dtihghchzg5xc25lgg6ulshyu

Multi-core and/or Symbolic Model Checking

Tom Van Dijk, Alfons Laarman, Jaco Van De Pol
2012 Electronic Communications of the EASST  
We review our progress in high-performance model checking. Our multi-core model checker is based on a scalable hash-table design and parallel random-walk traversal.  ...  The LTSmin tool is based on the PINS architecture, decoupling model checking algorithms from the input specification language.  ...  For full flexibility, we want to decouple high-performance model checking algorithms from particular specification languages.  ... 
doi:10.14279/tuj.eceasst.53.773 dblp:journals/eceasst/DijkLP12 fatcat:rl5gppktvbdrrnissitxywxpte

Software Architecture of Modern Model Checkers [chapter]

Fabrice Kordon, Michael Leuschel, Jaco van de Pol, Yann Thierry-Mieg
2019 Lecture Notes in Computer Science  
Automated formal verification using model checking is a mature field with many tools available. We summarize the recent trends in the design and architecture of model checking tools.  ...  An important design goal of modern model checkers is to support many input languages (front-end) and many verification strategies (back-end), and to allow arbitrary combinations of them.  ...  We also thank Stefan Blom, Michael Weber, Elwin Pater for setting up the architecture of LTSmin and Alfons Laarman, Tom van Dijk, Jeroen Meijer for recent developments on multicore and symbolic LTSmin.  ... 
doi:10.1007/978-3-319-91908-9_20 fatcat:seh3tr6qdrf2lovprttf5msm2m

Sylvan: Multi-Core Decision Diagrams [chapter]

Tom van Dijk, Jaco van de Pol
2015 Lecture Notes in Computer Science  
We also demonstrate that the parallelization of symbolic model checking for explicit-state modeling languages with an on-the-fly next-state function, as supported by LTSmin, scales well.  ...  We show that this results in an improved speedup using the model checking toolset LTSmin.  ...  LTSmin and partitioned transition relations The model checking toolset LTSmin 1 provides a language independent Partitioned Next-State Interface (Pins), which connects various input languages to model  ... 
doi:10.1007/978-3-662-46681-0_60 fatcat:47svdkgo75bgld46bk57lanngy

Symbolic Model-Checking Using ITS-Tools [chapter]

Yann Thierry-Mieg
2015 Lecture Notes in Computer Science  
Using model transformations to a Guarded Action Language (GAL) as intermediate format, ITS-tools can analyze third party (Uppaal, Spin, Divine...) specifications.  ...  We present verification toolset ITS-tools, featuring a symbolic modelchecking back-end engine based on hierarchical set decision diagrams (SDD) that supports reachability, CTL and LTL model-checking and  ...  We leverage model transformation technology to support model-checking of domain specific languages (DSL).  ... 
doi:10.1007/978-3-662-46681-0_20 fatcat:wuraebux5rguvm5k2gxdb2zpg4

Generating and Solving Symbolic Parity Games

Gijs Kant, Jaco van de Pol
2014 Electronic Proceedings in Theoretical Computer Science  
memory efficient) than the symbolic model checker NuSMV.  ...  We performed two case studies on modular specifications, that demonstrate that the new method has better time and memory performance than existing PBES based tools and can be faster (but slightly less  ...  The combination of these tools allows for high performance model checking of large systems, using MDDs as data structures.  ... 
doi:10.4204/eptcs.159.2 fatcat:oyzkxkthrjdfpdr7yhxlcjkevy

MCC'2017 – The Seventh Model Checking Contest [chapter]

Fabrice Kordon, Hubert Garavel, Lom Messan Hillah, Emmanuel Paviot-Adet, Loïg Jezequel, Francis Hulin-Hubard, Elvio Amparore, Marco Beccuti, Bernard Berthomieu, Hugues Evrard, Peter G. Jensen, Didier Le Botlan (+6 others)
2018 Lecture Notes in Computer Science  
and model checking.  ...  Created in 2011, the Model Checking Contest (MCC) is an annual competition dedicated to provide a fair evaluation of software tools that verify concurrent systems using state-space exploration techniques  ...  Handling models as if they are never seen before is in line with the philosophy that LTSmin should be a language independent model checker.  ... 
doi:10.1007/978-3-662-58381-4_9 fatcat:udvhoqbycjdp7gsjkfctic5zbe

Presentation of the 9th Edition of the Model Checking Contest [chapter]

Elvio Amparore, Bernard Berthomieu, Gianfranco Ciardo, Silvano Dal Zilio, Francesco Gallà, Lom Messan Hillah, Francis Hulin-Hubard, Peter Gjøl Jensen, Loïg Jezequel, Fabrice Kordon, Didier Le Botlan, Torsten Liebke (+7 others)
2019 Msphere  
The Model Checking Contest (MCC) is an annual competition of software tools for model checking.  ...  For each examination and each model instance, participating tools are provided with up to 3600 s and 16 gigabyte of memory.  ...  Main Features of LTSmin. LTSmin has been designed as a language independent model checker. This allowed us to reuse algorithms that were already used for other languages, such as Promela and mCRL2.  ... 
doi:10.1007/978-3-030-17502-3_4 fatcat:i63wf7m4fzggxpl54xxwpv3jei

Multi-core On-The-Fly Saturation [chapter]

Tom van Dijk, Jeroen Meijer, Jaco van de Pol
2019 Lecture Notes in Computer Science  
The empirical evaluation uses Petri nets from the model checking contest, but thanks to the architecture of LTSmin, parallel on-the-fly saturation is now available to multiple specification languages.  ...  To this end, we implemented saturation in Sylvan's multicore decision diagrams used by the LTSmin model checker.  ...  The implementation is available in the open-source high-performance model checking tool LTSmin [22] , with its language-agnostic interface, Partitioned Next-State Interface (PINS) [5, 22, 25] .  ... 
doi:10.1007/978-3-030-17465-1_4 fatcat:rjjnnk53fjerxgigxwwn3kdhzm

Efficient Instantiation of Parameterised Boolean Equation Systems to Parity Games

Gijs Kant, Jaco van de Pol
2012 Electronic Proceedings in Theoretical Computer Science  
To that end we define a language module for LTSmin, consisting of an encoding of variables with parameters into state vectors, a grouped transition relation and a dependency matrix to indicate the dependencies  ...  Then we use LTSmin, that offers transition caching, efficient storage of states and both distributed and symbolic state space generation, for generating the game graph.  ...  We implemented a PBES language module for LTSMIN. As a result, the high-performance capabilities for state space generation become available for parity game generation.  ... 
doi:10.4204/eptcs.99.7 fatcat:6swi5siuyfckvjuzlcpn6753nq
« Previous Showing results 1 — 15 out of 88 results