Sciweavers

1012 search results - page 49 / 203
» Process Algebra with Backtracking
Sort
View
PARLE
1987
13 years 11 months ago
Decidability of Bisimulation Equivalence for Processes Generating Context-Free Languages
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...
Jos C. M. Baeten, Jan A. Bergstra, Jan Willem Klop
VLDB
2002
ACM
97views Database» more  VLDB 2002»
13 years 7 months ago
Incorporating XSL Processing into Database Engines
The two observations that 1) many XML documents are stored in a database or generated from data stored in a database and 2) processing these documents with XSL stylesheet processo...
Guido Moerkotte
ISPDC
2003
IEEE
14 years 1 months ago
Role Activity Diagrams as Finite State Processes
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...
Costin Badica, Amelia Badica, Valentin Litoiu
VISUALIZATION
1993
IEEE
13 years 12 months ago
GRASPARC: A Problem Solving Environment Integrating Computation and Visualization
Visualization has proved an e ective tool in the understanding of large data sets in computational science and engineering. There is growing interest today in the development of p...
Ken Brodlie, A. Poon, Helen Wright, L. Brankin, G....
ENTCS
2007
81views more  ENTCS 2007»
13 years 7 months ago
Self-assembling Trees
RCCS is a variant of Milner’s CCS where processes are allowed a controlled form of backtracking. It turns out that the RCCS reinterpretation of a CCS process is equivalent, in t...
Vincent Danos, Jean Krivine, Fabien Tarissan