257 research outputs found
Active Model Learning for the Analysis of Network Protocols
No full textContains fulltext :
187331.pdf (Publisher’s version ) (Open Access)Radboud University, 13 april 2018Promotor : Vaandrager, F.W.xii, 172 p
Expressivity of Timed Automata Models
No full textContains fulltext :
29872.pdf (Publisher’s version ) (Open Access)RU, 11 december 2006Promotor : Vaandrager, Frits167 p
Abstraction, prices and probability in model checking timed automata
No full textContains fulltext :
84322.pdf (Publisher’s version ) (Open Access)Radboud Universiteit Nijmegen, 03 november 2010Promotor : Vaandrager, F.W.178 p
Studies on verification of wireless sensor networks and abstraction learning for system inference
No full textContains fulltext :
93701.pdf (Publisher’s version ) (Open Access)Radboud Universiteit Nijmegen, 05 juli 2012Promotor : Vaandrager, F.W.140 p
Learning Models for Cyber-Physical Systems
No full textContains fulltext :
213663.pdf (Publisher’s version ) (Open Access)Radboud University, 18 december 2019Promotor : Vaandrager, F.ix, 155 p
Formal verification of on-chip communication fabrics
No full textContains fulltext :
103932.pdf (Publisher’s version ) (Open Access)Radboud Universiteit Nijmegen, 26 maart 2013Promotores : Vaandrager, F.W., Eekelen, M.C.J.D. van Co-promotor : Schmaltz, J.187 p
Nominal Techniques and Black Box Testing for Automata Learning
No full textContains fulltext :
204194.pdf (Publisher’s version ) (Open Access)Radboud University, 01 juli 2019Promotores : Vaandrager, F., Silva, A. Co-promotor : Terwijn, S.A.xii, 170 p
Performance analysis of real-time task systems using timed automata
No full textContains fulltext :
102351.pdf (Publisher’s version ) (Open Access)Radboud Universiteit Nijmegen, 22 januari 2013Promotor : Vaandrager, F.W.128 p
Geometric Multicut
No full textWe study the following separation problem: Given a collection of colored objects in the plane, compute a shortest “fence” F, i.e., a union of curves of minimum total length, that separates every two objects of different colors. Two objects are separated if F contains a simple closed curve that has one object in the interior and the other in the exterior. We refer to the problem as GEOMETRIC k-CUT, where k is the number of different colors, as it can be seen as a geometric analogue to the well-studied multicut problem on graphs. We first give an O(n4log3n)-time algorithm that computes an optimal fence for the case where the input consists of polygons of two colors and n corners in total. We then show that the problem is NP-hard for the case of three colors. Finally, we give a (2−4/3k)-approximation algorithm
Model Checking Timed Automata - Techniques and Applications
No full textContains fulltext :
27414.pdf (Publisher’s version ) (Open Access)Model checking is a technique to automatically analyse systems that have been modeled in a formal language. The timed automaton framework is such a formal language. It is suitable to model many realistic problems in which time plays a central role. Examples are distributed algorithms, protocols, embedded software and scheduling problems. The main problem with model checking is the exponential growth of the state space as models become larger (also known as the 'state space explosion' problem). This thesis consists of six research papers. Three of these contribute theory to alleviate the state space explosion problem. The other three demonstrate the practical use of model checking technology by applying it to realistic case studies.RU, 04 april 2006Promotor : Vaandrager, FritsVIII, 162 p
- …
