Sciweavers

1147 search results - page 186 / 230
» Termination in language-based systems
Sort
View
ATVA
2005
Springer
131views Hardware» more  ATVA 2005»
14 years 3 months ago
An MTBDD-Based Implementation of Forward Reachability for Probabilistic Timed Automata
Multi-Terminal Binary Decision Diagrams (MTBDDs) have been successfully applied in symbolic model checking of probabilistic systems. In this paper we propose an encoding method for...
Fuzhi Wang, Marta Z. Kwiatkowska
ATVA
2005
Springer
132views Hardware» more  ATVA 2005»
14 years 3 months ago
Flat Counter Automata Almost Everywhere!
Abstract. This paper argues that flatness appears as a central notion in the verification of counter automata. A counter automaton is called flat when its control graph can be ...
Jérôme Leroux, Grégoire Sutre
EUROCAST
2005
Springer
86views Hardware» more  EUROCAST 2005»
14 years 3 months ago
Convergence of Iterations
Convergence is a central problem in both computer science and in population biology. Will a program terminate? Will a population go to an equilibrium? In general these questions ar...
Paul Cull
ICCS
2005
Springer
14 years 3 months ago
Adaptive Surface Modeling Using a Quadtree of Quadratic Finite Elements
Abstract. This article presents special quadrilateral quadratic refinement elements, which provide geometry and field continuity across Tjunctions where two elements are connecte...
G. P. Nikishkov
IWDC
2005
Springer
210views Communications» more  IWDC 2005»
14 years 3 months ago
Mobile Agent Based Message Communication in Large Ad Hoc Networks Through Co-operative Routing Using Inter-agent Negotiation at
:- The wide availability of mobile devices equipped with wireless communication capabilities together with the technical possibility to form ad hoc networks paves the way for build...
Parama Bhaumik, Somprakash Bandyopadhyay