Filters








46 Hits in 7.9 sec

Optimal Label Splitting for Embedding an LTS into an arbitrary Petri Net Reachability Graph is NP-complete [article]

Uli Schlachter, Harro Wimmel
2020 arXiv   pre-print
For a given labelled transition system (LTS), synthesis is the task to find an unlabelled Petri net with an isomorphic reachability graph.  ...  Using the label splitting, we can construct a labelled Petri net with the intended bahaviour (e.g. embedding the given LTS in its reachability graph).  ...  or equivalently Can we find an arbitrary, labelled Petri net with at most n transitions such that a given LTS is embedded in its reachability graph?  ... 
arXiv:2002.04841v1 fatcat:5itv6enhizdjxcdpnscsvexzla

Some Basic Techniques allowing Petri Net Synthesis: Complexity and Algorithmic Issues [article]

Raymond Devillers, Ronny Tredup
2022 arXiv   pre-print
In this paper we show that the task of converting an unimplementable transition system into an implementable one by removing as few states or events or edges as possible is NP-complete – regardless of  ...  In Petri net synthesis we ask whether a given transition system A can be implemented by a Petri net N.  ...  We would like to thank the anonymous reviewers of the original version of this paper, and this extended version for their detailed comments and valuable suggestions.  ... 
arXiv:2112.03605v2 fatcat:pyilh7laprdnjj4jqffbrqbfwq

Process Completing Sequences for Resource Allocation Systems with Synchronization

Song Foh Chew, Shengyong Wang, Mark A. Lawley
2012 Journal of Control Science and Engineering  
Throughout the paper, we use a class of Petri nets called Generalized Augmented Marked Graphs to represent our resource allocation systems.  ...  Establishing live resource allocation in this class of systems is challenging since deciding whether a given level of resource capacities is sufficient to complete a single process is NP-complete.  ...  For a quasi-live process, the reachability graph provides complete information about the resource allocation sequences that can be used.  ... 
doi:10.1155/2012/424051 fatcat:yj5fro3gv5c6nmmwd6xdbz3g4y

State Space Methods for Coloured Petri Nets

Lars Michael Kristensen
2000 DAIMI Report Series  
We suggest an approximative method for computing stubborn sets of so-called process-partitioned Coloured Petri Nets which does not rely on unfolding.  ...  The basic idea underlying state spaces is (in its simplest form) to compute all reachable states and state changes of the system, and represent these as a directed graph.  ...  In its simplest form, an occurrence graph for a CP-net is a directed graph with a node for each reachable marking and an arc for each occurring binding element.  ... 
doi:10.7146/dpb.v29i546.7080 fatcat:6m5iv66devhdhcuiri644cytca

Subject index volumes 1–200

1999 Theoretical Computer Science  
graphs, 2078.2759, 2774 object, 2266 split-free, 1169 MVD's, 1169 split-freedom, 1169 splitting, 3089 properties of the lattice of NP sets, 502 transitions, 1451, 1780 SPMHFA (simple multihead  ...  ,-sparse -, 3423 partioning. algorithms for -, 396 graph partition problem, 1437 problems. 2774 graph paths, 232 graph problems, 2403, 3267 dynamic -, 3020 kernel of -+ 2726 NP-completeness of  ... 
doi:10.1016/s0304-3975(98)00319-3 fatcat:s22ud3iiqjht7lfbtc3zctk7zm

Model checking using net unfoldings

Javier Esparza
1994 Science of Computer Programming  
The new algorithm is shown to be polynomial in the size of the net for i-safe conflict-free Petri nets, while the algorithms of the literature require exponential time. ' A shortened version of this paper  ...  McMillan ( 1992) described a technique for deadlock detection based on net unfoldings. We extend its applicability to the properties of a temporal logic with a possibility operator.  ...  Thanks to Eike Best, Allan Cheng, Jens Palsberg, Kenneth McMil-Ian, Bernhard von Stengel and two anonymous referees for very helpful discussions and suggestions.  ... 
doi:10.1016/0167-6423(94)00019-0 fatcat:jj2c5mn2erekpnmbqdkzsx6avq

Automating the addition of fault tolerance with discrete controller synthesis

Alain Girault, Éric Rutten
2009 Formal methods in system design  
Besides, our method also offers an optimality criterion very useful to synthesize fault tolerant systems with embedded constraints like power consumption.  ...  Besides, we show that our method also offers an optimality criterion very useful to synthesize fault tolerant systems compliant to the constraints of embedded systems, like power consumption.  ...  particular the SIGALSIMU tool), to Emil Dumitrescu for his work on optimal discrete controller synthesis and his case study on the failures of communication links, to Huafeng Yu for his case study on  ... 
doi:10.1007/s10703-009-0084-y fatcat:rkblemxpgrcs7d3hlqt3zahzcu

Eighth Workshop and Tutorial on Practical Use of Coloured Petri Nets and the CPN Tools, Aarhus, Denmark, October 22-24, 2007

Kurt Jensen
2007 DAIMI Report Series  
This booklet contains the proceedings of the Eighth Workshop on Practical Use of Coloured Petri Nets and the CPN Tools, October 22-24, 2007.  ...  The workshop is organised by the CPN group at the Department of Computer Science, University of Aarhus, Denmark.  ...  Acknowledgment This paper is partially supported by CAPES/Brazil under grant 4635/06-0, CNPq WebMaps II Project, and FAPESP.  ... 
doi:10.7146/dpb.v36i584.7197 fatcat:fmzu5qetpnd6dpflqsuggbt7mm

