We propose a language for testing concurrent processes and examine its strength in terms
of the processes that are distinguished by a test. By using probabilistic transition systems as …

In this paper various semantics in the linear time-branching time spectrum are presented in
a uniform, model-independent way. Restricted to the class of finitely branching, concrete …

In comparative concurrency semantics, one usually distinguishes between linear time and
branching time semantic equivalences. Milner's notion of observatin equivalence is often …

This paper studies semantic equivalences and preorders for sequential systems with silent
moves, restricting attention to the ones that abstract from successful termination, stochastic …

This paper studies testing based on labelled transition systems, using the assumption that
implementations communicate with their environment via inputs and outputs. Such …

Induction is a pervasive tool in computer science and mathematics for defining objects and
reasoning on them. Coinduction is the dual of induction and as such it brings in quite …

In the concurrent language CCS, two programs are considered the same if they are
bisimilar. Several years and many researchers have demonstrated that the theory of …

This paper surveys various notions of equivalence for concurrent systems in the framework
of Elementary Net Systems, a fundamental class in the family of Petri Net models. Two types …

This paper presents the TGV tool, which allows for the automatic synthesis of conformance
test cases from a formal specification of a (non-deterministic) reactive system. TGV was …

Three temporal logics are introduced that induce on labeled transition systems the same
identifications as branching bisimulation, a behavioral equivalence that aims at ignoring …