![]() In: Summaries of the Summer Institute of Symbolic Logic, vol. Ĭhurch, A.: Applications of recursive arithmetic to the problem of circuit synthesis. (eds.) Proceedings of First Workshop on Synthesis (SYNT), EPTCS, vol. We identify improvements either regarding the size or the functionality of the benchmark families by examining the high-level Petri games.īloem, R.P., Gamauf, H.J., Hofferek, G., Könighofer, B., Könighofer, R.: Synthesizing robust systems with RATSY. We describe example benchmark families as a high-level version of a Petri game and exhibit an instantiation yielding a concrete 1-bounded Petri game. It enables the user to specify an entire benchmark family as one parameterized high-level net. In this paper, we introduce a new possibility to represent benchmark families for the synthesis of distributed systems modeled with Petri games. ![]() To evaluate the tool, it has been checked on a series of parameterized benchmarks from manufacturing and workflow scenarios. This result forms the basis of the tool AdamSYNT that implements an algorithm for the synthesis of distributed controllers from Petri games. For Petri games with one environment player and an arbitrary bounded number of system players, deciding the existence of a safety strategy is EXPTIME-complete. Petri games have been introduced as a multi-player game model representing causal memory to address the synthesis of distributed systems.
0 Comments
Leave a Reply. |
AuthorWrite something about yourself. No need to be fancy, just an overview. ArchivesCategories |