Motivation Graph Automata and Logics Handling of Very Large Automata BDDs Implementation Experiments Conclusion

-

English
34 Pages
Read an excerpt
Gain access to the library to view online
Learn more

Description

Motivation Graph Automata and Logics Handling of Very Large Automata (BDDs) Implementation & Experiments Conclusion Inductive Generation and BDD-based Representation of Graph Automata Barbara Konig Universitat Duisburg-Essen, Germany Joint work with Christoph Blume and Sander Bruggink Barbara Konig Graph Automata 1

  • both recognizable

  • universitat duisburg-essen

  • partial order techniques

  • regular model checking

  • order

  • graph automata


Subjects

Informations

Published by
Reads 15
Language English
Report a problem
oMitavitnorGpahuAotamatnadoLigscaHdnilngfoeVyraLgreuAotamatB(DD)smIlpmeneatitno&InductiveGenerationandBDD-basedRepresentationofGraphAutomataBarbaraKo¨nigUniversita¨tDuisburg-Essen,GermanyxEpremiJointworkwithChristophBlumeandSanderBrugginkaBbrraao¨KingrGpahuAotamatnestoCcnlsuoin1
oMitavitnorGpahAOverview12345tumotaaaMotivationdnoLigscaHdnilngfoeVyrLGraphAutomataandLogicsraeguAotamatB(DD)smIlpmeneatitno&xEpreminestHandlingofVeryLargeAutomata(BinaryDecisionDiagrams)ImplementationandExperimentsConclusionandFutureWorkaBbrraao¨KingrGpahuAotamatoCcnlsuoin2
oMitavitnorGpahuAotMotivationamatnadoLigscaHdnilngfoeVyraLgreuAotamatB(DD)smIlpmeneatitno&xEpreminestOuroverallaimistheverificationofdynamicsystems,especiallygraphtransformationsystems(GTSs).Sofar:weworkedonPartialordertechniquesandover-approximationtoolAugur2Behaviouralequivalences(borrowedcontexttechnique)CBackwardsanalysis(basedonwell-structuredtransitionsystemsandgraphminortheory)aBbrraao¨KingrGpahuAotamatocnlsuoin3