{"entities":{"Q1769770":{"pageid":1780512,"ns":120,"title":"Item:Q1769770","lastrevid":43316674,"modified":"2025-07-24T16:05:51Z","type":"item","id":"Q1769770","labels":{"en":{"language":"en","value":"CONCUR 2004 -- concurrency theory. 15th international conference, London, UK, August 31 -- September 3, 2004. Proceedings."}},"descriptions":{"en":{"language":"en","value":"scientific article; zbMATH DE number 2148969"}},"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":"Q1769770$A4571FB1-E37F-4326-B352-AE4619E0216D","rank":"normal"}],"P159":[{"mainsnak":{"snaktype":"value","property":"P159","hash":"feb7fe0b8d4febfd7a55804b424cd1f30ea58be3","datavalue":{"value":{"text":"CONCUR 2004 -- concurrency theory. 15th international conference, London, UK, August 31 -- September 3, 2004. Proceedings.","language":"en"},"type":"monolingualtext"},"datatype":"monolingualtext"},"type":"statement","id":"Q1769770$38210E30-775B-477D-BB2D-3B6676981809","rank":"normal"}],"P225":[{"mainsnak":{"snaktype":"value","property":"P225","hash":"e7185c523e083138506d8fa380ee5a5c118f4880","datavalue":{"value":"1058.68006","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q1769770$4ADD1BF0-3082-4BC8-9423-BAED9266A54F","rank":"normal"}],"P200":[{"mainsnak":{"snaktype":"value","property":"P200","hash":"85c07c7737819bff773f78e2590a3bb761fe677b","datavalue":{"value":{"entity-type":"item","numeric-id":162374,"id":"Q162374"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q1769770$E1D3BBED-F092-4CC6-932A-1B57DD94252D","rank":"normal"}],"P28":[{"mainsnak":{"snaktype":"value","property":"P28","hash":"ef9bbd95a6dd7ae5b43fa2d065daa6fcf276ac4c","datavalue":{"value":{"time":"+2005-03-23T00:00:00Z","timezone":0,"before":0,"after":0,"precision":11,"calendarmodel":"http://www.wikidata.org/entity/Q1985727"},"type":"time"},"datatype":"time"},"type":"statement","id":"Q1769770$3F6ED3D1-5A97-48A9-ADC0-383F0D895EFA","rank":"normal"}],"P1448":[{"mainsnak":{"snaktype":"value","property":"P1448","hash":"196e1c524aefe41e512861f371fc1f821568946f","datavalue":{"value":"The articles of this volume will be reviewed individually. For the preceding conference see [Zbl 1026.00029].  Indexed articles:  \\textit{Andrews, Tony; Qadeer, Shaz; Rajamani, Sriram K.; Rehof, Jakob; Xie, Yichen}, Zing: Exploiting program structure for model checking concurrent software, 1-15 [Zbl 1099.68583]  \\textit{Brookes, Stephen}, A semantics for concurrent separation logic, 16-34 [Zbl 1099.68650]  \\textit{Abdulla, Parosh Aziz; Jonsson, Bengt; Nilsson, Marcus; Saksena, Mayank}, A survey of regular model checking, 35-48 [Zbl 1099.68055]  \\textit{O'Hearn, Peter W.}, Resources, concurrency and local reasoning, 49-67 [Zbl 1099.68588]  \\textit{Amadio, Roberto M.; Dal Zilio, Silvano}, Resource control for synchronous cooperative threads, 68-82 [Zbl 1097.68535]  \\textit{Baldan, Paolo; Corradini, Andrea; K\u00f6nig, Barbara}, Verifying finite-state graph grammars: An unfolding-based approach, 83-98 [Zbl 1099.68046]  \\textit{Baudru, Nicolas; Morin, R\u00e9mi}, The pros and cons of netcharts, 99-114 [Zbl 1099.68063]  \\textit{Berger, Martin}, Basic theory of reduction congruence for two timed asynchronous \\(\\pi\\)-calculi, 115-130 [Zbl 1099.68064]  \\textit{Boja\u0144czyk, Miko\u0142aj; Walukiewicz, Igor}, Characterizing EF and EX tree logics, 131-145 [Zbl 1097.03504]  \\textit{Bollig, Benedikt; Leucker, Martin}, Message-passing automata are expressively equivalent to EMSO logic, 146-160 [Zbl 1097.68581]  \\textit{Borgstr\u00f6m, Johannes; Briais, S\u00e9bastien; Nestmann, Uwe}, Symbolic bisimulation in the spi calculus, 161-176 [Zbl 1099.68665]  \\textit{Bozga, Liana; Ene, Cristian; Lakhnech, Yassine}, A symbolic decision procedure for cryptographic protocols with time stamps (extended abstract), 177-192 [Zbl 1099.94521]  \\textit{Br\u00e1zdil, Tom\u00e1\u0161; Ku\u010dera, Anton\u00edn; Stra\u017eovsk\u00fd, Old\u0159ich}, Deciding probabilistic bisimilarity over infinite-state probabilistic systems, 193-208 [Zbl 1099.68065]  \\textit{Bruns, Glenn; Jagadeesan, Radha; Jeffrey, Alan; Riely, James}, \\(\\mu\\)ABC: A minimal aspect calculus, 209-224 [Zbl 1099.68586]  \\textit{Bugliesi, Michele; Colazzo, Dario; Crafa, Silvia}, Type based discretionary access control, 225-239 [Zbl 1099.68666]  \\textit{Caires, Lu\u00eds; Lozes, \u00c9tienne}, Elimination of quantifiers and undecidability in spatial logics for concurrency, 240-257 [Zbl 1097.68582]  \\textit{C\u00eerstea, Corina; Pattinson, Dirk}, Modular construction of modal logics, 258-275 [Zbl 1099.03018]  \\textit{Clarke, Edmund; Talupur, Muralidhar; Touili, Tayssir; Veith, Helmut}, Verification by network decomposition, 276-291 [Zbl 1099.68653]  \\textit{Danos, Vincent; Krivine, Jean}, Reversible communicating systems, 292-307 [Zbl 1099.68066]  \\textit{Groote, Jan Friso; Willemse, Tim}, Parameterised Boolean equation systems (extended abstract), 308-324 [Zbl 1099.68670]  \\textit{Hirschkoff, Daniel}, An extensional spatial logic for mobile processes, 325-339 [Zbl 1099.68067]  \\textit{Kr\u010d\u00e1l, Pavel; Mokrushin, Leonid; Thiagarajan, P. S.; Yi, Wang}, Timed vs. time-triggered automata, 340-354 [Zbl 1099.68069]  \\textit{K\u0159et\u00ednsk\u00fd, Mojm\u00edr; \u0158eh\u00e1k, Vojt\u011bch; Strej\u010dek, Jan}, Extended process rewrite systems: Expressiveness and reachability, 355-370 [Zbl 1099.68068]  \\textit{Ku\u010dera, Anton\u00edn; Schnoebelen, Philippe}, A general approach to comparing infinite-state systems with their finite-state specifications, 371-386 [Zbl 1097.68577]  \\textit{Laroussinie, F.; Markey, N.; Schnoebelen, Ph.}, Model checking timed automata with one or two clocks, 387-401 [Zbl 1099.68057]  \\textit{Leroux, J\u00e9r\u00f4me; Sutre, Gr\u00e9goire}, On flatness for 2-dimensional vector addition systems with states, 402-416 [Zbl 1099.68071]  \\textit{Ma, Qin; Maranget, Luc}, Compiling pattern matching in join-patterns, 417-431 [Zbl 1099.68671]  \\textit{Markey, Nicolas; Raskin, Jean-Fran\u00e7ois}, Model checking restricted sets of timed paths, 432-447 [Zbl 1097.68578]  \\textit{Melli\u00e8s, Paul-Andr\u00e9}, Asynchronous games. II: The true concurrency of innocence, 448-465 [Zbl 1099.68672]  \\textit{Tabuada, Paulo}, Open maps, alternating simulations and control synthesis, 466-480 [Zbl 1099.68073]  \\textit{Varacca, Daniele; V\u00f6lzer, Hagen; Winskel, Glynn}, Probabilistic event structures and domains, 481-496 [Zbl 1099.68676]  \\textit{Vasconcelos, Vasco; Ravara, Ant\u00f3nio; Gay, Simon}, Session types for functional multithreading, 497-511 [Zbl 1099.68677]  \\textit{Viswanathan, Mahesh; Viswanathan, Ramesh}, A higher order modal fixed point logic, 512-528 [Zbl 1099.03022]","type":"string"},"datatype":"string"},"type":"statement","id":"Q1769770$CEDA545F-E173-4AEB-8D6A-F4C43EB85D30","rank":"normal"}],"P226":[{"mainsnak":{"snaktype":"value","property":"P226","hash":"ed293b811733fa9438a72e1b6ba5680a0d2aac9e","datavalue":{"value":"68-06","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q1769770$226A78AB-08A2-4061-8AB7-5930B04A5409","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P226","hash":"b8f412c62952107f7ff74e77578c2ab25d3e121a","datavalue":{"value":"68Q85","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q1769770$5E8BDB0B-464C-4B33-972A-8CD84360AE59","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P226","hash":"6f2c17db95e93f9a5a19ff6c68b3a1df8b0c021e","datavalue":{"value":"00B25","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q1769770$F8B1A1F4-0A34-4FE3-B816-312A7724B29D","rank":"normal"}],"P1451":[{"mainsnak":{"snaktype":"value","property":"P1451","hash":"b744a3498f93c1fd216074c3cb4f06c46be396f3","datavalue":{"value":"2148969","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q1769770$F04BAB24-B8E6-4EBF-8378-0F069A65965E","rank":"normal"}],"P1463":[{"mainsnak":{"snaktype":"value","property":"P1463","hash":"d4f55591526bfa06dbd19dfd10ca3b2c9d44db2a","datavalue":{"value":{"entity-type":"item","numeric-id":20924,"id":"Q20924"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q1769770$F8C5530B-6585-47D4-9AAF-85FD3CA2C0AC","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P1463","hash":"a20498efd7672a526d616e86f695804b7273a736","datavalue":{"value":{"entity-type":"item","numeric-id":21867,"id":"Q21867"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q1769770$1BA8B6D6-60B2-43A1-A2E3-73DC59E80C79","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":"Q1769770$CDE4958C-1842-452D-8830-5181EC9B26A2","rank":"normal"}]},"sitelinks":{"mardi":{"site":"mardi","title":"Publication:1769770","badges":[],"url":"https://portal.mardi4nfdi.de/wiki/Publication:1769770"}}}}}