Generating CA-Plans from Multisets of Services

DSpace/Manakin Repository

Show full item record

Title Generating CA-Plans from Multisets of Services
Autor: Mikulski, Łukasz; Niewiadomski, Artur; Piątkowski, Marcin; Smyczyński, Sebastian
URI: http://hdl.handle.net/11331/326
Date: 2014
Źródło: Proceedings of the International Workshop on Petri Nets and Software Engineering PNSE’14 / eds. Daniel Moldt, Heiko Rölke. - Hamburg : University of Hamburg. Department of Informatics, 2014, vol. 1160, pp. 347-348
Abstract: The main idea of solving WSCP utilised by Planics is to divide the composition process into several stages. The first phase, called abstract planning, deals with an ontology which contains a hierarchy of classes describing sets of real-world services and processed object types. Our abstract planners find multisets of service types that potentially satisfy a user query. Still, each equivalence class defined by a multiset can be viewed as the union of finer equivalence classes defined by partial orders, in which the plans differ only in the ordering of context independent services. Finding all of such classes is the task of Multiset Explorer - a module of Planics presented here.
Description: Proceedings of the International Workshop on Petri Nets and Software Engineering, co-located with 35th International Conference on Application and Theory of Petri Nets and Concurrency (PetriNets 2014) and 14th International Conference on Application of Concurrency to System Design {(ACSD} 2014), Tunis, Tunisia, June 23-24, 2014.

Files in this item

This item appears in the following Collection(s)

Search DSpace


Advanced Search

Browse

My Account

Statistics