Campus Event Calendar
Event Entry
What and Who
Algorithms for the Quantitative Analysis of Infinite-State Systems
Christoph Haase
Laboratoire Spécification et Vérification, Cachan, France
SWS Colloquium
AG 1, AG 2, AG 3, AG 4, AG 5, SWS, RG1, MMCI
AG Audience
English
Note: We use this to send email in the morning.
Date, Time and Location
Monday, 20 June 2016
10:30
60 Minutes
G26
111
Kaiserslautern
Abstract
Counter automata are an appealing formal model of systems and programs
with an unbounded number of states that find a plethora of
applications, for instance in the verification of concurrent
shared-memory programs. A counter automaton comprises a finite-state
controller with a finite number of counters ranging over the natural
numbers that can be incremented, decremented and tested for zero when
a transition is taken. Despite having been studied since the early
days of computer science, many important problems about decidable
subclasses of counter automata have remained unsolved. This talk will
give an overview over the history and some of the progress on both
theoretical and practical aspects of counter automata that has been made
over the last two years, focusing on new results concerning reachability,
stochastic extensions, practical decision procedures, and the challenges
that lie ahead.
This talk is based on joint work with M. Blondin (Montreal), A. Finkel
(Cachan), S. Haddad (Cachan), P. Hofman (Cachan), S. Kiefer (Oxford)
and M. Lohrey (Siegen).
with an unbounded number of states that find a plethora of
applications, for instance in the verification of concurrent
shared-memory programs. A counter automaton comprises a finite-state
controller with a finite number of counters ranging over the natural
numbers that can be incremented, decremented and tested for zero when
a transition is taken. Despite having been studied since the early
days of computer science, many important problems about decidable
subclasses of counter automata have remained unsolved. This talk will
give an overview over the history and some of the progress on both
theoretical and practical aspects of counter automata that has been made
over the last two years, focusing on new results concerning reachability,
stochastic extensions, practical decision procedures, and the challenges
that lie ahead.
This talk is based on joint work with M. Blondin (Montreal), A. Finkel
(Cachan), S. Haddad (Cachan), P. Hofman (Cachan), S. Kiefer (Oxford)
and M. Lohrey (Siegen).
Contact
Susanne Girard
--email hidden
Video Broadcast
Yes
Saarbrücken
E1 5
029
passcode not visible
logged in users only
Susanne Girard, 06/16/2016 14:39 -- Created document.