Exploiting Equivalence Reduction and the Sweep-Line Method for Detecting Terminal States

Billington, Jonathan; Gallasch, Guy Edward; Kristensen, Lars Michael; Mailund, Thomas

doi:10.1109/tsmca.2003.820582

Cited by 13 publications

(8 citation statements)

References 25 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Expression (17) is then used to calculate the slack of each token k i that enables a transition T j for marking M y . Once all slacks S j (k i ) have been calculated, the option with smallest value is chosen:…”

Section: Old Node Methodsmentioning

confidence: 99%

“…The old node method algorithm stored in a tree node) from which the slack calculation process begins again by means of expression (17), to determine the transition with highest priority (i.e. most urgent) to be fired for the new marking.…”

Section: Old Node Methodsmentioning

confidence: 99%

“…15,16 The state space exploration method presented here differs from those published in the CPN's bibliography in how nodes are expanded, which in all cases is carried out according to the depth-first search strategy. 2,[7][8][9][10][11][17][18][19][20][21][22][23][24][25] A recent article 15 provides a method of state space exploration, through a two-phase algorithm, to tackle a scheduling problem: the first phase consists of a depth-first construction of the state space to find complete operation lines (sequences of tasks that lead from an initial state to a desired final state) and incomplete operation lines (sequences of tasks that lead from an initial state to an undesired final state), while the second phase consists of a breadth-first search in the state space already built in order to detect operation lines not found in the previous phase.…”

Section: Introductionmentioning

confidence: 99%

See 2 more Smart Citations

A time stamp reduction method for state space exploration using colored Petri nets

2011

View full text Add to dashboard Cite

In this paper we present a state space exploration method implemented as part of a Decision Support Tool designed to improve the performance of logistics and production systems. An efficient depth-first search strategy, together with a reduction method known as the 'Old Node Method', is introduced to improve the descendant path choice by means of an evaluation function that allows the selection of the most promising node to be expanded at any level of the path. The sub-set of the state space representing the most promising scenarios holds a set of feasible and quasi-optimal solutions.

show abstract

Section: Old Node Methodsmentioning

confidence: 99%

Section: Old Node Methodsmentioning

confidence: 99%

Section: Introductionmentioning

confidence: 99%

See 1 more Smart Citation

A time stamp reduction method for state space exploration using colored Petri nets

2011

View full text Add to dashboard Cite

show abstract

“…It is also possible to use the sweep-line method and the symmetry method simultaneously. This combination was investigated in [7] where it was demonstrated by means of experimental results that using the two methods simultaneously leads to better reduction than when either method is used in isolation.…”

Section: The Sweep-line Methodsmentioning

confidence: 99%

Application of Coloured Petri Nets in System Development

Kristensen

Jørgensen

Jensen

2004

Lecture Notes in Computer Science

View full text Add to dashboard Cite

Abstract. Coloured Petri Nets (CP-nets or CPNs) and their supporting computer tools have been used in a wide range of application areas such as communication protocols, software designs, and embedded systems. The practical application of CP-nets has also covered many phases of system development ranging from requirements to design, validation, and implementation. This paper presents four case studies where CP-nets and their supporting computer tools have been used in system development projects with industrial partners. The case studies have been selected such that they illustrate different application areas of CP-nets in various phases of system development.

show abstract

“…The theoretical foundation of the sweep-line method has been further developed in several papers [4,16,25,28,26] and the method has been implemented in the ASAP platform [35], UppAal [2], and the LoLA tool [32]. The sweep-line method has been used [17,18,22,33] for the verification of several industrialsized protocols specified using the CPN modelling language.…”

Section: Introductionmentioning

confidence: 99%

A Sweep-Line Method for Büchi Automata-based Model Checking

Évangelista

Kristensen²

2014

Fundamenta Informaticae

View full text Add to dashboard Cite

The sweep-line method allows explicit state model checkers to delete states from memory on-the-fly during state space exploration, thereby lowering the memory demands of the verification procedure. The sweep-line method is based on a least-progress-first search order that prohibits the immediate use of standard on-the-fly Büchi automata-based model checking algorithms that rely on a depth-first search order in the search for an acceptance cycle. This paper proposes and experimentally evaluates an algorithm for Büchi automata-based model checking compatible with the search order and deletion of states prescribed by the sweep-line method.

show abstract

Exploiting Equivalence Reduction and the Sweep-Line Method for Detecting Terminal States

Cited by 13 publications

References 25 publications

A time stamp reduction method for state space exploration using colored Petri nets

A time stamp reduction method for state space exploration using colored Petri nets

Application of Coloured Petri Nets in System Development

A Sweep-Line Method for Büchi Automata-based Model Checking

Contact Info

Product

Resources

About