4353 search results - page 89 / 871 » Expressiveness of Process Algebras |
150
Voted
PARLE
1987
15 years 7 months ago
1987
A context-freegrammar(CFG)in GreibachNormalForm coincides,in anothernotation,witha system of guarded recursion equations in Basic Process Algebra. Hence to each CFG a process can b...
143
Voted
ISPDC
2003
IEEE
15 years 9 months ago
2003
IEEE
Many formal modelling notations for business processes have been proposed during the last decade. They can be broadly classified into high-level visual notations, with an intuiti...
135
click to vote
LISP
2006
15 years 3 months ago
2006
The last few years have seen the development of the rewriting calculus (also called rho-calculus or -calculus) that uniformly integrates first-order term rewriting and the -calculu...
111
Voted
SOFSEM
2009
Springer
16 years 25 days ago
2009
Springer
We develop a game semantics for process algebra with two interacting agents. The purpose of our semantics is to make manifest the role of knowledge and information flow in the int...
127
Voted
SEKE
2007
Springer
15 years 10 months ago
2007
Springer
In this paper, we present an approach to query processing for paraconsistent databases in the presence of integrity constraints. Paraconsistent databases are capable of representi...