Results 1  10
of
46
Turning SOS Rules into Equations
, 1994
"... Many process algebras are defined by structural operational semantics (SOS). Indeed, most such definitions are nicely structured and fit the GSOS format of [15]. We give a procedure for converting any GSOS language definition to a finite complete equational axiom system (possibly with one infinit ..."
Abstract

Cited by 97 (22 self)
 Add to MetaCart
Many process algebras are defined by structural operational semantics (SOS). Indeed, most such definitions are nicely structured and fit the GSOS format of [15]. We give a procedure for converting any GSOS language definition to a finite complete equational axiom system (possibly with one infinitary induction principle) which precisely characterizes strong bisimulation of processes.
Model Based Testing with Labelled Transition Systems
, 2008
"... Model based testing is one of the promising technologies to meet the challenges imposed on software testing. In model based testing an implementation under test is tested for compliance with a model that describes the required behaviour of the implementation. This tutorial chapter describes a model ..."
Abstract

Cited by 61 (2 self)
 Add to MetaCart
Model based testing is one of the promising technologies to meet the challenges imposed on software testing. In model based testing an implementation under test is tested for compliance with a model that describes the required behaviour of the implementation. This tutorial chapter describes a model based testing theory where models are expressed as labelled transition systems, and compliance is defined with the ‘ioco’ implementation relation. The iocotesting theory, on the one hand, provides a sound and welldefined foundation for labelled transition system testing, having its roots in the theoretical area of testing equivalences and refusal testing. On the other hand, it has proved to be a practical basis for several model based test generation tools and applications. Definitions, underlying assumptions, an algorithm, properties, and several examples of the iocotesting theory are discussed, involving specifications, implementations, tests, the ioco implementation relation and some of its variants, a test generation algorithm, and the soundness and exhaustiveness of this algorithm.
Metrics for Labelled Markov Systems
, 2001
"... The notion of process equivalence of probabilistic processes is sensitive to the exact probabilities of transitions. Thus, a slight change in the transition probabilities will result in two equivalent processes being deemed no longer equivalent. This instability is due to the quantitative nature of ..."
Abstract

Cited by 50 (10 self)
 Add to MetaCart
The notion of process equivalence of probabilistic processes is sensitive to the exact probabilities of transitions. Thus, a slight change in the transition probabilities will result in two equivalent processes being deemed no longer equivalent. This instability is due to the quantitative nature of probabilistic processes. In a situation where the process behaviour has a quantitative aspect there should be a more robust approach to process equivalence. This paper studies a metric between labelled Markov processes. This metric has the property that processes are at zero distance if and only if they are bisimilar. The metric is inspired by earlier work on logics for characterizing bisimulation and is related, in spirit, to the Hutchinson metric.
Action Transducers and Timed Automata
 Formal Aspects of Computing
, 1996
"... The timed automaton model of [LV92, LV93] is a general model for timingbased systems. A notion of timed action transducer is here defined as an automatatheoretic way of representing operations on timed automata. It is shown that two timed trace inclusion relations are substitutive with respect to ..."
Abstract

Cited by 39 (13 self)
 Add to MetaCart
The timed automaton model of [LV92, LV93] is a general model for timingbased systems. A notion of timed action transducer is here defined as an automatatheoretic way of representing operations on timed automata. It is shown that two timed trace inclusion relations are substitutive with respect to operations that can be described by timed action transducers. Examples are given of operations that can be described in this way, and a preliminary proposal is given for an appropriate language of operators for describing timingbased systems.
A.: Timed I/O Automata: A Complete Specification Theory for Realtime Systems
 In: HSCC 2010
, 2010
"... A specification theory combines notions of specifications and implementations with a satisfaction relation, a refinement relation and a set of operators supporting stepwise design. We develop a complete specification framework for realtime systems using Timed I/O Automata as the specification form ..."
Abstract

Cited by 34 (15 self)
 Add to MetaCart
