Search for dissertations about: "Petri Nets Analysis"
Showing result 1 - 5 of 10 swedish dissertations containing the words Petri Nets Analysis.
-
1. Automatic Verification of Petri Netsin a CLP framework
Abstract : This thesis presents an approach to automatic verification of Petri Nets. The method is formulated in a CLP framework and the class of systems we consider is characterized syntactically as a special class of Constraint Logic Programs. The state space of the system in question coincides with the least fixpoint of the program. READ MORE
-
2. A Verification Framework for Component Based Modeling and Simulation : “Putting the pieces together”
Abstract : The discipline of component-based modeling and simulation offers promising gains including reduction in development cost, time, and system complexity. This paradigm is very profitable as it promotes the use and reuse of modular components and is auspicious for effective development of complex simulations. READ MORE
-
3. Automatic Extraction of Program Models for Formal Software Verification
Abstract : In this thesis we present a study of the generation of abstract program models from programs in real-world programming languages that are employed in the formal verification of software. The thesis is divided into three parts, which cover distinct types of software systems, programming languages, verification scenarios, program models and properties. READ MORE
-
4. A Graphical Language for Batch Control
Abstract : In this thesis a graphical language for sequential control is presented and its application to batch control is examined and discussed. The name of the language is Grafchart. Its main feature is that it makes it possible to express complicated control problems in a compact and intuitive manner. READ MORE
-
5. Model Checking Parameterized Timed Systems
Abstract : In recent years, there has been much advancement in the area of verification of infinite-state systems. A system can have an infinite state-space due to unbounded data structures such as counters, clocks, stacks, queues, etc. It may also be infinite-state due to parameterization, i.e. READ MORE