Sciweavers

4353 search results - page 155 / 871
» Expressiveness of Process Algebras
Sort
View
CONCUR
2009
Springer
15 years 11 months ago
Partially-Commutative Context-Free Processes
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...
Wojciech Czerwinski, Sibylle B. Fröschle, Sla...
ASIAN
1998
Springer
118views Algorithms» more  ASIAN 1998»
15 years 8 months ago
Bisimulation Lattice of Chi Processes
Chi calculus was proposed as a process algebra that has a uniform treatment of names. The paper carries out a systematic study of bisimilarities for chi processes. The notion of L-...
Yuxi Fu
TCS
2002
15 years 4 months ago
A unified language processing methodology
This paper discusses a mathematical concept of language that models both artificial and natural languages and thus provides a framework for a unified language processing methodolo...
Teodor Rus
WWW
2007
ACM
16 years 5 months ago
The use of XML to express a historical knowledge base
Since conventional historical records have been written assuming human readers, they are not well-suited for computers to collect and process automatically. If computers could und...
Katsuko T. Nakahira, Masashi Matsui, Yoshiki Mikam...
ANCS
2009
ACM
15 years 2 months ago
A NFA-based programmable regular expression match engine
Pattern matching is the most computation intensive task of a network intrusion detection system (NIDS). In this paper we present a hardware architecture to speed up the pattern mat...
Derek Pao