Results 1  10
of
51,909
APPLYING DOUBLY LABELED TRANSITION SYSTEMS TO THE REFINEMENT PARADOX
, 2005
"... Applying doubly labeled transition systems to the refinement paradox ..."
MonoidLabeled Transition Systems
"... Given a # complete (semi)lattice L, we consider Llabeled transition systems as coalgebras of a functor L () , associating with a set X the set L X of all Lfuzzy subsets. We describe simulations and bisimulations of Lcoalgebras to show that L () weakly preserves nonempty kern ..."
Abstract

Cited by 12 (2 self)
 Add to MetaCart
Given a # complete (semi)lattice L, we consider Llabeled transition systems as coalgebras of a functor L () , associating with a set X the set L X of all Lfuzzy subsets. We describe simulations and bisimulations of Lcoalgebras to show that L () weakly preserves nonempty
An epistemic logic for labelled transition systems
, 2011
"... We define an epistemic logic for labelled transition systems by introducing equivalence relations for the agents on the states of the labelled transition system. The idea is that agents observe the dynamics of the system modulo their ability to distinguish states and in the process learn about the c ..."
Abstract
 Add to MetaCart
We define an epistemic logic for labelled transition systems by introducing equivalence relations for the agents on the states of the labelled transition system. The idea is that agents observe the dynamics of the system modulo their ability to distinguish states and in the process learn about
Differencing Labeled Transition Systems
"... Abstract. Concurrent programs often use Labeled Transition Systems (LTSs) as their operational semantic models, which provide the basis for automatic system analysis and verification. System behaviors (generated from the operational semantics) evolve as programs evolve for fixing bugs or implementi ..."
Abstract
 Add to MetaCart
Abstract. Concurrent programs often use Labeled Transition Systems (LTSs) as their operational semantic models, which provide the basis for automatic system analysis and verification. System behaviors (generated from the operational semantics) evolve as programs evolve for fixing bugs
Generalizing Finiteness Conditions of Labelled Transition Systems
, 1993
"... A labelled transition system is provided with some additional structure by endowing the configurations and the labels with a complete metric. In this way, a socalled metric labelled transition system is obtained. The additional structure on a metric labelled transition system makes it possible to g ..."
Abstract

Cited by 1 (1 self)
 Add to MetaCart
A labelled transition system is provided with some additional structure by endowing the configurations and the labels with a complete metric. In this way, a socalled metric labelled transition system is obtained. The additional structure on a metric labelled transition system makes it possible
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 66 (2 self)
 Add to MetaCart
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
Testing Trace Equivalence for Labeled Transition Systems
, 1995
"... : In this paper, we consider the problem on conformance testing of communication protocols which are modeled by labeled transition systems. The conformance requirements of specifications are represented as the trace equivalence relation and derived test suites have finite behavior and provide welld ..."
Abstract

Cited by 2 (1 self)
 Add to MetaCart
: In this paper, we consider the problem on conformance testing of communication protocols which are modeled by labeled transition systems. The conformance requirements of specifications are represented as the trace equivalence relation and derived test suites have finite behavior and provide well
A Theory of Metric Labelled Transition Systems
 Papers on General Topology and Applications: 11th Summer Conference at the University of Southern Maine, volume 806 of Annals of the New York Academy of Sciences
, 1995
"... Labelled transition systems are useful for giving semantics to programming languages. Kok and Rutten have developed some theory to prove semantic models defined by means of labelled transition systems to be equal to other semantic models. Metric labelled transition systems are labelled transition sy ..."
Abstract

Cited by 5 (0 self)
 Add to MetaCart
Labelled transition systems are useful for giving semantics to programming languages. Kok and Rutten have developed some theory to prove semantic models defined by means of labelled transition systems to be equal to other semantic models. Metric labelled transition systems are labelled transition
PDL over Accelerated Labeled Transition Systems
"... We present a thorough study of Propositional Dynamic Logic over a variation of labeled transition systems, called accelerated labelled transition systems, which are transition systems labeled with regular expressions over action labels. We study the model checking and satisfiability decision probl ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
We present a thorough study of Propositional Dynamic Logic over a variation of labeled transition systems, called accelerated labelled transition systems, which are transition systems labeled with regular expressions over action labels. We study the model checking and satisfiability de
Results 1  10
of
51,909