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

Barbara König

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

Sujets

• University of Duisburg-Essen

Informations

• Publié par: pefav
• Nombre de lectures: 15
• Langue: English

Extrait

oMitavitnorGpahuAotamatnadoLigscaHdnilngfoeVyraLgreuAotamatB(DD)smIlpmeneatitno& InductiveGenerationandBDD-based RepresentationofGraphAutomata BarbaraKo¨nig Universita¨tDuisburg-Essen,Germany xEpremi JointworkwithChristophBlumeandSanderBruggink aBbrraao¨KingrGpahuAotamat nestoCcnlsuoin 1

oMitavitnorGpahA Overview 1 2 3 4 5 tumotaaa Motivation dnoLigscaHdnilngfoeVyrL GraphAutomataandLogics raeguAotamatB(DD)smIlpmeneatitno&xEpreminest HandlingofVeryLargeAutomata(BinaryDecisionDiagrams) ImplementationandExperiments ConclusionandFutureWork aBbrraao¨KingrGpahuAotamat oCcnlsuoin 2

oMitavitnorGpahuAot Motivation amatnadoLigscaHdnilngfoeVyraLgreuAotamatB(DD)smIlpmeneatitno&xEpreminest Ouroverallaimistheverificationofdynamicsystems,especially graphtransformationsystems(GTSs). Sofar:weworkedon Partialordertechniquesandover-approximation ❀ tool Augur2 Behaviouralequivalences (borrowedcontexttechnique) C Backwardsanalysis (basedonwell-structuredtransitionsystemsandgraphminor theory) aBbrraao¨KingrGpahuAotamat ocnlsuoin 3