| | SLO | ENG | Cookies and privacy

Bigger font | Smaller font

Show document Help

Title:Tvorjenje avtomatov linearnih končnih prič za formule ACTLW z orodjem EST
Authors:ID Vogrin, Rok (Author)
ID Kapus, Tatjana (Mentor) More about this mentor... New window
ID Meolic, Robert (Comentor)
Files:.pdf MAG_Vogrin_Rok_2018.pdf (666,65 KB)
MD5: 376D00DBEEE8CB1376DE075ED1ED5D06
PID: 20.500.12556/dkum/1c63a1be-c512-4325-a21e-022e7ed9e5b6
 
Language:Slovenian
Work type:Master's thesis/paper
Typology:2.09 - Master's Thesis
Organization:FERI - Faculty of Electrical Engineering and Computer Science
Abstract:Magistrsko delo obravnava tvorjenje avtomatov linearnih končnih prič veljavnosti formul akcijske logike dreves izvajanj z operatorjem unless (ACTLW -- Action-based Computation Tree Logic with Unless operator) v modelih realnih sistemov, imenovanih označeni sistemi prehajanja stanj. Namen dela je tvorjenje avtomatov prič, ki kažejo, kako so v takem modelu prisotne lastnosti, opisane z veljavno formulo ACTLW. V prvem delu naloge so predstavljeni ključni elementi za tvorjenje avtomatov prič. Vpeljana sta pojma karakteristična funkcija in binarni odločitveni graf. Definirani so označeni sistemi prehajanja stanj, končni avtomati ter logika ACTLW. V drugem delu je na podlagi definicij razvit postopek in opisana implementacija tvorjenja avtomatov linearnih končnih prič z orodjem EST. Tvorjenje avtomatov je prikazano na primeru modela komunikacijskega protokola z omejenim številom ponovnih oddaj in biološkega sistema uravnavanja laktoznega operona.
Keywords:formalne metode, preverjanje modelov, temporalna logika, avtomati prič, simbolične metode
Place of publishing:[Maribor
Publisher:R. Vogrin
Year of publishing:2018
PID:20.500.12556/DKUM-72041 New window
UDC:004.8:621.395(043.2)
COBISS.SI-ID:21776406 New window
NUK URN:URN:SI:UM:DK:0WRUZOVQ
Publication date in DKUM:09.10.2018
Views:1670
Downloads:195
Metadata:XML DC-XML DC-RDF
Categories:KTFMB - FERI
:
Copy citation
  
Average score:(0 votes)
Your score:Voting is allowed only for logged in users.
Share:Bookmark and Share



Hover the mouse pointer over a document title to show the abstract or click on the title to get all document metadata.

Licences

License:CC BY-NC-ND 4.0, Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International
Link:http://creativecommons.org/licenses/by-nc-nd/4.0/
Description:The most restrictive Creative Commons license. This only allows people to download and share the work for no commercial gain and for no other purposes.
Licensing start date:07.09.2018

Secondary language

Language:English
Title:Generating linear finite witness automata for ACTLW formulae with EST
Abstract:This master's thesis deals with the generation of linear finite witness automata witnessing the validity of ACTLW (Action-based Computation Tree Logic with Unless operator) formulae in models of real systems called labelled transition systems. The purpose of this thesis is to generate witness automata showing how in such a model, properties described by a valid ACTLW formula are present. In the first part of the thesis, key notions for the generation of witness automata are defined. Characteristic functions and binary decision diagrams are introduced, as well as labelled transition systems, finite automata and the ACTLW logic. In the second part, a procedure for generating witness automata is described, along with its implementation with the EST toolbox. The generation of automata is demonstrated on a model of the bounded retransmission protocol and on a model of the lactose operon regulatory system.
Keywords:formal methods, model checking, temporal logic, witness automata, symbolic methods


Comments

Leave comment

You must log in to leave a comment.

Comments (0)
0 - 0 / 0
 
There are no comments!

Back
Logos of partners University of Maribor University of Ljubljana University of Primorska University of Nova Gorica