scispace - formally typeset
Book ChapterDOI

The Linear Time - Branching Time Spectrum II

Rob van Glabbeek
- pp 66-81
TLDR
In this paper, semantic equivalences and preorders for sequential systems with silent moves are studied, focusing on the ones that abstract from successful termination, stochastic and real-time aspects of the investigated systems, and the structure of the visible actions systems can perform.
Abstract
This paper studies semantic equivalences and preorders for sequential systems with silent moves, restricting attention to the ones that abstract from successful termination, stochastic and real-time aspects of the investigated systems, and the structure of the visible actions systems can perform. It provides a parameterized definition of such a preorder, such that most such preorders and equivalences found in the literature are obtained by a suitable instantiation of the parameters. Other instantiations yield preorders that combine properties from various semantics. Moreover, the approach shows several ways in which preorders that were originally only considered for systems without silent moves, most notably the ready simulation, can be generalized to an abstract setting, and how preorders that were originally only considered for for systems without divergence, such as the coupled simulation, can be extended to divergent systems. All preorders come with—or rather as—a modal characterization, and when possible also a relational characterization. The paper concludes with some pros and cons of the preorders.

read more

Citations
More filters
Book

Principles of Model Checking

TL;DR: Principles of Model Checking offers a comprehensive introduction to model checking that is not only a text suitable for classroom use but also a valuable reference for researchers and practitioners in the field.
Journal ArticleDOI

Branching time and abstraction in bisimulation semantics

TL;DR: This paper investigates whether observation equivalence really does respect the branching structure of processes, and finds that in the presence of the unobservable action τ of CCS this is not the case, and the notion of branching bisimulation equivalence is introduced which strongly preserves the branching structures of processes.
Journal Article

The state explosion problem

TL;DR: State space methods are one of the most important approaches to computer-aided analysis and verification of the behaviour of concurrent systems as discussed by the authors, but their use tends to restrict the set of analysis or verification questions that can be answered, making it impossible to discuss the methods without some taxonomy of the questions.
Book ChapterDOI

Models for concurrency

TL;DR: In this article, the authors present a survey of models for parallel computation, including transition systems, synchronisation trees, Petri nets, event structures, pomsets and Mazurkiewicz traces.

Test Generation with Inputs, Outputs and Repetitive Quiescence

TL;DR: In this article, a test generation algorithm is given which is proved to produce a sound and exhaustive test suite from a specification, i.e., a test suite that fully characterizes the set of correct implementations.
References
More filters
Journal ArticleDOI

Communicating sequential processes

TL;DR: It is suggested that input and output are basic primitives of programming and that parallel composition of communicating sequential processes is a fundamental program structuring method.
Book

A calculus of communicating systems

Robin Milner
TL;DR: A case study in synchronization and proof techniques, and some proofs about data structures in value-communication as a model of CCS 2.0.
Book ChapterDOI

Concurrency and Automata on Infinite Sequences

TL;DR: A general method for proving/deciding equivalences between omega-regular languages, whose recognizers are modified forms of Buchi or Muller-McNaughton automata, derived from Milner's notion of “simulation” is obtained.