Sciweavers

866 search results - page 34 / 174
» A Formal Investigation of
Sort
View
KI
1995
Springer
14 years 1 months ago
What Is a Skeptical Proof?
Abstract. We investigate the task of skeptically reasoning in extensionbased, nonmonotonic logics by concentrating on general argumentation theories. The restricted applicability o...
Michael Thielscher
JLP
2006
113views more  JLP 2006»
13 years 9 months ago
Continuity controlled hybrid automata
We investigate the connections between the process algebra for hybrid systems of Bergstra and Middelburg and the formalism of hybrid automata of Henzinger et al. We give interpreta...
Jan A. Bergstra, C. A. Middelburg
GRAMMARS
1998
111views more  GRAMMARS 1998»
13 years 9 months ago
Quantitative Comparison of Languages
From the perspective of the linguist, the theory of formal languages serves as an abstract model to address issues such as complexity, learnability, information content, etc. which...
András Kornai
BIS
2006
150views Business» more  BIS 2006»
13 years 11 months ago
Why Do We Actually Need the Pi-Calculus for Business Process Management?
This paper discusses the applicability of a process algebra, the -calculus, as a formal foundation for Business Process Management (BPM). We therefore investigate the -calculus fro...
Frank Puhlmann
FORTE
2004
13 years 11 months ago
Composing Event Constraints in State-Based Specification
Abstract. Event-based process algebraic specification languages support an elegant specification technique by which system behaviours are described as compositions of constraints o...
Tommaso Bolognesi