Results 1  10
of
33
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 87 (20 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.
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 42 (8 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 40 (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.
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 20 (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 19 (6 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 17 (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 15 (6 self)
 Add to MetaCart
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
A processalgebraic language for probabilistic I/O automata
 IN PROC. OF THE 14TH INT. CONF. ON CONCURRENCY THEORY (CONCUR 2003), LNCS
, 2003
"... We present a processalgebraic language for Probabilistic I/O Automata (PIOA). To ensure that PIOA specifications given in our language satisfy the “inputenabled” property, which requires that all input actions be enabled in every state of a PIOA, we augment the language with a set of type inferenc ..."
Abstract

Cited by 10 (2 self)
 Add to MetaCart
We present a processalgebraic language for Probabilistic I/O Automata (PIOA). To ensure that PIOA specifications given in our language satisfy the “inputenabled” property, which requires that all input actions be enabled in every state of a PIOA, we augment the language with a set of type inference rules. We also equip our language with a formal operational semantics defined by a set of transition rules. We present a number of results whose thrust is to establish that the typing and transition rules are sensible and interact properly. The central connection between types and transition systems is that if a term is welltyped, then in fact the associated transition system is inputenabled. We also consider two notions of equivalence for our language, weighted bisimulation equivalence and PIOA behavioral equivalence. We show that both equivalences are substitutive with respect to the operators of the language, and note that weighted bisimulation equivalence is a strict refinement of behavioral equivalence.
Testing Transition Systems with Input and Output Testers
 TESTERS, PROC TESTCOM 2003, SOPHIA ANTIPOLIS
, 2003
"... The paper studies testing based on input/output transition systems, also known as input/output automata. It is assumed that a tester can never prevent an implementation under test (IUT) from producing outputs, while the IUT does not block inputs from the tester, either. Thus, input from the tester ..."
Abstract

Cited by 10 (1 self)
 Add to MetaCart
The paper studies testing based on input/output transition systems, also known as input/output automata. It is assumed that a tester can never prevent an implementation under test (IUT) from producing outputs, while the IUT does not block inputs from the tester, either. Thus, input from the tester and output from the IUT may occur simultaneously and should be queued in finite buffers between the tester and the IUT. A framework for socalled queuedquiescence testing is developed, based on the idea that the tester should consist of two test processes, one applying inputs via a queue to an IUT and the other reading outputs from a queue until it detects no more outputs of the IUT, i.e., the tester detects quiescence of the IUT. The testing framework is then extended with socalled queuedsuspension testing by considering a tester that has several pairs of input and output processes. Test derivation procedures are elaborated with a fault model in mind.