Results 1  10
of
10
Coping With Strong Fairness
, 2000
"... We consider the verification of linear temporal logic (LTL) properties of Petri nets, where the transitions can have both weak and strong fairness constraints. Allowing the transitions to have weak or strong fairness constraints simplies the modeling of systems in many cases. We use the automata the ..."
Abstract

Cited by 13 (3 self)
 Add to MetaCart
We consider the verification of linear temporal logic (LTL) properties of Petri nets, where the transitions can have both weak and strong fairness constraints. Allowing the transitions to have weak or strong fairness constraints simplies the modeling of systems in many cases. We use the automata theoretic approach to model checking. To cope with the strong fairness constraints efficiently we employ Streett automata where appropriate. We present memory efficient algorithms for both the emptiness checking and counterexample generation problems for Streett automata.
prod 3.2  An Advanced Tool for Efficient Reachability Analysis
"... prod is areachability analyzer for Predicate/Transition Nets. The tool incorporates several advanced reduced ..."
Abstract

Cited by 12 (4 self)
 Add to MetaCart
prod is areachability analyzer for Predicate/Transition Nets. The tool incorporates several advanced reduced
extended Computation Tree Logic
 Workshop Concurrency, Speci & Programming, number 140 in InformatikBericht
, 2000
"... We define an extension of CTL in which we are able to quantify over a selectable set of next states and use transition formulae to limit the range of quantifiers in temporal operators. ..."
Abstract

Cited by 6 (0 self)
 Add to MetaCart
(Show Context)
We define an extension of CTL in which we are able to quantify over a selectable set of next states and use transition formulae to limit the range of quantifiers in temporal operators.
Firstorder resolution for CTL
"... In this paper, we describe an approach to theorem proving in Computational Tree Logic (CTL) which utilises classical firstorder resolution techniques. Since there already exist a lot of welldeveloped firstorder logic theorem provers, reusing those techniques provides great benefit for solving oth ..."
Abstract

Cited by 4 (1 self)
 Add to MetaCart
(Show Context)
In this paper, we describe an approach to theorem proving in Computational Tree Logic (CTL) which utilises classical firstorder resolution techniques. Since there already exist a lot of welldeveloped firstorder logic theorem provers, reusing those techniques provides great benefit for solving other similar problems. We do not attempt to prove CTL theorems directly within the temporal logic syntax. We first translate arbitrary CTL formulae into a normal form for CTL and then implement the CTL calculus using resolution in firstorder logic. After that, we utilise an efficient firstorder logic theorem prover, for example, VAMPIRE or SPASS to carry out proof. Further, this approach has the potential to be extended to solve problems in other logics. 1
Petri Net Analysis and Nonmonotonic Reasoning
"... The paper presents a symbolic analysis method for solving bounded deadlock detection and reachability questions for Petri nets using nonmonotonic reasoning techniques. More precisely, a mapping is devised such that given a 1safe P/Tnet, some Boolean conditions on the initial marking, and a bound n ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
The paper presents a symbolic analysis method for solving bounded deadlock detection and reachability questions for Petri nets using nonmonotonic reasoning techniques. More precisely, a mapping is devised such that given a 1safe P/Tnet, some Boolean conditions on the initial marking, and a bound n, a logic program is obtained such that there is an execution of at most n steps of the net starting from some initial marking satisfying the conditions leading to deadlock iff the logic program has a stable model. A similar mapping is given for reachability questions from a set of initial markings satisfying given Boolean conditions. Experiments to solve deadlock problems using the Smodels system as the stable model finder indicate that the approach can provide a competitive method for finding short executions to deadlocks.
extended Computation Tree Logic: Implementation and Application
, 2000
"... We dfine an extension of CTL in which we are able to quantify over a selectable set of next states and use transition formulae to limit the range of quantifiers in temporal operators. ..."
Abstract
 Add to MetaCart
(Show Context)
We dfine an extension of CTL in which we are able to quantify over a selectable set of next states and use transition formulae to limit the range of quantifiers in temporal operators.
Coping with Strong Fairness  Onthefly Emptiness Checking for Streett Automata
, 1999
"... The model checking approach to verication has proven to be very successful. Stating the required properties in temporal logic allows the process of verication to be automated. ..."
Abstract
 Add to MetaCart
The model checking approach to verication has proven to be very successful. Stating the required properties in temporal logic allows the process of verication to be automated.
Differences Between
"... 4. Run "prpp optionsifwanted mynet" by using the Run option of the File menu of the File Manager. If you want, you can copy text from the Stdin/Stdout/Stderr window of the prpp program to some text editor window in the usual "copy and paste" style. After you've seen that ..."
Abstract
 Add to MetaCart
4. Run "prpp optionsifwanted mynet" by using the Run option of the File menu of the File Manager. If you want, you can copy text from the Stdin/Stdout/Stderr window of the prpp program to some text editor window in the usual "copy and paste" style. After you've seen that the program has finished its execution and you do not need the output of the program any more, you can close the windows of the program with a single action e.g. by choosing the Exit option from the File menu of the window named by the program. These instructions apply to all those programs of PROD that are run by using the above mentioned Run option. (See Figure 2.) 5. In the MSDOS emulator, execute the command "prod mynet.compile" and then the command "tmp.bat". 6. Run "mynet optionsifwanted" by u
Visual Specification Language and Automatic Checking of Business Process
"... In this work we propose a visual language for specifying behavioral properties of business processes (BP). We use Business process modeling notation (BPMN) to modelize BP, Petri Net as underlying formal foundations, and SPIN model checker to validate the dynamic behaviors of this process. The object ..."
Abstract
 Add to MetaCart
In this work we propose a visual language for specifying behavioral properties of business processes (BP). We use Business process modeling notation (BPMN) to modelize BP, Petri Net as underlying formal foundations, and SPIN model checker to validate the dynamic behaviors of this process. The objective of this paper is to propose graphical property specification language which can be used during the design phase of BP. The proposed visual language uses the same concepts as established in BPMN to specify the properties to be verified. A semantic interpretation for properties expressed is given based en temporal logic formulas. The advantage of the proposed language is that it hides the temporal logic used for the specification of properties, and the knowledge of this logic is not needed.