Sciweavers

1369 search results - page 193 / 274
» On the Semantics of Petri Nets
Sort
View
ENTCS
2008
97views more  ENTCS 2008»
14 years 10 months ago
An Algorithm for Approximating the Satisfiability Problem of High-level Conditions
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...
Karl-Heinz Pennemann
CMOT
2006
124views more  CMOT 2006»
14 years 10 months ago
My agents love to conform: Norms and emotion in the micro-macro link
This contribution investigates the function of emotion in relation to norms, both in natural and artificial societies. We illustrate that unintentional behavior can be normative an...
Christian von Scheve, Daniel Moldt, Julia Fix, Rol...
DSS
2006
95views more  DSS 2006»
14 years 10 months ago
On the computability of agent-based workflows
Workflow research is commonly concerned with optimization, modeling, and dependency. In this research, we however address a more fundamental issue. By modeling humans and machines...
Wai Yin Mok, Prashant Palvia, David Paper
IJSEKE
2008
103views more  IJSEKE 2008»
14 years 10 months ago
A Modeling Methodology for Conflict Control in Multi-Agent Systems
- Multi-agent systems (MASs) have become an important topic in distributed systems research. These distributed multi-agent systems call for special software modeling methods that e...
Jiexin Lian, Sol M. Shatz
FUIN
2007
120views more  FUIN 2007»
14 years 9 months ago
Concurrent Turing Machines
We define Concurrent Turing Machines (CTMs) as Turing machines with Petri nets as finite control. This leads to machines with arbitrary many tape heads, thus subsuming any class ...
Berndt Farwer, Manfred Kudlek, Heiko Rölke