In this tutorial we give an overview of the process algebra EMPA, a calculus devised in order
to model and analyze features of real-world concurrent systems such as nondeterminism …

We present an overview and synthesis of existing results about process algebras for the
specification and analysis of timed systems. The motivation is double: present an overview …

This chapter is to provide a tutorial and pointers to results and related work on timed
automata with a focus on semantical and algorithmic aspects of verification tools. We …

Over the last few years there has been an increasing research effort directed towards the
automatic verification of infinite state systems. This paper is concerned with identifying …

This chapter introduces the central formalism of this book, Interactive Markov Chains 1
(IMC). It arises as an integration of interactive processes and continuous-time Markov …

We consider the verification of a particular class of infinite-state systems, namely systems
consisting of finite-state processes that communicate via unbounded lossy FIFO channels …

Process algebra is a widely accepted and much used technique in the specification and
verification of parallel and distributed software systems. This book sets the standard for the …

Time and probability in formal design of distributed systems. КОРЗИНА ПОИСК
НАВИГАТОР ЖУРНАЛЫ КНИГИ ПАТЕНТЫ ПОИСК АВТОРЫ ОРГАНИЗАЦИИ …

The algebra of timed processes, ATP, uses a notion of discrete global time and suggests a
conceptual framework for introducing time by extending untimed languages. The action …

In this paper, an algebra of timed processes with real-valued clocks is presented, which
serves as a formal description language for real-time communicating systems. We show that …