729 search results - page 92 / 146 » And Or Hierarchies and Round Abstraction |
ICALP
2010
Springer
14 years 1 months ago
2010
Springer
Higher-order process calculi are calculi in which processes can be communicated. We study the expressiveness of strictly higher-order process calculi, and focus on two issues well-...
CSL
2001
Springer
14 years 1 months ago
2001
Springer
Abstract. A new tree automata framework, called equational tree automata, is presented. In the newly introduced setting, congruence closures of recognizable tree languages are reco...
FOSSACS
2001
Springer
14 years 1 months ago
2001
Springer
Abstract. We study the expressiveness of the join calculus by comparison with (generalised, coloured) Petri nets and using tools from type theory. More precisely, we consider four ...
FCT
1999
Springer
14 years 1 months ago
1999
Springer
Abstract. An iterative array is a line of interconnected interacting finite automata. One distinguished automaton, the communication cell, is connected to the outside world and fe...
FTP
1998
Springer
14 years 1 months ago
1998
Springer
Abstract. We describe two methods on the basis of which efficient resolution decision procedures can be developed for a range of description logics. The first method uses an orderi...