Sciweavers

12 search results - page 2 / 3
» Simulation Preorder on Simple Process Algebras
Sort
View
CSL
2006
Springer
13 years 11 months ago
Visibly Pushdown Automata: From Language Equivalence to Simulation and Bisimulation
Abstract. We investigate the possibility of (bi)simulation-like preorder/equivalence checking on the class of visibly pushdown automata and its natural subclasses visibly BPA (Basi...
Jirí Srba
ENTCS
2007
108views more  ENTCS 2007»
13 years 7 months ago
Remarks on Testing Probabilistic Processes
We develop a general testing scenario for probabilistic processes, giving rise to two theories: probabilistic may testing and probabilistic must testing. These are applied to a si...
Yuxin Deng, Rob J. van Glabbeek, Matthew Hennessy,...
WSC
2000
13 years 8 months ago
Input modeling using a computer algebra system
Input modeling that involves fitting standard univariate parametric probability distributions is typically performed using an input modeling package. These packages typically fit ...
Diane L. Evans, Lawrence Leemis
ICDE
2005
IEEE
165views Database» more  ICDE 2005»
14 years 8 months ago
Querying and Visualizing Gridded Datasets for e-Science
We demonstrate a web service and client application for querying and visualizing datasets defined over arbitrary topological grids. Such gridded datasets are produced by Earth sci...
Bill Howe, David Maier
FMCO
2009
Springer
161views Formal Methods» more  FMCO 2009»
13 years 5 months ago
The How and Why of Interactive Markov Chains
This paper reviews the model of interactive Markov chains (IMCs, for short), an extension of labelled transition systems with exponentially delayed transitions. We show that IMCs a...
Holger Hermanns, Joost-Pieter Katoen