Finite transition systems | Guide books skip to main content ACM Digital Library home ACM
home Google, Inc. (search) Advanced Search Browse About Sign in Register Advanced Search …

The Concurrency Workbench is an automated tool for analyzing networks of finite-state
processes expressed in Milner's Calculus of Communicating Systems. Its key feature is its …

This book presents what in our opinion constitutes the basis of the theory of the mu-calculus,
considered as an algebraic system rather than a logic. We have wished to present the …

In this chapter, we present a hierarchy of infinite-state systems based on the primitive
operations of sequential and parallel composition; the hierarchy includes a variety of …

We develop a model-checking algorithm for a logic that permits propositions to be defined
using greatest and least fixed points of mutually recursive systems of equations. This logic is …

The paper develops a framework that is based on the idea that modal logic provides an
appropriate framework for the specification of data flow analysis (DFA) algorithms as soon …

We develop a model-checking algorithm that decides for a given context-free process
whether it satisfies a property written in the alternation-free modal mu-calculus. The central …

In this paper, we develop an algorithm for model checking that handles the full modal
mucalculus including alternating fixpoints. Our algorithm has a better worst-case complexity …

In this paper, we define a timed logic L v which is sufficiently expressive that we for any
timed automaton may construct a single characteristic L v formula uniquely characterizing …

The paper develops a framework that is based on the idea that modal logic provides an
appropriate framework for the specification of data flow analysis (DFA) algorithms as soon …