{"entities":{"Q1578447":{"pageid":1589187,"ns":120,"title":"Item:Q1578447","lastrevid":72236616,"modified":"2026-04-14T03:32:14Z","type":"item","id":"Q1578447","labels":{"en":{"language":"en","value":"CONCUR 2000 -- Concurrency theory. 11th international conference, University Park, PA, USA, August 22--25, 2000. Proceedings"}},"descriptions":{"en":{"language":"en","value":"scientific article; zbMATH DE number 1498566"}},"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":"Q1578447$ACD996B3-2E83-474D-AE0D-40F2DBDFA508","rank":"normal"}],"P159":[{"mainsnak":{"snaktype":"value","property":"P159","hash":"707f82daab8fb9f569feb1e777f67910c7f7a60c","datavalue":{"value":{"text":"CONCUR 2000 -- Concurrency theory. 11th international conference, University Park, PA, USA, August 22--25, 2000. Proceedings","language":"en"},"type":"monolingualtext"},"datatype":"monolingualtext"},"type":"statement","id":"Q1578447$DF8B50BD-E6B0-4773-9FF4-7720E8CDBD27","rank":"normal"}],"P225":[{"mainsnak":{"snaktype":"value","property":"P225","hash":"018bb828a7b88c664439fe94df6a95319771ec4e","datavalue":{"value":"0944.00069","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q1578447$5FE7488D-07E1-4A9B-8682-E88FD2B1323F","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":"Q1578447$4AA5E847-7EB9-4280-80E2-ED4FD5BB8679","rank":"normal"}],"P28":[{"mainsnak":{"snaktype":"value","property":"P28","hash":"b0df8443dcb0e17ccba33c529b5b66ed23b66916","datavalue":{"value":{"time":"+2000-08-31T00:00:00Z","timezone":0,"before":0,"after":0,"precision":11,"calendarmodel":"http://www.wikidata.org/entity/Q1985727"},"type":"time"},"datatype":"time"},"type":"statement","id":"Q1578447$EC4D0CD7-D8F2-4A37-A781-4DF792385BC2","rank":"normal"}],"P1448":[{"mainsnak":{"snaktype":"value","property":"P1448","hash":"59a3db18b431c0641550c45a94ed1d48956ae6af","datavalue":{"value":"The articles of mathematical interest will be reviewed individually. For the preceding conference see [Zbl 0921.00028].  Indexed articles:  \\textit{Shankar, Natarajan}, Combining theorem proving and model checking through symbolic analysis, 1-16 [Zbl 0999.68523]  \\textit{Brinksma, Ed}, Verification is experimentation!, 17-24 [Zbl 0999.68552]  \\textit{Stark, Eugene W.}, Compositional performance analysis using probabilistic I/O automata, 25-28 [Zbl 0999.68554]  \\textit{Sangiovanni-Vincentelli, Alberto; Sgroi, Marco; Lavagno, Luciano}, Formal models for communication-based design, 29-47 [Zbl 0999.68527]  \\textit{De Nicola, Rocco; Ferrari, GianLuigi; Pugliese, Rosario}, Programming access control: The KLAIM experience, 48-65 [Zbl 0999.68557]  \\textit{Alur, Rajeev}, Exploiting hierarchical structure for efficient formal verification, 66-68 [Zbl 0999.68559]  \\textit{Gardner, Philippa}, From process calculi to process frameworks, 69-88 [Zbl 0999.68137]  \\textit{Ramakrishnan, C. R.}, Verification using tabled logic programming, 89-91 [Zbl 0999.68562]  \\textit{Kupferman, Orna; Madhusudan, P.; Thiagarajan, P. S.; Vardi, Moshe Y.}, Open systems in reactive environments: Control and synthesis, 92-107 [Zbl 0999.68124]  \\textit{Heljanko, Keijo}, Model checking with finite complete prefixes is PSPACE-complete, 108-122 [Zbl 0999.68138]  \\textit{Kwiatkowska, Marta; Norman, Gethin; Segala, Roberto; Sproston, Jeremy}, Verifying quantitative properties of continuous probabilistic timed automata, 123-137 [Zbl 0999.68125]  \\textit{Cassez, Franck; Larsen, Kim}, The impressive power of stopwatches, 138-152 [Zbl 0999.68112]  \\textit{Etessami, Kousha; Holzmann, Gerard J.}, Optimizing B\u00fcchi automata, 153-167 [Zbl 0999.68113]  \\textit{Bruns, Glenn; Godefroid, Patrice}, Generalized model checking: Reasoning about partial state spaces, 168-182 [Zbl 0999.68524]  \\textit{Ibarra, Oscar H.; Bultan, Tevfik; Su, Jianwen}, Reachability analysis for some models of infinite-state transition systems, 183-198 [Zbl 0999.68139]  \\textit{Negulescu, Radu}, Process spaces, 199-213 [Zbl 0999.68140]  \\textit{de Boer, Frank S.; van Eijk, Rogier M.; van der Hoek, Wiebe; Meyer, John-Jules Ch.}, Failure semantics for the exchange of information in multi-agent systems, 214-228 [Zbl 0999.68210]  \\textit{\u00c1brah\u00e1m-Mumm, Erika; de Boer, Frank S.}, Proof-outlines for threads in Java, 229-242 [Zbl 0999.68504]  \\textit{Leifer, James J.; Milner, Robin}, Deriving bisimulation congruences for reactive systems, 243-258 [Zbl 0999.68141]  \\textit{Bruni, Roberto; de Frutos-Escrig, David; Mart\u00ed-Oliet, Narciso; Montanari, Ugo}, Bisimilarity congruences for open terms and term graphs via tile logic, 259-274 [Zbl 0999.68142]  \\textit{Ulidowski, Irek; Yuen, Shoji}, Process languages for rooted eager bisimulation, 275-289 [Zbl 0999.68143]  \\textit{Rensink, Arend}, Action contraction, 290-304 [Zbl 0999.68528]  \\textit{Bernardo, Marco; Cleaveland, Rance}, A theory of testing for Markovian processes, 305-319 [Zbl 0999.68144]  \\textit{Abdulla, Parosh; Baier, Christel; Iyer, Purushothaman; Jonsson, Bengt}, Reasoning about probabilistic lossy channel systems, 320-333 [Zbl 0999.68145]  \\textit{Philippou, Anna; Lee, Insup; Sokolsky, Oleg}, Weak bisimulation for probabilistic systems, 334-349 [Zbl 0999.68146]  \\textit{Mislove, Michael}, Nondeterminism and probabilistic choice: Obeying the laws, 350-364 [Zbl 0999.68147]  \\textit{Cardelli, Luca; Ghelli, Giorgio; Gordon, Andrew D.}, Secrecy and group creation, 365-379 [Zbl 0999.68148]  \\textit{Amadio, Roberto M.; Lugiez, Denis}, On the reachability problem in cryptographic protocols, 380-394 [Zbl 0999.94538]  \\textit{J\u00fcrjens, Jan}, Secure information flow for concurrent processes, 395-409 [Zbl 0999.68149]  \\textit{Khomenko, Victor; Koutny, Maciej}, LP deadlock checking using partial order dependencies, 410-425 [Zbl 0999.68529]  \\textit{Kuske, Dietrich; Morin, R\u00e9mi}, Pomsets for local trace languages -- recognizability, logic \\(\\&\\) Petri nets, 426-441 [Zbl 0999.68530]  \\textit{Baldan, Paolo; Busi, Nadia; Corradini, Andrea; Pinna, G. Michele}, Functional concurrent semantics for Petri nets with read and inhibitor arcs, 442-457 [Zbl 0999.68150]  \\textit{de Alfaro, Luca; Henzinger, Thomas A.; Mang, Freddy Y. C.}, The control of synchronous systems, 458-473 [Zbl 0999.68531]  \\textit{Ravara, Ant\u00f3nio; Vasconcelos, Vasco T.}, Typing non-uniform concurrent objects, 474-488 [Zbl 0999.68151]  \\textit{Kobayashi, Naoki; Saito, Shin; Sumii, Eijiro}, An implicitly-typed deadlock-free process calculus, 489-503 [Zbl 0999.68532]  \\textit{Bugliesi, Michele; Castagna, Giuseppe; Crafa, Silvia}, Typed mobile objects, 504-520 [Zbl 0999.68505]  \\textit{Mukund, Madhavan; Narayan Kumar, K.; Sohoni, Milind}, Synthesizing distributed finite-state systems from MSCs, 521-535 [Zbl 0999.68114]  \\textit{Kuske, Dietrich}, Emptiness is decidable for asynchronous cellular machines, 536-551 [Zbl 0999.68132]  \\textit{Charron-Bost, Bernadette; Toueg, Sam; Basu, Anindya}, Revisiting safety and liveness in the context of failures, 552-565 [Zbl 0999.68152]  \\textit{Finkel, Alain; Iyer, Purushothaman; Sutre, Gregoire}, Well-abstracted transition systems (extended abstract), 566-580 [Zbl 0999.68533]  \\textit{Lazi\u0107, Ranko; Nowak, David}, A unifying approach to data-independence, 581-595 [Zbl 0999.68126]  \\textit{Fu, Yuxi; Yang, Zhenrong}, Chi calculus with mismatch, 596-610 [Zbl 0999.68153]","type":"string"},"datatype":"string"},"type":"statement","id":"Q1578447$066A9395-582D-4BE7-B1EE-887B3DD6BC1E","rank":"normal"}],"P226":[{"mainsnak":{"snaktype":"value","property":"P226","hash":"6f2c17db95e93f9a5a19ff6c68b3a1df8b0c021e","datavalue":{"value":"00B25","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q1578447$EEB51CCC-A2D2-4A95-B0EE-23A09499F698","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P226","hash":"ed293b811733fa9438a72e1b6ba5680a0d2aac9e","datavalue":{"value":"68-06","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q1578447$006B82E9-8847-4E4A-8863-6E79DDC970E2","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P226","hash":"b8f412c62952107f7ff74e77578c2ab25d3e121a","datavalue":{"value":"68Q85","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q1578447$13D05E81-01E7-4C03-AECA-81E54241FCF9","rank":"normal"}],"P1451":[{"mainsnak":{"snaktype":"value","property":"P1451","hash":"5e91a9230465ce03c684a9010b31566e456dd25a","datavalue":{"value":"1498566","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q1578447$1B54F9F3-2CEC-4162-AFC4-BCE57C74734D","rank":"normal"}],"P1450":[{"mainsnak":{"snaktype":"value","property":"P1450","hash":"003cb51f32a5500dcdddbbe134a04455f7974679","datavalue":{"value":"University Park, PA (USA)","type":"string"},"datatype":"string"},"type":"statement","id":"Q1578447$FB80E287-2CD4-444D-A3C3-922B6D9041C5","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P1450","hash":"5c4c4bb5a86a0fdf66f908b603f2f6975f5ef6fc","datavalue":{"value":"Proceedings","type":"string"},"datatype":"string"},"type":"statement","id":"Q1578447$402C9CE3-36C0-4BA6-AF7D-FBA30B07EE1E","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P1450","hash":"5d83ae477e518ffecea78688f13a2aaaeca13299","datavalue":{"value":"Conference","type":"string"},"datatype":"string"},"type":"statement","id":"Q1578447$64F16E68-CC35-4F80-8272-F62059547CAB","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P1450","hash":"8f47b310394b9909741fea7baad76de0d4be5c72","datavalue":{"value":"CONCUR 2000","type":"string"},"datatype":"string"},"type":"statement","id":"Q1578447$5A2EDB85-9216-436B-AF51-B44BDB32A8C3","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P1450","hash":"48651fc222a35e2206fc999ef422cb5d03872abb","datavalue":{"value":"Concurrency theory","type":"string"},"datatype":"string"},"type":"statement","id":"Q1578447$01761579-1108-448F-9C74-3C056756CFA8","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":"Q1578447$8702A4AE-FC33-4434-B6E2-6D1EEA9D0CE3","rank":"normal"}]},"sitelinks":{"mardi":{"site":"mardi","title":"CONCUR 2000 -- Concurrency theory. 11th international conference, University Park, PA, USA, August 22--25, 2000. Proceedings","badges":[],"url":"https://portal.mardi4nfdi.de/wiki/CONCUR_2000_--_Concurrency_theory._11th_international_conference,_University_Park,_PA,_USA,_August_22--25,_2000._Proceedings"}}}}}