58 search results - page 4 / 12 » A Class of Petri Nets with a Convex Reachability Set |
89
Voted
ACTA
2007
14 years 11 months ago
2007
Abstract This paper introduces the notion of well-structured language. A wellstructured language can be defined by a labelled well-structured transition system, equipped with an u...
124
click to vote
ICINCO
2009
14 years 9 months ago
2009
This paper serves as a support for the plenary address given by the second author during the conference. In this paper we present an approach to on-line diagnosis of discrete even...
FUIN
2007
14 years 11 months ago
2007
It is shown that the boundedness problem for a certain class of basic object nets and a corresponding class of multiset rewriting systems is decidable. To achieve this result Dicks...
CAV
2010
Springer
15 years 2 months ago
2010
Springer
We consider the class of finite-state programs executed by an unbounded number of replicated threads communicating via shared variables. The thread-state reachability problem for t...
TACAS
2007
Springer
15 years 5 months ago
2007
Springer
Abstract. Time Petri Nets (TPN) and Timed Automata (TA) are widely-used formalisms for the modeling and analysis of timed systems. A recently-developed approach for the analysis of...