4353 search results - page 92 / 871 » Expressiveness of Process Algebras |
120
click to vote
ACL
2010
15 years 2 months ago
2010
As information extraction (IE) becomes more central to enterprise applications, rule-based IE engines have become increasingly important. In this paper, we describe SystemT, a rul...
124
Voted
BPSC
2009
15 years 5 months ago
2009
Process modelling systems are complex and difficult to compare. A key attribute of any process modelling formalism or tool is time which involves how it handles and represents tem...
153
click to vote
NGITS
1999
Springer
15 years 8 months ago
1999
Springer
As the requirements for system analysis and design become more complex, the need for a natural, yet formal way of specifying system analysis findings and design decisions are becom...
123
Voted
LICS
2009
IEEE
15 years 10 months ago
2009
IEEE
Several dynamical systems, such as deterministic automata and labelled transition systems, can be described as coalgebras of so-called Kripke polynomial functors, built up from co...
144
Voted
PVM
2007
Springer
15 years 10 months ago
2007
Springer
llc is a language based on C where parallelism is expressed using compiler directives. The llc compiler produces MPI code which can be ported to both shared and distributed memory ...