{"entities":{"Q6909510":{"pageid":20958925,"ns":120,"title":"Item:Q6909510","lastrevid":75610270,"modified":"2026-04-20T08:57:09Z","type":"item","id":"Q6909510","labels":{"en":{"language":"en","value":"A primitive recursive algorithm for the general Petri net reachability problem"}},"descriptions":{"en":{"language":"en","value":"scientific article; zbMATH DE number 8112165"}},"aliases":{},"claims":{"P31":[{"mainsnak":{"snaktype":"value","property":"P31","hash":"fd5912e4dab4b881a8eb0eb27e7893fef55176ad","datavalue":{"value":{"entity-type":"item","numeric-id":56887,"id":"Q56887"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q6909510$039AEECC-ACBE-4C43-AD3A-F6F1C5DEAD6E","rank":"normal"}],"P159":[{"mainsnak":{"snaktype":"value","property":"P159","hash":"de1ba6a13768a544432f2c6d8e5bcd1847e0c526","datavalue":{"value":{"text":"A primitive recursive algorithm for the general Petri net reachability problem","language":"en"},"type":"monolingualtext"},"datatype":"monolingualtext"},"type":"statement","id":"Q6909510$F3A97423-EA54-47DF-989C-3A98F680FBD6","rank":"normal"}],"P27":[{"mainsnak":{"snaktype":"value","property":"P27","hash":"26dbb890badca4341fe71b4329d72bd1a49cb955","datavalue":{"value":"10.1109/SFCS.1998.743436","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q6909510$8DBECC98-E704-457F-9894-8E055DC9F769","rank":"normal"}],"P16":[{"mainsnak":{"snaktype":"value","property":"P16","hash":"384f9a27ca5b870b447893c16d79c0f8f2686880","datavalue":{"value":{"entity-type":"item","numeric-id":4223063,"id":"Q4223063"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q6909510$B89DA71C-CFE1-4D7C-B790-E86C9B932F92","rank":"normal"}],"P28":[{"mainsnak":{"snaktype":"value","property":"P28","hash":"b77d6a4382bc7a32fc14d82772e7dcb343e03ac6","datavalue":{"value":{"time":"+2025-10-29T00:00:00Z","timezone":0,"before":0,"after":0,"precision":11,"calendarmodel":"http://www.wikidata.org/entity/Q1985727"},"type":"time"},"datatype":"time"},"type":"statement","id":"Q6909510$B697ED15-5EBA-4B85-85AA-5C719C1AE6C3","rank":"normal"}],"P226":[{"mainsnak":{"snaktype":"value","property":"P226","hash":"ed293b811733fa9438a72e1b6ba5680a0d2aac9e","datavalue":{"value":"68-06","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q6909510$EFA244E5-1A57-4597-AF02-4FFA41759F8B","rank":"normal"}],"P1451":[{"mainsnak":{"snaktype":"value","property":"P1451","hash":"d145094d7c8f9f08452e9ceb18e89369c9813d95","datavalue":{"value":"8112165","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q6909510$E993D2A2-CFC4-42F1-924E-DBC63DEBADA7","rank":"normal"}],"P1460":[{"mainsnak":{"snaktype":"value","property":"P1460","hash":"57f7fea50d2ce1b39b695c4a1313582eed405e38","datavalue":{"value":{"entity-type":"item","numeric-id":5976449,"id":"Q5976449"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q6909510$A56E44B4-A30F-4236-B7E4-C45A5E2A0F2F","rank":"normal"}]},"sitelinks":{"mardi":{"site":"mardi","title":"A primitive recursive algorithm for the general Petri net reachability problem","badges":[],"url":"https://portal.mardi4nfdi.de/wiki/A_primitive_recursive_algorithm_for_the_general_Petri_net_reachability_problem"}}}}}