Titlebook: Decidability of Parameterized Verification; Roderick Bloem,Ayrat Khalimov,Sasha Rubin Book 2015 Springer Nature Switzerland AG 2015

Nonflammable

Conclusions,s different forms of communication, like token-passing, rendezvous, or broadcast, as well as different communication graphs, like cliques, rings, stars, or even dynamic topologies that change at runtime.

PHON

Introduction,processes run concurrently and interact with each other, which results in non-determinism and large execution and state spaces. Thus, it is easy for a system designer to miss a bug related to concurrency, e.g., an unforeseen race condition, deadlock, livelock, etc. Finding these kinds of bugs motiva

癡呆

Token-passing Systems,a token (with or without a value) as a special case of pairwise-rendezvous synchronization. In contrast to most of the other classes of systems in this survey, TPSs have been analyzed on complex connectivity graphs, where connections may or may not be labeled with directions. Thus, in order to defin

分開

共和國

Progesterone

Ad Hoc Networks,bors of a sender simultaneously take a transition with the sender, and the sender is not blocked if there are no recipients that are ready to synchronize. This chapter summarizes the results by Delzanno et al. [2010, 2011, 2012b] and Abdulla et al. [2013a].

注意

Related Work, about completeness of our survey. In particular, we left out the large body of research that includes invariant-based techniques, regular model checking, symbolic methods, techniques for counter automata, and abstraction-based methods. In this chapter we give a brief overview of these methods and g

contrast-medium

Parameterized Model Checking Tools,nd specifications. In addition to that, parameterized model checking is computationally hard even in cases where it is decidable. As a result, there are only few software tools that implement decision procedures for the PMCP, and most of the available tools are implementations of the semi-decision p

graphy

Conclusions,s different forms of communication, like token-passing, rendezvous, or broadcast, as well as different communication graphs, like cliques, rings, stars, or even dynamic topologies that change at runtime.

使虛弱

Book 2015oadcast, and guarded transitions. Often, different terminology is used in the literature, and results are based on implicit assumptions. In this book, we introduce a computational model that unites the central synchronization and communication primitives of many models, and unveils hidden assumption