{"entities":{"Q7361898":{"pageid":31521233,"ns":120,"title":"Item:Q7361898","lastrevid":105370127,"modified":"2026-10-07T13:38:47Z","type":"item","id":"Q7361898","labels":{"en":{"language":"en","value":"Modal Logics for Nominal Transition Systems"}},"descriptions":{"en":{"language":"en","value":"AFP entry Modal_Logics_for_NTS"}},"aliases":{},"claims":{"P205":[{"mainsnak":{"snaktype":"value","property":"P205","hash":"e185d695f90a9c0c1a905b42f62d909311677cc7","datavalue":{"value":"https://isa-afp.org/entries/Modal_Logics_for_NTS.html","type":"string"},"datatype":"url"},"type":"statement","id":"Q7361898$7FE797F4-46DC-4684-B7A0-DD1484759495","rank":"normal"}],"P28":[{"mainsnak":{"snaktype":"value","property":"P28","hash":"be451ad60375c8b13600c3f9cbb94e9f414602a4","datavalue":{"value":{"time":"+2016-10-25T00:00:00Z","timezone":0,"before":0,"after":0,"precision":11,"calendarmodel":"http://www.wikidata.org/entity/Q1985727"},"type":"time"},"datatype":"time"},"type":"statement","id":"Q7361898$1BC1021D-2F60-4BCF-8961-27A9F6E302D2","rank":"normal"}],"P43":[{"mainsnak":{"snaktype":"value","property":"P43","hash":"2f854883aaf7cde2ebd962b9b518c74b730cb624","datavalue":{"value":"Tjark Weber","type":"string"},"datatype":"string"},"type":"statement","id":"Q7361898$5AE5C2E1-7AA1-458D-8152-375963EF72D6","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P43","hash":"53f00f9da07bc31f317eb68d752ee89792377a3e","datavalue":{"value":"Lars-Henrik Eriksson","type":"string"},"datatype":"string"},"type":"statement","id":"Q7361898$0815F3A0-A0C5-4888-AE59-8C6857D8406C","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P43","hash":"995594925e9152e2f01c005d4e2c1c2c7c1a1d13","datavalue":{"value":"Joachim Parrow","type":"string"},"datatype":"string"},"type":"statement","id":"Q7361898$52ABA5BA-AA4C-4116-8C42-4611B4A713B7","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P43","hash":"405848cd747cf628e51b8e9cc2c568a01a3f66d4","datavalue":{"value":"Johannes Borgstr\u00f6m","type":"string"},"datatype":"string"},"type":"statement","id":"Q7361898$590D29E0-EC53-441E-AF5E-B389E5E8B7D0","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P43","hash":"bc3533275534217dd5ab886290884742ef98069f","datavalue":{"value":"Ramunas Gutkovas","type":"string"},"datatype":"string"},"type":"statement","id":"Q7361898$448078A4-11C6-4B27-BB4B-903B9A9AA8FC","rank":"normal"}],"P159":[{"mainsnak":{"snaktype":"value","property":"P159","hash":"7ba65e0bf661c06ce7f0fe985547535b35f7a75f","datavalue":{"value":{"text":"Modal Logics for Nominal Transition Systems","language":"en"},"type":"monolingualtext"},"datatype":"monolingualtext"},"type":"statement","id":"Q7361898$05F7463E-B069-468A-8921-7C9CD6837A2B","rank":"normal"}],"P1448":[{"mainsnak":{"snaktype":"value","property":"P1448","hash":"02bf2369d4f82e6cdf16c975cea91694a54f6855","datavalue":{"value":"We formalize a uniform semantic substrate for a wide variety of process calculi where states and action labels can be from arbitrary nominal sets. A Hennessy-Milner logic for these systems is defined, and proved adequate for bisimulation equivalence. A main novelty is the construction of an infinitary nominal data type to model formulas with (finitely supported) infinite conjunctions and actions that may contain binding names. The logic is generalized to treat different bisimulation variants such as early, late and open in a systematic way.","type":"string"},"datatype":"string"},"type":"statement","id":"Q7361898$933FC01A-5D0C-4C2C-B623-60F5A02B5EF2","rank":"normal"}],"P223":[{"mainsnak":{"snaktype":"value","property":"P223","hash":"04ffef44f4d63520001869844161b5a9ab99f758","datavalue":{"value":{"entity-type":"item","numeric-id":5357704,"id":"Q5357704"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q7361898$CE75B791-E339-4EA8-8BD0-7D5F894199E7","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":"Q7361898$2D38C116-13A8-4DD9-A41D-333A842A5399","rank":"normal"}],"P585":[{"mainsnak":{"snaktype":"value","property":"P585","hash":"947633d77ac0c595dad38098201be725b355abe0","datavalue":{"value":{"entity-type":"item","numeric-id":7361006,"id":"Q7361006"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q7361898$8BB6BDD9-F392-45C5-9330-4A546B8DE012","rank":"normal"}],"P2651":[{"mainsnak":{"snaktype":"value","property":"P2651","hash":"147d947971425f6e481a02787827e4705017a40a","datavalue":{"value":{"entity-type":"item","numeric-id":7360786,"id":"Q7360786"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q7361898$86F704E1-C0D7-4411-A982-BD6917D63583","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":"Q7361898$A32862B6-6E5D-4BF2-AE7E-5BE36EE4A89D","rank":"normal"}]},"sitelinks":{"mardi":{"site":"mardi","title":"Modal Logics for Nominal Transition Systems","badges":[],"url":"https://portal.mardi4nfdi.de/wiki/Modal_Logics_for_Nominal_Transition_Systems"}}}}}