Compound Petri nets and alternatives aggregation Petri nets: Two formalisms for decision-making support
نویسندگان
چکیده
منابع مشابه
Multilayered petri-nets for distributed decision making*
Decision making networks, employed for the control of complex cybernetic systems,6,7,8,9,10 operate on the "Command, Status, and Message Layers" of concurrent decision making activity. Decision making "nodes" function as multitasking operators on all three layers, by executing command decomposition, status reporting, and message exchanging tasks for the concurrent implementation of various cont...
متن کاملSoccer Goalkeeper Task Modeling and Analysis by Petri Nets
In a robotic soccer team, goalkeeper is an important challenging role, which has different characteristics from the other teammates. This paper proposes a new learning-based behavior model for a soccer goalkeeper robot by using Petri nets. The model focuses on modeling and analyzing, both qualitatively and quantitatively, for the goalkeeper role so that we have a model-based knowledge of the ta...
متن کاملTool Support for Haskell-Coloured Petri Nets
Haskell-Coloured Petri Nets (HCPNs) are one instance of a class of high-level Petri Nets which combines graphical description of concurrent system structure (causal dependencies, concurrency, conflict over shared resources, data transport) with functional specification of data manipulation. In an earlier paper [6], we introduced HCPN to demonstrate how any functional language supporting a few c...
متن کاملData Decision Diagrams for Petri Nets Analysis
This paper presents a new data structure, the Data Decision Diagrams, equipped with a mechanism allowing the definition of application-specific operators. This mechanism is based on combination of inductive linear functions offering a large expressiveness while alleviating for the user the burden of hard coding traversals in a shared data structure. We demonstrate the pertinence of our system t...
متن کاملDecision Problems for Petri Nets with Names
We prove several decidability and undecidability results for ν-PN, an extension of P/T nets with pure name creation and name management. We give a simple proof of undecidability of reachability, by reducing reachability in nets with inhibitor arcs to it. Thus, the expressive power of ν-PN strictly surpasses that of P/T nets. We prove that ν-PN are Well Structured Transition Systems. In particul...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Advances in Mechanical Engineering
سال: 2016
ISSN: 1687-8140,1687-8140
DOI: 10.1177/1687814016680516