12774 search results - page 396 / 2555 » A Framework for Proof Systems |
186
click to vote
ARTS
1997
Springer
15 years 12 months ago
1997
Springer
In 10 , an algebra for timed automata has been introduced. In this article, we introduce a syntactic characterisation of nite timed automata in terms of that process algebra. We s...
217
click to vote
RTA
2010
Springer
15 years 11 months ago
2010
Springer
Abstract. In this paper we present our formalization of two important termination techniques for term rewrite systems: the subterm criterion and the reduction pair processor in com...
191
Voted
ACTA
2010
15 years 7 months ago
2010
We study the observational theory of Thielecke's CPS-calculus, a distillation of the target language of Continuation-Passing Style transforms. We define a labelled transition...
210
click to vote
STTT
2010
15 years 6 months ago
2010
Event-B is a formal method for system-level modelling and analysis. Key features of Event-B are the use of set theory as a modelling notation, the use of ent to represent systems a...
210
click to vote
RTSS
1999
IEEE
15 years 12 months ago
1999
IEEE
Many scheduling paradigms have been studied for realtime applications and real-time communication network. Among them, the most commonly used paradigms include priority-driven, ti...