Verification of Automata with Storage Mechanisms - Couverture souple

Name: Verification of Automata with Storage Mechanisms
Author: K�cher, Chris
ISBN: 9783863602659

K�cher, Chris

9783863602659: Verification of Automata with Storage Mechanisms

Couverture souple

ISBN 10 : 386360265X ISBN 13 : 9783863602659

Editeur : Technische Universit�t Il, 2023

Afficher les exemplaires de cette �dition comportant l'ISBN

0 D'occasion

4 Neuf

De EUR 18

D�tails de l'�dition

�diteur: Technische Universit�t Il
Date d'�dition: 2023
Langue: anglais
ISBN 10: 386360265X
ISBN 13: 9783863602659
Reliure: Broch�
Nombre de pages: 260
Coordonn�es du fabricant: non disponible
Personne responsable: non disponible

R�sultats de recherche pour Verification of Automata with Storage Mechanisms

Image fournie par le vendeur

Verification of Automata with Storage Mechanisms

Chris K�cher

Edit� par Universit�tsverlag Ilmenau Dez 2022, 2022

ISBN 10 : 386360265X ISBN 13 : 9783863602659

Neuf Taschenbuch

impression � la demande

Vendeur : BuchWeltWeit Ludwig Meier e.K., Bergisch Gladbach, Allemagne

�valuation du vendeur 5 sur 5 �toiles

Taschenbuch. Etat : Neu. This item is printed on demand - it takes 3-4 days longer - Neuware -An important question in computer science is to ask, whether a given system conforms to a specification. Often this question is equivalent to ask whether a finite automaton with certain memory like a stack or queue can reach some given state. In this thesis we focus this reachability problem of automata having one or more lossy or reliable stacks or queues as their memory. Unfortunately, the reachability problem is undecidable or of high complexity in most of these cases. We circumvent this by several approximation methods. So we extend the exploration algorithm by Boigelot and Godefroid under-approximating the reachability problem of queue automata. We also study some automata having multiple stacks with a restricted behavior. These �asynchronous pushdown systems� have an efficiently decidable reachability problem. To show our results we first have to gain knowledge of several algebraic properties of the so-called transformation monoid of the studied storage mechanisms. 260 pp. Englisch. N� de r�f. du vendeur 9783863602659

Contacter le vendeur

Acheter neuf

EUR 18

Exp�dition �EUR 23
Exp�dition depuis Allemagne vers Etats-Unis

Quantit� disponible : 2 disponible(s)

Ajouter au panier

Image fournie par le vendeur

Verification of Automata with Storage Mechanisms

Chris K�cher

Edit� par Universit�tsverlag Ilmenau, 2023

ISBN 10 : 386360265X ISBN 13 : 9783863602659

Neuf Taschenbuch

impression � la demande

Vendeur : AHA-BUCH GmbH, Einbeck, Allemagne

�valuation du vendeur 5 sur 5 �toiles

Taschenbuch. Etat : Neu. nach der Bestellung gedruckt Neuware - Printed after ordering - An important question in computer science is to ask, whether a given system conforms to a specification. Often this question is equivalent to ask whether a finite automaton with certain memory like a stack or queue can reach some given state. In this thesis we focus this reachability problem of automata having one or more lossy or reliable stacks or queues as their memory. Unfortunately, the reachability problem is undecidable or of high complexity in most of these cases. We circumvent this by several approximation methods. So we extend the exploration algorithm by Boigelot and Godefroid under-approximating the reachability problem of queue automata. We also study some automata having multiple stacks with a restricted behavior. These �asynchronous pushdown systems� have an efficiently decidable reachability problem. To show our results we first have to gain knowledge of several algebraic properties of the so-called transformation monoid of the studied storage mechanisms. N� de r�f. du vendeur 9783863602659

Contacter le vendeur

Acheter neuf

EUR 18

Exp�dition �EUR 35
Exp�dition depuis Allemagne vers Etats-Unis

Quantit� disponible : 1 disponible(s)

Ajouter au panier

Image fournie par le vendeur

Verification of Automata with Storage Mechanisms

Chris K�cher

Edit� par Universit�tsverlag Ilmenau Jan 2023, 2023

ISBN 10 : 386360265X ISBN 13 : 9783863602659

Neuf Taschenbuch

impression � la demande

Vendeur : buchversandmimpf2000, Emtmannsberg, BAYE, Allemagne

�valuation du vendeur 5 sur 5 �toiles

Taschenbuch. Etat : Neu. This item is printed on demand - Print on Demand Titel. Neuware -An important question in computer science is to ask, whether a given system conforms to a specification. Often this question is equivalent to ask whether a finite automaton with certain memory like a stack or queue can reach some given state. In this thesis we focus this reachability problem of automata having one or more lossy or reliable stacks or queues as their memory. Unfortunately, the reachability problem is undecidable or of high complexity in most of these cases. We circumvent this by several approximation methods. So we extend the exploration algorithm by Boigelot and Godefroid under-approximating the reachability problem of queue automata. We also study some automata having multiple stacks with a restricted behavior. These �asynchronous pushdown systems� have an efficiently decidable reachability problem. To show our results we first have to gain knowledge of several algebraic properties of the so-called transformation monoid of the studied storage mechanisms.Books on Demand GmbH, �berseering 33, 22297 Hamburg 260 pp. Englisch. N� de r�f. du vendeur 9783863602659

Contacter le vendeur