22 search results - page 4 / 5 » Weak Sequential Composition in Process Algebras |
CONCUR
2009
Springer
13 years 12 months ago
2009
Springer
Bisimulation equivalence is decidable in polynomial time for both sequential and commutative normed context-free processes, known as BPA and BPP, respectively. Despite apparent sim...
ICWS
2008
IEEE
13 years 6 months ago
2008
IEEE
BPEL (Business Process Execution Language) has become the standard for specifying and executing workflow specifications for web service composition invocation. A major weakness of ...
CSL
1999
Springer
13 years 9 months ago
1999
Springer
Abstract. This paper represents the beginning of a study aimed at devising semantic models for true concurrency that provide clear distinctions between concurrency, parallelism and...
SIGMOD
1996
ACM
13 years 9 months ago
1996
ACM
Magic sets rewriting is a well-known optimization heuristic for complex decision-support queries. There can be many variants of this rewriting even for a single query, which diffe...
TSE
2008
13 years 5 months ago
2008
Timed Automata have proven to be useful for specification and verification of real-time systems. System design using Timed Automata relies on explicit manipulation of clock variabl...