(Show Context)
A specification theory combines notions of specifications and implementations with a satisfaction relation, a refinement relation and a set of operators supporting stepwise design. We develop a complete specification framework for realtime systems using Timed I/O Automata as the specification formalism, with the semantics expressed in terms of Timed I/O Transition Systems. We provide constructs for refinement, consistency checking, logical and structural composition, and quotient of specifications – all indispensable ingredients of a compositional design methodology. The theory is implemented on top of an engine for timed games, Uppaaltiga, and illustrated with a small case study.
OntheFly Conformance Testing Using SPIN
"... In this paper we report about the construction of a tool for conformance testing based on Spin. The Spin tool has been adapted such it can derive test primitives from systems described in Promela. These prmitives suppor t the onthefly confor mance testing process. Tr aditional der ivation of tests ..."
Abstract

Cited by 23 (3 self)
 Add to MetaCart
In this paper we report about the construction of a tool for conformance testing based on Spin. The Spin tool has been adapted such it can derive test primitives from systems described in Promela. These prmitives suppor t the onthefly confor mance testing process. Tr aditional der ivation of testsfr omfor mal specifications suffer s fr om the statespace explosion pr oblem and from complexity. Spin is one of the most advanced model checker s with r espect to handling large state spaces. This advantage of Spin has been used for the der vation of test pr imitivesfr a a descr ption. To r educe the state space, we intr duce the onthefly testing framework. Within this fr or thePr is distinguished. ThisPr der es test pr ives fr a model of a system accor ng to a well defined and complete testing theory. Algor ithms arpr sented which enable us to der ive test primitives from a a description. These algor ithms have been implemented in the adapted ver of the Spin tool which acts as thePr in the framework. As a result of this prototype study it is concluded that it is in principle possible to derive these primitives automatically from a descriptions, and to perform testing.
An abstract coalgebraic approach to process equivalence for wellbehaved operational semantics
, 2004
"... This thesis is part of the programme aimed at finding a mathematical theory of wellbehaved structural operational semantics. General and basic results shown in 1997 in a seminal paper by Turi and Plotkin are extended in two directions, aiming at greater expressivity of the framework. The socalled ..."
Abstract

Cited by 23 (5 self)
 Add to MetaCart
This thesis is part of the programme aimed at finding a mathematical theory of wellbehaved structural operational semantics. General and basic results shown in 1997 in a seminal paper by Turi and Plotkin are extended in two directions, aiming at greater expressivity of the framework. The socalled bialgebraic framework of Turi and Plotkin is an abstract generalization of the wellknown structural operational semantics format GSOS, and provides a theory of operational semantic rules for which bisimulation equivalence is a congruence. The first part of this thesis aims at extending that framework to cover other operational equivalences and preorders (e.g. trace equivalence), known collectively as the van Glabbeek spectrum. To do this, a novel coalgebraic approach to relations on processes is desirable, since the usual approach to coalgebraic bisimulations as spans of coalgebras does not extend easily to other known equivalences on processes. Such an approach, based on fibrations of test
A Calculus Of Value Broadcasts
 IN PARLE'93
, 1993
"... Computation can be modelled as a sequence of values, each broadcast by one agent and instantaneously audible to all those in parallel with it. Listening agents receive the value; others lose it. Subsystems interface via translators; these can scramble values and thus hide or restrict them. Examples ..."
Abstract

Cited by 18 (5 self)
 Add to MetaCart
Computation can be modelled as a sequence of values, each broadcast by one agent and instantaneously audible to all those in parallel with it. Listening agents receive the value; others lose it. Subsystems interface via translators; these can scramble values and thus hide or restrict them. Examples show the calculus describing this model to be a powerful and natural programming tool. Weak bisimulation, a candidate for observational equivalence, is defined on the basis that receiving a value can be matched by losing it.
Rooted branching bisimulation as a congruence
 Journal of Computer and System Sciences
, 2000
"... This article presents a congruence format, in structural operational semantics, for rooted branching bisimulation equivalence. The format imposes additional requirements on Groote’s ntyft format. It extends an earlier format by Bloom with standard notions such as recursion, iteration, predicates, an ..."
Abstract

Cited by 17 (6 self)
 Add to MetaCart
(Show Context)
This article presents a congruence format, in structural operational semantics, for rooted branching bisimulation equivalence. The format imposes additional requirements on Groote’s ntyft format. It extends an earlier format by Bloom with standard notions such as recursion, iteration, predicates, and negative premises. 1