100 search results - page 2 / 20 » On the Semantics of Place Transition Nets |
APN
1995
Springer
13 years 11 months ago
1995
Springer
The first part of this paper gives an algebraic semantics for Place/Transition nets in terms of an algebra which is based on the process algebra ACP. The algebraic semantics is s...
BIRTHDAY
2008
Springer
13 years 9 months ago
2008
Springer
Reconfigurable place/transition systems are Petri nets with initial markings and a set of rules which allow the modification of the net during runtime in order to adapt the net to ...
ATVA
2006
Springer
13 years 11 months ago
2006
Springer
In this paper we give a symbolic concurrent semantics for network of timed automata (NTA) in terms of extended symbolic nets. Extended symbolic nets are standard occurrence nets ex...
ECEASST
2008
13 years 7 months ago
2008
: This paper introduces negative application conditions for reconfigurable place/transition nets. These are Petri nets together with a set of rules that allow changing the net and ...
CMSB
2008
Springer
13 years 9 months ago
2008
Springer
Abstract. This paper gives algebraic definitions for obtaining the minimal transition and place flows of a modular Petri net from the minimal transition and place flows of its comp...