{"entities":{"Q7361335":{"pageid":31519544,"ns":120,"title":"Item:Q7361335","lastrevid":105364949,"modified":"2026-10-07T13:35:32Z","type":"item","id":"Q7361335","labels":{"en":{"language":"en","value":"Worklist Algorithms"}},"descriptions":{"en":{"language":"en","value":"AFP entry Worklist_Algorithms"}},"aliases":{},"claims":{"P205":[{"mainsnak":{"snaktype":"value","property":"P205","hash":"786cfb62adb93efd0c608fd687062be96e58de20","datavalue":{"value":"https://isa-afp.org/entries/Worklist_Algorithms.html","type":"string"},"datatype":"url"},"type":"statement","id":"Q7361335$FEDB793E-F8FB-4CEA-849A-FE024A33E5CE","rank":"normal"}],"P28":[{"mainsnak":{"snaktype":"value","property":"P28","hash":"1eacac456299b1b03c88dce20630ab6cf8311362","datavalue":{"value":{"time":"+2024-08-09T00:00:00Z","timezone":0,"before":0,"after":0,"precision":11,"calendarmodel":"http://www.wikidata.org/entity/Q1985727"},"type":"time"},"datatype":"time"},"type":"statement","id":"Q7361335$E0689888-FF7C-4358-85B0-FD0DDCD07942","rank":"normal"}],"P43":[{"mainsnak":{"snaktype":"value","property":"P43","hash":"8ad3851178fd4351b5225d703448b2fe1218d392","datavalue":{"value":"Simon Wimmer","type":"string"},"datatype":"string"},"type":"statement","id":"Q7361335$0ECAEAE8-C4CE-4572-86E5-29545879BE79","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P43","hash":"7545c5768cca6bd4b47e52bfec18c22cb81849df","datavalue":{"value":"Peter Lammich","type":"string"},"datatype":"string"},"type":"statement","id":"Q7361335$71B190C0-6129-40E7-93E2-3E76ACC93ACA","rank":"normal"}],"P159":[{"mainsnak":{"snaktype":"value","property":"P159","hash":"7428a3afa559ad68f9e2a71a19c7c29bc685f710","datavalue":{"value":{"text":"Worklist Algorithms","language":"en"},"type":"monolingualtext"},"datatype":"monolingualtext"},"type":"statement","id":"Q7361335$9C2704A8-DB5C-4C34-83CA-55275137815B","rank":"normal"}],"P1448":[{"mainsnak":{"snaktype":"value","property":"P1448","hash":"cb98420cdab1486a4a683a145032bff9dd106dd5","datavalue":{"value":"This entry verifies a number of worklist algorithms for exploring sets of reachable sets of transition systems with subsumption relations. Informally speaking, a node $a$ is subsumed by a node $b$ if everything that is reachable from $a$ is also reachable from $b$. Starting from a general abstract view of transition systems, we gradually add structure while refining our algorithms to more efficient versions. In the end, we obtain efficient imperative algorithms, which operate on a shared data structure to keep track of explored and yet-to-be-explored states, similar to the algorithms used in timed automata model checking [2, 1]. This entry forms part of the work described in a paper by the authors of this entry [4] and a PhD thesis [3].","type":"string"},"datatype":"string"},"type":"statement","id":"Q7361335$29E0B289-7342-4B82-8F94-16475D091340","rank":"normal"}],"P223":[{"mainsnak":{"snaktype":"value","property":"P223","hash":"c815cb968c16107cefb000f62a5dae27bc671faf","datavalue":{"value":{"entity-type":"item","numeric-id":5712294,"id":"Q5712294"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q7361335$8B3727EF-0D0D-499D-BBC4-A298F304FA1C","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P223","hash":"1b83ef6ef48951a2ffd166c2f336e62f16a62b9c","datavalue":{"value":{"entity-type":"item","numeric-id":5897955,"id":"Q5897955"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q7361335$7E38C6AA-2446-44F0-AE4B-B32EE797B647","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P223","hash":"7abc4c653f1a49315933e87e0214c05e6687fccf","datavalue":{"value":{"entity-type":"item","numeric-id":2324206,"id":"Q2324206"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q7361335$8DF9BC6E-9E2B-4FD2-93E8-B98F6F7432B3","rank":"normal"}],"P37":[{"mainsnak":{"snaktype":"value","property":"P37","hash":"9a21a8eebe97539644aa32b24dda137c12e751dc","datavalue":{"value":{"entity-type":"item","numeric-id":40327,"id":"Q40327"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q7361335$EED9F366-275F-40CD-8F1A-E2DF4D36284A","rank":"normal"}],"P585":[{"mainsnak":{"snaktype":"value","property":"P585","hash":"4214f1192898b3e581fff904a7cea3193f6718a3","datavalue":{"value":{"entity-type":"item","numeric-id":7361470,"id":"Q7361470"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q7361335$87FF4EC4-ADE5-49D7-904C-05958559AC14","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P585","hash":"6df1e1600a3acc40d1b0a9c9cf7cbc177462ddf9","datavalue":{"value":{"entity-type":"item","numeric-id":7361373,"id":"Q7361373"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q7361335$FC015943-FBA4-4E04-8C57-559D62C50A57","rank":"normal"}],"P2651":[{"mainsnak":{"snaktype":"value","property":"P2651","hash":"0cb214ba14504ce52502380598f813a3d010fff5","datavalue":{"value":{"entity-type":"item","numeric-id":7360777,"id":"Q7360777"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q7361335$89D25297-2C6C-4E84-B895-816EF11A2F7F","rank":"normal"}],"P1460":[{"mainsnak":{"snaktype":"value","property":"P1460","hash":"908c3454b3659c4b140ccce33c5aee31081edc8d","datavalue":{"value":{"entity-type":"item","numeric-id":5976450,"id":"Q5976450"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q7361335$83D87E60-68F3-4C39-ACE2-BB2835CDD7A6","rank":"normal"}]},"sitelinks":{"mardi":{"site":"mardi","title":"Worklist Algorithms","badges":[],"url":"https://portal.mardi4nfdi.de/wiki/Worklist_Algorithms"}}}}}