search query: @keyword reachability / total: 5
reference: 5 / 5
« previous | next »
Author: | Heljanko, Keijo |
Title: | Deadlock and Reachability Checking with Finite Complete Prefixes |
Lukkiuma- ja saavutettavuusominaisuuksien tarkastus käyttäen äärellisiä täydellisiä prefiksejä | |
Publication type: | Licentiate thesis |
Publication year: | 1999 |
Pages: | vi + 79 Language: eng |
Department/School: | Tietotekniikan osasto |
Main subject: | Digitaalitekniikka (Tik-79) |
Supervisor: | Ojala, Leo |
Instructor: | Niemelä, Ilkka |
OEVS: | Electronic archive copy is available via Aalto Thesis Database.
Instructions Reading digital theses in the closed network of the Aalto University Harald Herlin Learning CentreIn the closed network of Learning Centre you can read digital and digitized theses not available in the open network. The Learning Centre contact details and opening hours: https://learningcentre.aalto.fi/en/harald-herlin-learning-centre/ You can read theses on the Learning Centre customer computers, which are available on all floors.
Logging on to the customer computers
Opening a thesis
Reading the thesis
Printing the thesis
|
Location: | P1 Ark T80 | Archive |
Keywords: | computer aided verification Petri nets finite complete prefixes net unfoldings model checking deadlocks reachability logic programs stable model semantics computational complexity tietokoneavusteinen verifiointi Petri-verkot äärelliset täydelliset prefiksit verkkojen suoristus mallintarkastus lukkiumat saavutettavuus logiikkaohjelmat stabiilien mallien semantiikka laskennallinen vaativuus |
ED: | 2000-01-11 |
INSSI record number: 15114
+ add basket
« previous | next »
INSSI