PAPM
2001
Springer
13 years 11 months ago
2001
Springer
Abstract. Recent investigations have shown that the automated verification of continuous-time Markov chains (CTMCs) against CSL (Continuous Stochastic Logic) can be performed in a...
PAPM
2001
Springer
13 years 11 months ago
2001
Springer
Abstract. This paper reports on the implementation and the experiments with symbolic model checking of continuous-time Markov chains using multi-terminal binary decision diagrams (...
PAPM
2001
Springer
13 years 11 months ago
2001
Springer
This paper presents a modelling language, called MoDeST, for describing the behaviour of discrete event systems. The language combines conventional programming constructs – such ...
ISSAC
2001
Springer
13 years 11 months ago
2001
Springer
Backward and mixed chains of recurrences are introduced. A complete set of chains of recurrences manipulation tools is described. Applications of these tools, related to the safet...
ISSAC
2001
Springer
13 years 11 months ago
2001
Springer
The degree of a rational map measures how often the map covers the image variety. In particular, when the rational map is a parametrization, the degree measures how often the para...
ISSAC
2001
Springer
13 years 11 months ago
2001
Springer
The following questions are often encountered in system and control theory. Given an algebraic model of a physical process, which variables can be, in theory, deduced from the inp...
ISSAC
2001
Springer
13 years 11 months ago
2001
Springer
ISSAC
2001
Springer
13 years 11 months ago
2001
Springer
In this paper we present algorithms for simplifying ratios of trigonometric polynomials and algorithms for dividing, factoring and computing greatest common divisors of trigonomet...
ISSAC
2001
Springer
13 years 11 months ago
2001
Springer
ISSAC
2001
Springer
13 years 11 months ago
2001
Springer
A necessary condition for irreducibility of a trinomial over a finite field, based on classical results of Stickelberger and Swan, is established. It is applied in the special ca...