The Experts below are selected from a list of 2799 Experts worldwide ranked by ideXlab platform
Marit Simonsson - One of the best experts on this subject based on the ideXlab platform.
-
recension pia Bengtsson melin medeltiden on display uppstallningar och utstallningar av aldre kyrkokonst fran omkring 1850 fram till idag
2015Co-Authors: Marit SimonssonAbstract:[Recension] Pia Bengtsson Melin: Medeltiden on Display. Uppstallningar och utstallningar av aldre kyrkokonst fran omkring 1850 fram till idag
Bodil Petersson - One of the best experts on this subject based on the ideXlab platform.
-
review of pia Bengtsson melin medeltiden on display uppstallningar och utstallningar av aldre kyrkokonst fran omkring 1850 fram till idag runica et mediaevalia scripta maiora 8 stockholms universitet 2014 114 s
2015Co-Authors: Bodil PeterssonAbstract:[ Review of ] Pia Bengtsson Melin, Medeltiden on Display. Uppstallningar och utstallningar av aldre kyrkokonst fran omkring 1850 fram till idag : Runica et Mediaevalia, Scripta Maiora 8. Stockholms universitet 2014. 114 s.
Walukiewicz Igor - One of the best experts on this subject based on the ideXlab platform.
-
Revisiting Local Time Semantics for Networks of Timed Automata
2019Co-Authors: Govind R., Srivathsan B., Walukiewicz IgorAbstract:We investigate a zone based approach for the reachability problem in timed automata. The challenge is to alleviate the size explosion of the search space when considering networks of timed automata working in parallel. In the timed setting this explosion is particularly visible as even different interleavings of local actions of processes may lead to different zones. Salah et al. in 2006 have shown that the union of all these different zones is also a zone. This observation was used in an algorithm which from time to time detects and aggregates these zones into a single zone. We show that such aggregated zones can be calculated more efficiently using the local time semantics and the related notion of local zones proposed by Bengtsson et al. in 1998. Next, we point out a flaw in the existing method to ensure termination of the local zone graph computation. We fix this with a new algorithm that builds the local zone graph and uses abstraction techniques over (standard) zones for termination. We evaluate our algorithm on standard examples. On various examples, we observe an order of magnitude decrease in the search space. On the other examples, the algorithm performs like the standard zone algorithm
-
Revisiting local time semantics for networks of timed automata
2019Co-Authors: Govind R., Srivathsan B., Herbreteau Frédéric, Walukiewicz IgorAbstract:We investigate a zone based approach for the reachability problem in timed automata. The challenge is to alleviate the size explosion of the search space when considering networks of timed automata working in parallel. In the timed setting this explosion is particularly visible as even different interleavings of local actions of processes may lead to different zones. Salah et al. in 2006 have shown that the union of all these different zones is also a zone. This observation was used in an algorithm which from time to time detects and aggregates these zones into a single zone. We show that such aggregated zones can be calculated more efficiently using the local time semantics and the related notion of local zones proposed by Bengtsson et al. in 1998. Next, we point out a flaw in the existing method to ensure termination of the local zone graph computation. We fix this with a new algorithm that builds the local zone graph and uses abstraction techniques over (standard) zones for termination. We evaluate our algorithm on standard examples. On various examples, we observe an order of magnitude decrease in the search space. On the other examples, the algorithm performs like the standard zone algorithm.Comment: A shorter version appears in proceedings of CONCUR 201
-
Revisiting local time semantics for networks of timed automata
2019Co-Authors: Govind R., Srivathsan B., Herbreteau Frédéric, Walukiewicz IgorAbstract:International audienceWe investigate a zone based approach for the reachability problem in timed automata. The challenge is to alleviate the size explosion of the search space when considering networks of timed automata working in parallel. In the timed setting this explosion is particularly visible as even different interleavings of local actions of processes may lead to different zones. Salah et al. in 2006 have shown that the union of all these different zones is also a zone. This observation was used in an algorithm which from time to time detects and aggregates these zones into a single zone. We show that such aggregated zones can be calculated more efficiently using the local time semantics and the related notion of local zones proposed by Bengtsson et al. in 1998. Next, we point out a flaw in the existing method to ensure termination of the local zone graph computation. We fix this with a new algorithm that builds the local zone graph and uses abstraction techniques over (standard) zones for termination. We evaluate our algorithm on standard examples. On various examples, we observe an order of magnitude decrease in the search space. On the other examples, the algorithm performs like the standard zone algorithm
Govind R. - One of the best experts on this subject based on the ideXlab platform.
-
Revisiting Local Time Semantics for Networks of Timed Automata
2019Co-Authors: Govind R., Srivathsan B., Walukiewicz IgorAbstract:We investigate a zone based approach for the reachability problem in timed automata. The challenge is to alleviate the size explosion of the search space when considering networks of timed automata working in parallel. In the timed setting this explosion is particularly visible as even different interleavings of local actions of processes may lead to different zones. Salah et al. in 2006 have shown that the union of all these different zones is also a zone. This observation was used in an algorithm which from time to time detects and aggregates these zones into a single zone. We show that such aggregated zones can be calculated more efficiently using the local time semantics and the related notion of local zones proposed by Bengtsson et al. in 1998. Next, we point out a flaw in the existing method to ensure termination of the local zone graph computation. We fix this with a new algorithm that builds the local zone graph and uses abstraction techniques over (standard) zones for termination. We evaluate our algorithm on standard examples. On various examples, we observe an order of magnitude decrease in the search space. On the other examples, the algorithm performs like the standard zone algorithm
-
Revisiting local time semantics for networks of timed automata
2019Co-Authors: Govind R., Srivathsan B., Herbreteau Frédéric, Walukiewicz IgorAbstract:We investigate a zone based approach for the reachability problem in timed automata. The challenge is to alleviate the size explosion of the search space when considering networks of timed automata working in parallel. In the timed setting this explosion is particularly visible as even different interleavings of local actions of processes may lead to different zones. Salah et al. in 2006 have shown that the union of all these different zones is also a zone. This observation was used in an algorithm which from time to time detects and aggregates these zones into a single zone. We show that such aggregated zones can be calculated more efficiently using the local time semantics and the related notion of local zones proposed by Bengtsson et al. in 1998. Next, we point out a flaw in the existing method to ensure termination of the local zone graph computation. We fix this with a new algorithm that builds the local zone graph and uses abstraction techniques over (standard) zones for termination. We evaluate our algorithm on standard examples. On various examples, we observe an order of magnitude decrease in the search space. On the other examples, the algorithm performs like the standard zone algorithm.Comment: A shorter version appears in proceedings of CONCUR 201
-
Revisiting local time semantics for networks of timed automata
2019Co-Authors: Govind R., Srivathsan B., Herbreteau Frédéric, Walukiewicz IgorAbstract:International audienceWe investigate a zone based approach for the reachability problem in timed automata. The challenge is to alleviate the size explosion of the search space when considering networks of timed automata working in parallel. In the timed setting this explosion is particularly visible as even different interleavings of local actions of processes may lead to different zones. Salah et al. in 2006 have shown that the union of all these different zones is also a zone. This observation was used in an algorithm which from time to time detects and aggregates these zones into a single zone. We show that such aggregated zones can be calculated more efficiently using the local time semantics and the related notion of local zones proposed by Bengtsson et al. in 1998. Next, we point out a flaw in the existing method to ensure termination of the local zone graph computation. We fix this with a new algorithm that builds the local zone graph and uses abstraction techniques over (standard) zones for termination. We evaluate our algorithm on standard examples. On various examples, we observe an order of magnitude decrease in the search space. On the other examples, the algorithm performs like the standard zone algorithm
P C Sundgren - One of the best experts on this subject based on the ideXlab platform.
-
Supplemental material for White matter lesions and brain atrophy in systemic lupus erythematosus patients: correlation to cognitive dysfunction in a cohort of systemic lupus erythematosus patients using different definition models for neuropsychiatric systemic lupus erythematosus
2018Co-Authors: B Cannerfelt, J Nystedt, A Jönsen, J Lätt, D Van Westen, A Lilja, A Bengtsson, P Nilsson, J Mårtensson, P C SundgrenAbstract:Supplemental material for White matter lesions and brain atrophy in systemic lupus erythematosus patients: correlation to cognitive dysfunction in a cohort of systemic lupus erythematosus patients using different definition models for neuropsychiatric systemic lupus erythematosus by B Cannerfelt, J Nystedt, A Jönsen, J Lätt, D van Westen, A Lilja, A Bengtsson, P Nilsson, J Mårtensson and P C Sundgren in Lupus