Tenth Workshop and Tutorial on Practical Use of Coloured Petri Nets and the CPN Tools Aarhus, Denmark, October 19-21, 2009

Kurt Jensen
2009 DAIMI Report Series  
This booklet contains the proceedings of the Tenth Workshop on Practical Use of Coloured Petri Nets and the CPN Tools, October 19-21, 2009.  ...  The workshop is organised by the CPN group at the Department of Computer Science, University of Aarhus, Denmark.  ...  Acknowledgements The detailed comments from the reviewers are highly appreciated, not only for improving this paper, but also for providing interesting ideas for future work.  ... 
doi:10.7146/dpb.v38i590.7187 fatcat:t5yh5d4v7jbjjj7wghs2ba6ida

Analytic Hierarchy Process aided Key Management Schemes Evaluation in Wireless Sensor Network

Na Ruan, Yizhi Ren, Yoshiaki Hori, Kouichi Sakurai
2012 Journal of Networks  
An approach previously proposed by the same authors, named Model-Driven SPE (MDSPE), is used.  ...  An outline of system performance models and metrics is provided and a case study of a business system is used to validate the stated goal.  ...  ACKNOWLEDGEMENT The authors thank Ontario Centres of Excellence (OCE), Canada, and Alcatel-Lucent, Ottawa, for support.  ... 
doi:10.4304/jnw.7.1.88-100 fatcat:7atjgdr7hngvfjvvfibte6d3pm

Proceedings of the Third Workshop on Formal Integrated Development Environment

Kim G. Larsen
2017 Electronic Proceedings in Theoretical Computer Science  
Unfortunately, Zoltán did not live to see it completed. Future Work We are currently working on connecting the calculated summaries to a parameterised unit testing framework.  ...  We would like to put our preliminary results of our proposed approach together and evaluate (1) whether DSE is applicable to SPLs in order to e ciently derive the behavioural changes among di↵erent products  ...  Languages such as Petri Nets, Flow Graphs and Finite State Machines are widely used to express software behaviour [12] .  ... 
doi:10.4204/eptcs.240.0.1 fatcat:imfjolcxmrfm7kqiz523rbyj5i

Hybrid Dynamical Systems: An Introduction to Control and Verification

Lin Hai
2014 Foundations and Trends® in Systems and Control  
The financial supports of NSF-CNS-1239222 and NSF-CAREER-1253488 for this work are greatly acknowledged.  ...  They extend their computational models, such as finite state machine, automata and petri nets, from discrete systems to hybrid systems by embedding the continuous variable dynamics into these discrete  ...  The basic idea is to transform the optimal control for the switched system (3.20) into its embedded form (3.21), and then solve the optimal control problem for the embedded system (3.21) with respect to  ... 
doi:10.1561/2600000001 fatcat:kxr4yc3rjzet7kwzz7pcm6a2ri

Building the second generation of parallel/distributed virtual reality systems

Shaun Bangay, James Gain, Greg Watkins, Kevan Watkins
1997 Parallel Computing  
This thesis describes the development of a performance analysis technique that is able to provide measures of both interaction latency and cycle time for a model of a . Virtual Reality system.  ...  Performance measurement for a Virtual Reality system differs from that of other parallel systems in that some measure of the delays involved with the interaction of the separate c~mponents is required,  ...  Discussions with members of the virtual reality community across the world, both via e-mail, and through public forums have been an important source of information.  ... 
doi:10.1016/s0167-8191(97)00040-9 fatcat:txe7b7xatbcbpdxrolsn4rs6ky

Seventh Workshop and Tutorial on Practical Use of Coloured Petri Nets and the CPN Tools, Aarhus, Denmark, October 24-26, 2006

Kurt Jensen
2006 DAIMI Report Series  
This booklet contains the proceedings of the Seventh Workshop on Practical Use of Coloured Petri Nets and the CPN Tools, October 24-26, 2006.  ...  The workshop is organised by the CPN group at the Department of Computer Science, University of Aarhus, Denmark.  ...  We also thank Søren for fruitful discussions and feedback on this paper. Acknowledgements This research is supported by EIT and the IOP program of the Dutch Ministry of Economic Affairs.  ... 
doi:10.7146/dpb.v35i579.7322 fatcat:a7bsrdbwkfhvhmd2regosteude

Inductive logic programming at 30: a new introduction [article]

Andrew Cropper, Sebastijan Dumančić
2022 arXiv   pre-print
Inductive logic programming (ILP) is a form of machine learning. The goal of ILP is to induce a hypothesis (a set of logical rules) that generalises training examples.  ...  , ASPAL, and Metagol); highlight key application areas; and, finally, summarise current limitations and directions for future research.  ...  Acknowledgements We thank Céline Hocquette, Jonas Schouterden, Jonas Soenen, Tom Silver, Tony Ribeiro, and Oghenejokpeme Orhobor for helpful comments and suggestions.  ... 
arXiv:2008.07912v5 fatcat:omhppz2oxjgpbghvwul3iqsa2q
« Previous Showing results 1 — 15 out of 46 results