946 search results - page 89 / 190 » Process Algebra and Non-Interference |
FSTTCS
2003
Springer
14 years 4 months ago
2003
Springer
We define a new model called O-PRS that extends the Process Rewrite Systems formalism with a new associative operator, “ ”, that allows to model parallel composition while ke...
ICDE
1999
IEEE
15 years 15 days ago
1999
IEEE
Most operations of the relational algebra or SQL require a sorted stream of tuples for efficient processing. Therefore, processing complex relational queries relies on efficient a...
LICS
2002
IEEE
14 years 4 months ago
2002
IEEE
We observe that equivalence is not a robust concept in the presence of numerical information - such as probabilities - in the model. We develop a metric analogue of weak bisimulat...
CIDR
2009
14 years 7 days ago
2009
Recent work has shown that we can dramatically improve the performance of computer games and simulations through declarative processing: Character AI can be written in an imperati...
FAC
2008
13 years 11 months ago
2008
Abstract. In this paper we consider the relationship between refinement-oriented specification and specifications using a temporal logic. We investigate the extent to which one can...