A unified approach for deciding the existence of certain petri net paths

Yen, Hsu-Chun

doi:10.1016/0890-5401(92)90059-o

Cited by 62 publications

(45 citation statements)

References 23 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…The complexity bounds for EL follow from Lemma 1 above and from the fact that the existence of an infinite run in a Petri net is decidable in EX-PSPACE [15] and EXPSPACE-hard (see e.g. [12]).…”

Section: Relationship To Petri Netsmentioning

confidence: 99%

Energy Games in Multiweighted Automata

Fahrenberg

Juhl

Larsen

et al. 2011

Theoretical Aspects of Computing – ICTAC 2011

View full text Add to dashboard Cite

Abstract. Energy games have recently attracted a lot of attention. These are games played on finite weighted automata and concern the existence of infinite runs subject to boundary constraints on the accumulated weight, allowing e.g. only for behaviours where a resource is always available (nonnegative accumulated weight), yet does not exceed a given maximum capacity. We extend energy games to a multiweighted and parameterized setting, allowing us to model systems with multiple quantitative aspects. We present reductions between Petri nets and multiweighted automata and among different types of multiweighted automata and identify new complexity and (un)decidability results for both one-and two-player games. We also investigate the tractability of an extension of multiweighted energy games in the setting of timed automata.

show abstract

Section: Relationship To Petri Netsmentioning

confidence: 99%

Energy Games in Multiweighted Automata

Fahrenberg

Juhl

Larsen

et al. 2011

Theoretical Aspects of Computing – ICTAC 2011

View full text Add to dashboard Cite

show abstract

“…The boundedness problem for parallel-composition-VASS is polynomially equivalent to the boundedness problem for Petri nets, which is § " ! # -complete [17].…”

Section: Level 2: Parallel-composition-vassmentioning

confidence: 99%

A Scalable Incomplete Test for Message Buffer Overflow in Promela Models

Leue

Mayr

Wei

2004

Model Checking Software

View full text Add to dashboard Cite

Abstract. In Promela, communication buffers are defined with a fixed length, and buffer overflows can be handled in two different ways: block the send statement or lose the message. Both solutions change the semantics of the system, compared to one with unbounded channels. The question arises, if such buffer overflows can ever occur in a given system and what buffer lengths are sufficient to avoid them. We describe a scalable incomplete boundedness test for the communication buffers in Promela models, which is based on overapproximation and static analysis. We first reduce Promela models to systems of communicating finite state machines (CFSMs) and then apply further abstractions that leave us with a system of linear inequalities. Those represent the message sending and receiving effect that the control flow cycles of every process have on any message buffer. The test tries to establish the existence of a linear combination of the effect vectors so that at least one message can occur an unbounded number of times. If no such linear combination exists then the system is bounded. We discuss the complexity of this test and present experimental results using our implementation in the IBOC system. Scalability of the test is in part due to the fact that it is polynomial for the type of sparse control flow graphs derived from Promela models. Also, the analysis is local, i.e., it avoids the combinatorial state space explosion due to concurrency of the models. We also present a method to derive upper bound estimates for the maximal occupancy of each individual message buffer. Previously, we have applied this approach to UML RT models, while in this paper we focus on the additional problems specific to Promela code: determining the potential message types of any channel, tracking potential contents of variables, channels passed as arguments to processes, channel assignments, channel arrays and parallel process creation.

show abstract

“…(It will be shown later that parallel-composition-VASS are in some respects more succinct that normal VASS.) The boundedness problem for parallel-composition-VASS is polynomially equivalent to the boundedness problem for Petri nets, which is EXPSPACE -complete [29].…”

Section: Level 2: Parallel-composition-vassmentioning

confidence: 99%

A Scalable Incomplete Test for the Boundedness of UML RT Models

Leue

Mayr

Wei

2004

Tools and Algorithms for the Construction and Analysis of Systems

View full text Add to dashboard Cite

Abstract. We describe a scalable incomplete boundedness test for the communication buffers in UML RT models. UML RT is a variant of the UML modeling language, tailored to describing asynchronous concurrent embedded systems. We reduce UML RT models to systems of communicating finite state machines (CFSMs). We propose a series of further abstractions that leaves us with a system of linear inequalities. Those represent the message sending and receiving effect that the control flow cycles of every process have on the overall message buffer. The test tries to establish the existence of a linear combination of the effect vectors so that at least one message can occur an unbounded number of times. We discuss the complexity of this test and present experimental results using the IBOC system that we are implementing. Scalability of the test is in part due to the fact that it is polynomial for the type of sparse control flow graphs that are derived from UML RT models. Also, the analysis is local, i.e., it avoids the combinatorial state space explosion due to concurrency of the models. We also present a method to derive upper bound estimates for the maximal occupancy of each individual message buffer. While we focus on the analysis of UML RT models, the analysis can directly be applied to any type of CFSM models.

show abstract

A unified approach for deciding the existence of certain petri net paths

Cited by 62 publications

References 23 publications

Energy Games in Multiweighted Automata

Energy Games in Multiweighted Automata

A Scalable Incomplete Test for Message Buffer Overflow in Promela Models

A Scalable Incomplete Test for the Boundedness of UML RT Models

Contact Info

Product

Resources

About