{"entities":{"Q7361191":{"pageid":31519112,"ns":120,"title":"Item:Q7361191","lastrevid":105363833,"modified":"2026-10-07T13:35:04Z","type":"item","id":"Q7361191","labels":{"en":{"language":"en","value":"A Compositional and Unified Translation of LTL into \u03c9-Automata"}},"descriptions":{"en":{"language":"en","value":"AFP entry LTL_Master_Theorem"}},"aliases":{},"claims":{"P205":[{"mainsnak":{"snaktype":"value","property":"P205","hash":"ee54fb9a2da2760acbea259a0da281aadc0f144a","datavalue":{"value":"https://isa-afp.org/entries/LTL_Master_Theorem.html","type":"string"},"datatype":"url"},"type":"statement","id":"Q7361191$3F4C472B-5003-4E0F-9A7D-74BA608CCE2F","rank":"normal"}],"P28":[{"mainsnak":{"snaktype":"value","property":"P28","hash":"116cb1c822f5fb879f8b4e522850b04a662cb8c4","datavalue":{"value":{"time":"+2019-04-16T00:00:00Z","timezone":0,"before":0,"after":0,"precision":11,"calendarmodel":"http://www.wikidata.org/entity/Q1985727"},"type":"time"},"datatype":"time"},"type":"statement","id":"Q7361191$7D09783A-C3C7-464B-B57D-4C8EC50BEBD5","rank":"normal"}],"P43":[{"mainsnak":{"snaktype":"value","property":"P43","hash":"35d09caaadf85c8cddb24e4ac2098ba8a6337a32","datavalue":{"value":"Benedikt Seidl","type":"string"},"datatype":"string"},"type":"statement","id":"Q7361191$E7FE17FF-AFD5-4E34-A905-DCD118D1818E","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P43","hash":"34ca23e13f3744b21ae1779c590b97468a47c009","datavalue":{"value":"Salomon Sickert","type":"string"},"datatype":"string"},"type":"statement","id":"Q7361191$0033B582-4056-4385-AED1-1929F28237CF","rank":"normal"}],"P159":[{"mainsnak":{"snaktype":"value","property":"P159","hash":"aef0ff0baa0fc29d882b418d554ddade0be60cdf","datavalue":{"value":{"text":"A Compositional and Unified Translation of LTL into \u03c9-Automata","language":"en"},"type":"monolingualtext"},"datatype":"monolingualtext"},"type":"statement","id":"Q7361191$57F18900-F228-4437-A4AD-F8302CF792D2","rank":"normal"}],"P1448":[{"mainsnak":{"snaktype":"value","property":"P1448","hash":"c081666657411a2369f8ded51c3945f58fe36c32","datavalue":{"value":"We present a formalisation of the unified translation approach of linear temporal logic (LTL) into \u03c9-automata from [1]. This approach decomposes LTL formulas into \u201csimple\u201d languages and allows a clear separation of concerns: first, we formalise the purely logical result yielding this decomposition; second, we instantiate this generic theory to obtain a construction for deterministic (state-based) Rabin automata (DRA). We extract from this particular instantiation an executable tool translating LTL to DRAs. To the best of our knowledge this is the first verified translation from LTL to DRAs that is proven to be double exponential in the worst case which asymptotically matches the known lower bound. [1] Javier Esparza, Jan Kret\u00ednsk\u00fd, Salomon Sickert. One Theorem to Rule Them All: A Unified Translation of LTL into \u03c9-Automata. LICS 2018","type":"string"},"datatype":"string"},"type":"statement","id":"Q7361191$A43E4EEE-D665-49B9-B85D-FF0EFCAA1535","rank":"normal"}],"P223":[{"mainsnak":{"snaktype":"value","property":"P223","hash":"5f8702c5514204440418071a1aec8e189f12d31e","datavalue":{"value":{"entity-type":"item","numeric-id":4584018,"id":"Q4584018"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q7361191$12654B62-04A1-4042-9EF2-F2E25BAC737C","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P223","hash":"618c35694b758a9839ac566e69a497bebcf10591","datavalue":{"value":{"entity-type":"item","numeric-id":5145312,"id":"Q5145312"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q7361191$DE70CE65-4905-4AAA-962F-AD1B1D0F276E","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":"Q7361191$E31E34E7-CDB0-43B8-9F12-FE9CCBA43B48","rank":"normal"}],"P585":[{"mainsnak":{"snaktype":"value","property":"P585","hash":"edaae9fe0e5779978f85e3c7bb7897012bfd4b62","datavalue":{"value":{"entity-type":"item","numeric-id":7361610,"id":"Q7361610"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q7361191$1860B9B7-9052-4D91-923E-33FC27CC36E4","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P585","hash":"8ac34df43fbb99027916440c753dc68e36985fe2","datavalue":{"value":{"entity-type":"item","numeric-id":7361475,"id":"Q7361475"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q7361191$48C7B2B2-3E6C-4882-9E9E-DDBAD0B177D5","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P585","hash":"4571af89e2882a45bee5f9e442723910fbf0c144","datavalue":{"value":{"entity-type":"item","numeric-id":7361382,"id":"Q7361382"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q7361191$A96B0722-6AFF-4AA5-BA1B-9E9F349D1E66","rank":"normal"}],"P2651":[{"mainsnak":{"snaktype":"value","property":"P2651","hash":"73d93a21b0749f7f2c51d7daeb11b162660cd756","datavalue":{"value":{"entity-type":"item","numeric-id":7360784,"id":"Q7360784"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q7361191$D4A8A175-3AC4-49C3-9525-B35CD60ACDE9","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":"Q7361191$BE2D794D-FEF4-49C3-B079-67F700AE7A92","rank":"normal"}]},"sitelinks":{"mardi":{"site":"mardi","title":"A Compositional and Unified Translation of LTL into \u03c9-Automata","badges":[],"url":"https://portal.mardi4nfdi.de/wiki/A_Compositional_and_Unified_Translation_of_LTL_into_%CF%89-Automata"}}}}}