2026-09-19T12:44:12Zhttp://publications.rwth-aachen.de/oai2d
oai:publications.rwth-aachen.de:620002025-01-13T08:23:13ZdnbdeliveryVDBdriverurnopen_accessopenaireengSpielmann, MarcGrädel, ErichAbstract state machines: verification problems and complexityinfo:eu-repo/classification/ddc/004InformatikAbstrakte ZustandsmaschineVerifikationKomplexitätsklasseAbstract state machines (ASMs) provide the formal foundation for a successful methodology for specification and verification of complex dynamic systems. In addition, ASMs induce a computation model on structures, which – in some sense – is more powerful and universal than the standard computation models in theoretical computer science. An investigation of ASMs is therefore interesting from both the point of view of applied computer science and the point of view of theoretical computer science. In the present thesis, practically relevant as well as theoretically motivated questions concerning ASMs are investigated. Subject of the first part of the thesis is the automatic verifiability of ASM specifications. In the second part, the ASM computation model itself and choiceless complexity classes, which have recently been defined by means of ASMs, are discussed.Aachen : Publikationsserver der RWTH Aachen University 158 S. (2000). = Aachen, Techn. Hochsch., Diss., 2000info:eu-repo/semantics/doctoralThesisinfo:eu-repo/semantics/publishedVersionPublikationsserver der RWTH Aachen University2000info:eu-repo/semantics/openAccessDEhttps://publications.rwth-aachen.de/record/62000https://publications.rwth-aachen.de/search?p=id:%22RWTH-CONV-123601%22StudentsStudent Financial Aid ProvidersTeachersResearchersinfo:eu-repo/semantics/altIdentifier/urn/urn:nbn:de:hbz:82-opus-964