Sciweavers

PAPM
2001
Springer
126views Mathematics» more  PAPM 2001»
14 years 3 months ago
Beyond Memoryless Distributions: Model Checking Semi-Markov Chains
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...
Gabriel G. Infante López, Holger Hermanns, ...
PAPM
2001
Springer
128views Mathematics» more  PAPM 2001»
14 years 3 months ago
Faster and Symbolic CTMC Model Checking
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 (...
Joost-Pieter Katoen, Marta Z. Kwiatkowska, Gethin ...
PAPM
2001
Springer
107views Mathematics» more  PAPM 2001»
14 years 3 months ago
MoDeST - A Modelling and Description Language for Stochastic Timed Systems
This paper presents a modelling language, called MoDeST, for describing the behaviour of discrete event systems. The language combines conventional programming constructs – such ...
Pedro R. D'Argenio, Holger Hermanns, Joost-Pieter ...
ISSAC
2001
Springer
123views Mathematics» more  ISSAC 2001»
14 years 3 months ago
On computational properties of chains of recurrences
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...
Eugene V. Zima
ISSAC
2001
Springer
129views Mathematics» more  ISSAC 2001»
14 years 3 months ago
Computation of the degree of rational maps between curves
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...
J. Rafael Sendra, Franz Winkler
ISSAC
2001
Springer
123views Mathematics» more  ISSAC 2001»
14 years 3 months ago
A probabilistic algorithm to test local algebraic observability in polynomial time
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...
Alexandre Sedoglavic
ISSAC
2001
Springer
103views Mathematics» more  ISSAC 2001»
14 years 3 months ago
New complexity bounds for cylindrical decompositions of sub-pfaffian sets
Savvas Pericleous, Nicolai Vorobjov
ISSAC
2001
Springer
119views Mathematics» more  ISSAC 2001»
14 years 3 months ago
Algorithms for trigonometric polynomials
In this paper we present algorithms for simplifying ratios of trigonometric polynomials and algorithms for dividing, factoring and computing greatest common divisors of trigonomet...
Jamie Mulholland, Michael B. Monagan
ISSAC
2001
Springer
133views Mathematics» more  ISSAC 2001»
14 years 3 months ago
Irreducible trinomials over finite fields
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...
Joachim von zur Gathen