STG decomposition strategies in combination with unfolding

Khomenko, Victor; Schaefer, Mark; Vogler, Walter; Wollowski, Ralf

doi:10.1007/s00236-009-0102-y

Cited by 11 publications

(13 citation statements)

References 17 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…As we need to work with safe Petri nets (essentially because solutions to planning problems are found using unfolding techniques [5]) we are interested only in secure t-contractions preserving safeness. The proposition below gives a cheap sufficiency test for a contraction to be secure and safeness-preserving (it is obtained by combination of the definition of secure given above with the sufficient conditions for safeness-preserving given in [18]). Proposition 3.…”

Section: ) Contraction Of Silent Transitionsmentioning

confidence: 99%

“…There exists a full characterisation of safeness-preserving contractions as a model checking problem [18]. However, testing it is much more expensive, so we do not consider it.…”

Section: ) Contraction Of Silent Transitionsmentioning

confidence: 99%

“…Moreover, depending on the order of the transition contractions and of the redundant places and transitions removing, the nets obtained may vary. Some guidelines about which silent transitions should be removed first are given in [18].…”

Section: ) Contraction Of Silent Transitionsmentioning

confidence: 99%

See 2 more Smart Citations

Factored Planning: From Automata to Petri Nets

Jezequel

Fabre

Khomenko

2013

2013 13th International Conference on Application of Concurrency to System Design

Self Cite

View full text Add to dashboard Cite

Abstract-Factored planning mitigates the state space explosion problem by avoiding the construction of the state space of the whole system and instead working with the system's components. Traditionally, finite automata have been used to represent the components, with the overall system being represented as their product. In this paper we change the representation of components to safe Petri nets. This allows one to use cheap structural operations like transition contractions to reduce the size of the Petri net, before its state space is generated, which often leads to substantial savings compared with automata. The proposed approach has been implemented and proven efficient on several factored planning benchmarks.

show abstract

Section: ) Contraction Of Silent Transitionsmentioning

confidence: 99%

“…There exists a full characterisation of safeness-preserving contractions as a model checking problem [18]. However, testing it is much more expensive, so we do not consider it.…”

Section: ) Contraction Of Silent Transitionsmentioning

confidence: 99%

See 1 more Smart Citation

Factored Planning: From Automata to Petri Nets

Jezequel

Fabre

Khomenko

2013

2013 13th International Conference on Application of Concurrency to System Design

Self Cite

View full text Add to dashboard Cite

show abstract

“…In practice, it is often convenient to work with safe nets, and for this [7] introduced safeness-preserving contractions, i.e. ones which guarantee that the transformed STG is safe if the initial one was.…”

Section: Examples Of Stgs Are Shown In Figs 1 Andmentioning

confidence: 99%

“…(Note that the transitions with weighted arcs must be dead in a safe Petri net, and so we can assume that the initial and all the intermediate STGs contain no such arcs.) Also, [7] developed a sufficient structural condition for a contraction to be safeness-preserving.…”

Section: Examples Of Stgs Are Shown In Figs 1 Andmentioning

confidence: 99%

Improved Parallel Composition of Labelled Petri Nets

Alekseyev

Khomenko

Mokhov

et al. 2011

2011 Eleventh International Conference on Application of Concurrency to System Design

Self Cite

View full text Add to dashboard Cite

show abstract

Modal algebra and Petri nets

Dang

Möller

2015

Acta Informatica

View full text Add to dashboard Cite

We use the by now well established setting of modal semirings to derive a modal algebra for Petri nets. It is based on a relation-algebraic calculus for separation logic that enables calculations of properties in a pointfree fashion and at an abstract level. Basically, we start from an earlier logical approach to Petri nets that in particular uses modal box and diamond operators for stating properties about the state space of such a net. We provide relational translations of the logical formulas which further allow the characterisation of general behaviour of transitions in an algebraic fashion. From the relational structure an algebra for frequently used properties of Petri nets is derived. In particular, we give connections to typical used assertion classes of separation logic. Moreover, we demonstrate applicability of the algebraic approach by calculations concerning a standard example of a mutex net.Walter Vogler and Bernhard Möller have now for about 22 years been working at the Institute for Informatics at the University of Augsburg in close neighbourhood. Both were and are very much interested in formal semantics, although in different areas: Walter in concurrent, Bernhard in sequential systems. Still there were many debates whether or how their fields of work could have concrete common touchpoints, in particular, since both use algebraic concepts to a smaller or larger extent. Since in recent years Bernhard also started looking at the concurrent side, we felt that Walter's upcoming jubilee was the right point in time to try and construct a bridge (or at least a gangplank) between the two fields. Therefore it is our great pleasure to dedicate this paper to Walter Vogler on the occasion of his 60th birthday, also with sincere thanks for his friendship and the pleasant collaboration. May he continue to throw out his nets to bring in an ample harvest of impressive results! This research was partially funded by the DFG project MO 690/9-1 AlgSep-Algebraic Calculi for Separation Logic.

show abstract

STG decomposition strategies in combination with unfolding

Cited by 11 publications

References 17 publications

Factored Planning: From Automata to Petri Nets

Factored Planning: From Automata to Petri Nets

Improved Parallel Composition of Labelled Petri Nets

Modal algebra and Petri nets

Contact Info

Product

Resources

About