957 search results - page 160 / 192 » Negotiations and Petri Nets |
TCAD
2008
14 years 11 months ago
2008
State encoding is one of the most difficult problems in the synthesis of asynchronous controllers. This paper presents a method that can solve the problem of large controllers spec...
74
Voted
ENTCS
2002
14 years 11 months ago
2002
This paper presents PLCTools, a formal environment for designing and simulating programmable controllers. Control models are specified with IEC FBD (Function Block Diagram), and t...
FAC
2002
14 years 11 months ago
2002
Action calculi, which generalise process calculi such as Petri nets, -calculus and ambient calculus, have been presented in terms of action graphs. We here offer linear action grap...
FUIN
2002
14 years 11 months ago
2002
Abstract. This article introduces probabilistic cluster branching processes, a probabilistic unfolding semantics for untimed Petri nets, with no structural or safety assumptions, g...
IANDC
2002
14 years 11 months ago
2002
We show that the following problem is decidable: given expressions E1 and E2 constructed from variables by the regular operations and shuffle, is the identity E1 = E2 true for all...