Sciweavers

4353 search results - page 25 / 871
» Expressiveness of Process Algebras
Sort
View
CP
2000
Springer
15 years 1 months ago
Expressiveness of Full First Order Constraints in the Algebra of Finite or Infinite Trees
We are interested in the expressiveness of constraints represented by general first order formulae, with equality as unique relation symbol and function symbols taken from an infi...
Alain Colmerauer, Thi-Bich-Hanh Dao
68
Voted
DBPL
2007
Springer
91views Database» more  DBPL 2007»
15 years 3 months ago
Relational Completeness of Query Languages for Annotated Databases
Annotated relational databases can be queried either by simply making the annotations explicitly available along the ordinary data, or by adapting the standard query operators so ...
Floris Geerts, Jan Van den Bussche
EEF
2000
15 years 1 months ago
Process Algebra and Markov Chains
This paper surveys and relates the basic concepts of process algebra and the modelling of continuous time Markov chains. It provides
Ed Brinksma, Holger Hermanns
90
Voted
CMSB
2008
Springer
14 years 11 months ago
Integrated Analysis from Abstract Stochastic Process Algebra Models
Stochastic Process Algebra Models Jane Hillston. University of Edinburgh.
Jane Hillston, Federica Ciocchetta, Adam Duguid, S...
IMECS
2007
14 years 11 months ago
Analysis of a Mixed-Signal Circuit in Hybrid Process Algebra ACPsrt
— ACPsrt hs is a hybrid process algebra obtained by extending a combination of two existing extensions of Algebra of Communicating Processes (ACP), namely the process algebra wit...
Ka L. Man, Michel P. Schellekens