[图书][B] Algorithms on trees and graphs

G Valiente - 2002 - Springer
The notion of graph which is most useful in computer science is that of a directed graph or
just a graph. A graph is a combinatorial structure consisting of a finite nonempty set of …

Replication and abstraction: Symmetry in automated formal verification

T Wahl, A Donaldson - Symmetry, 2010 - mdpi.com
This article surveys fundamental and applied aspects of symmetry in system models, and of
symmetry reduction methods used to counter state explosion in model checking, an …

Ten years of analyzing actors: Rebeca experience

M Sirjani, MM Jaghoori - … Biological Systems: Essays Dedicated to Carolyn …, 2011 - Springer
In this paper, we provide a survey of the different analysis techniques that are provided for
the modeling language Rebeca. Rebeca is designed as an imperative actor-based …

Symmetry and partial order reduction techniques in model checking Rebeca

MM Jaghoori, M Sirjani, MR Mousavi, E Khamespanah… - Acta Informatica, 2010 - Springer
Rebeca is an actor-based language with formal semantics which is suitable for modeling
concurrent and distributed systems and protocols. Due to its object model, partial order and …

Efficient approximate verification of B and Z models via symmetry markers

M Leuschel, T Massart - Annals of mathematics and artificial intelligence, 2010 - Springer
We present a new approximate verification technique for falsifying the invariants of B
models. The technique employs symmetry of B models induced by the use of deferred sets …

Dimming relations for the efficient analysis of concurrent systems via action abstraction

R De Nicola, G Iacobelli, M Tribastone - … , and Systems: 34th IFIP WG 6.1 …, 2014 - Springer
We study models of concurrency based on labelled transition systems where abstractions
are induced by a partition of the action set. We introduce dimming relations which are able to …