47 search results - page 7 / 10 » Decidability Problems in Petri Nets with Names and Replicati... |
FSTTCS
2008
Springer
14 years 10 months ago
2008
Springer
ABSTRACT. Multiset pushdown systems have been introduced by Sen and Viswanathan as an adequate model for asynchronous programs where some procedure calls can be stored as tasks to ...
71
Voted
CONCUR
2004
Springer
15 years 3 months ago
2004
Springer
Netcharts have been introduced recently by Mukund et al. in [17]. This new appealing approach to the specification of collections of message sequence charts (MSCs) benefits from ...
101
click to vote
FOSSACS
2004
Springer
15 years 1 months ago
2004
Springer
In the literature there are several CCS-like process calculi differing in the constructs for the specification of infinite behavior and in the scoping rules for channel names. In t...
STACS
2007
Springer
15 years 3 months ago
2007
Springer
We consider commutative string rewriting systems (Vector Addition Systems, Petri nets), i.e., string rewriting systems in which all pairs of letters commute. We are interested in r...
ENTCS
2008
14 years 9 months ago
2008
The satisfiability problem is the fundamental problem in proving the conflict-freeness of specifications, or in finding a counterexample for an invalid statement. In this paper, w...