Sciweavers

240 search results - page 17 / 48
» Infinite trace equivalence
Sort
View
JUCS
2006
89views more  JUCS 2006»
13 years 8 months ago
Process Equivalences as Global Bisimulations
: Bisimulation can be defined in a simple way using coinductive methods, and has rather pleasant properties. Ready similarity was proposed by Meyer et al. as a way to weakening the...
David de Frutos-Escrig, Carlos Gregorio-Rodr&iacut...
ICGI
2010
Springer
13 years 9 months ago
Inferring Regular Trace Languages from Positive and Negative Samples
In this work, we give an algorithm that infers Regular Trace Languages. Trace languages can be seen as regular languages that are closed under a partial commutation relation called...
Antonio Cano Gómez
CORR
1999
Springer
104views Education» more  CORR 1999»
13 years 8 months ago
A Bootstrap Approach to Automatically Generating Lexical Transfer Rules
We describe a method for automatically generating Lexical Transfer Rules (LTRs) from word equivalences using transfer rule templates. Templates are skeletal LTRs, unspecified for ...
Davide Turcato, Paul McFetridge, Fred Popowich, Ja...
APPML
2005
131views more  APPML 2005»
13 years 8 months ago
A note on Laplace's equation inside a cylinder
Two difficulties connected with the solution of Laplace's equation around an object inside an infinite circular cylinder are resolved. One difficulty is the nonconvergence of...
Silvana Ilie, David J. Jeffrey
EPEW
2008
Springer
13 years 10 months ago
Towards State Space Reduction Based on T-Lumpability-Consistent Relations
Markovian behavioral equivalences can be exploited for state space reduction before performance evaluation takes place. It is known that Markovian bisimilarity corresponds to ordin...
Marco Bernardo