Results 11 to 20 of about 1,158 (136)
An Approach to Model Checking of Multi-agent Data Analysis [PDF]
Electronic Proceedings in Theoretical Computer Science, 2014 The paper presents an approach to verification of a multi-agent data analysis algorithm. We base correct simulation of the multi-agent system by a finite integer model. For verification we use model checking tool SPIN.
Natalia Garanina +2 more
doaj +1 more source
A multi-paradigm language for reactive synthesis [PDF]
Electronic Proceedings in Theoretical Computer Science, 2016 This paper proposes a language for describing reactive synthesis problems that integrates imperative and declarative elements. The semantics is defined in terms of two-player turn-based infinite games with full information.
Ioannis Filippidis +2 more
doaj +1 more source
, 2022 <p>An extension of the Treo compiler to Promela for verification of temporal properties.</p ...
Benjamin Lion
core +1 more source
Distributed MAP in the SpinJa Model Checker [PDF]
Electronic Proceedings in Theoretical Computer Science, 2011 Spin in Java (SpinJa) is an explicit state model checker for the Promela modelling language also used by the SPIN model checker. Designed to be extensible and reusable, the implementation of SpinJa follows a layered approach in which each new layer ...
Stefan Vijzelaar +3 more
doaj +1 more source
Model Checking Paxos in Spin [PDF]
Electronic Proceedings in Theoretical Computer Science, 2014 We present a formal model of a distributed consensus algorithm in the executable specification language Promela extended with a new type of guards, called counting guards, needed to implement transitions that depend on majority voting. Our formalization
Giorgio Delzanno +2 more
doaj +1 more source
SpinS:Extending LTSmin with Promela through SpinJa [PDF]
, 2012 We show how PROMELA can be supported by the high-performance generic model checking tools of LTSMIN. The success of the SPIN model checker has made PROMELA an important modeling language.
Laarman, Alfons +1 more
core +6 more sources
Feature interaction detection by pairwise analysis of LTL properties—A case study [PDF]
, 2005 A Promela specification and a set of temporal properties are developed for a basic call service with a number of features. The properties are expressed in the logic LTL.
Calder, M. +3 more
core +2 more sources
Checking Parameterized Promela Models of Cache Coherence Protocols
Труды Института системного программирования РАН, 2018 This paper introduces a method for scalable verification of cache coherence protocols described in the Promela language. Scalability means that resources spent on verification (first of all, machine time and memory) do not depend on the number of ...
V. S. Burenkov, A. S. Kamkin
doaj +1 more source
Application of Coloured Petri Nets for Verification of Scenario Control Structures in UCM Notation
Моделирование и анализ информационных систем, 2016 This article presents a method for the analysis and verification of Use Case Maps (UCM) models with scenario control structures — protected components and failure handling constructs.
N. V. Vizovitin +2 more
doaj +1 more source
A Technique for Parameterized Verification of Cache Coherence Protocols
Труды Института системного программирования РАН, 2018 This paper introduces a technique for scalable functional verification of cache coherence protocols that is based on the verification method, which was previously developed by the author.
V. S. Burenkov
doaj +1 more source