Conferences in DBLP
Wan Fokkink , Natalia Ioustinova , Ernst Kesseler , Jaco van de Pol , Yaroslav S. Usenko , Yuri A. Yushtein Refinement and Verification Applied to an In-Flight Data Acquisition Unit. [Citation Graph (0, 0)][DBLP ] CONCUR, 2002, pp:1-23 [Conf ] Amir Pnueli , Yonit Kesten A Deductive Proof System for CTL. [Citation Graph (0, 0)][DBLP ] CONCUR, 2002, pp:24-40 [Conf ] Vaughan R. Pratt Event-State Duality: The Enriched Case. [Citation Graph (0, 0)][DBLP ] CONCUR, 2002, pp:41-56 [Conf ] Alexander Moshe Rabinovich Expressive Power of Temporal Logics. [Citation Graph (0, 0)][DBLP ] CONCUR, 2002, pp:57-75 [Conf ] Davide Sangiorgi Types, or: Where's the Difference Between CCS and pi? [Citation Graph (0, 0)][DBLP ] CONCUR, 2002, pp:76-97 [Conf ] Julian C. Bradfield Introduction to Modal and Temporal Mu-Calculi (Abstract). [Citation Graph (0, 0)][DBLP ] CONCUR, 2002, pp:98- [Conf ] Andrew D. Gordon Types for Cryptographic Protocols. [Citation Graph (0, 0)][DBLP ] CONCUR, 2002, pp:99-100 [Conf ] Yonit Kesten , Amir Pnueli , Elad Shahar , Lenore D. Zuck Network Invariants in Action. [Citation Graph (0, 0)][DBLP ] CONCUR, 2002, pp:101-115 [Conf ] Parosh Aziz Abdulla , Bengt Jonsson , Marcus Nilsson , Julien d'Orso Regular Model Checking Made Simple and Efficient. [Citation Graph (0, 0)][DBLP ] CONCUR, 2002, pp:116-130 [Conf ] Kousha Etessami A Hierarchy of Polynomial-Time Computable Simulations for Automata. [Citation Graph (0, 0)][DBLP ] CONCUR, 2002, pp:131-144 [Conf ] P. Madhusudan , P. S. Thiagarajan A Decidable Class of Asynchronous Distributed Controllers. [Citation Graph (0, 0)][DBLP ] CONCUR, 2002, pp:145-160 [Conf ] Antti Valmari , Antti Kervinen Alphabet-Based Synchronisation is Exponentially Cheaper. [Citation Graph (0, 0)][DBLP ] CONCUR, 2002, pp:161-176 [Conf ] Markus Lohrey Safe Realizability of High-Level Message Sequence Charts. [Citation Graph (0, 0)][DBLP ] CONCUR, 2002, pp:177-192 [Conf ] Eugene Asarin , Gerardo Schneider Widening the Boundary between Decidable and Undecidable Hybrid Systems. [Citation Graph (0, 0)][DBLP ] CONCUR, 2002, pp:193-208 [Conf ] Luís Caires , Luca Cardelli A Spatial Logic for Concurrency (Part II). [Citation Graph (0, 0)][DBLP ] CONCUR, 2002, pp:209-225 [Conf ] Beata Konikowska , Wojciech Penczek Reducing Model Checking from Multi-valued {\rm CTL}^{\ast} to {\rm CTL}^{\ast}. [Citation Graph (0, 0)][DBLP ] CONCUR, 2002, pp:226-239 [Conf ] Martin Lange Local Model Checking Games for Fixed Point Logic with Chop. [Citation Graph (0, 0)][DBLP ] CONCUR, 2002, pp:240-254 [Conf ] Maria Sorea A Decidable Fixpoint Logic for Time-Outs. [Citation Graph (0, 0)][DBLP ] CONCUR, 2002, pp:255-271 [Conf ] Jens Chr. Godskesen , Thomas T. Hildebrandt , Vladimiro Sassone A Calculus of Mobile Resources. [Citation Graph (0, 0)][DBLP ] CONCUR, 2002, pp:272-287 [Conf ] David Teller , Pascal Zimmer , Daniel Hirschkoff Using Ambients to Control Resources. [Citation Graph (0, 0)][DBLP ] CONCUR, 2002, pp:288-303 [Conf ] Massimo Merro , Vladimiro Sassone Typing and Subtyping Mobility in Boxed Ambients. [Citation Graph (0, 0)][DBLP ] CONCUR, 2002, pp:304-320 [Conf ] Roberto Bruni , Cosimo Laneve , Ugo Montanari Orchestrating Transactions in Join Calculus. [Citation Graph (0, 0)][DBLP ] CONCUR, 2002, pp:321-337 [Conf ] Christel Baier , Joost-Pieter Katoen , Holger Hermanns , Boudewijn R. Haverkort Simulation for Continuous-Time Markov Chains. [Citation Graph (0, 0)][DBLP ] CONCUR, 2002, pp:338-354 [Conf ] Josee Desharnais , Vineet Gupta , Radha Jagadeesan , Prakash Panangaden Weak Bisimulation is Sound and Complete for PCTL*. [Citation Graph (0, 0)][DBLP ] CONCUR, 2002, pp:355-370 [Conf ] Stefano Cattani , Roberto Segala Decision Algorithms for Probabilistic Bisimulation. [Citation Graph (0, 0)][DBLP ] CONCUR, 2002, pp:371-385 [Conf ] Gerald Lüttgen , Michael Mendler Axiomatizing an Algebra of Step Reactions for Synchronous Languages. [Citation Graph (0, 0)][DBLP ] CONCUR, 2002, pp:386-401 [Conf ] Jean Fanchon , Rémi Morin Regular Sets of Pomsets with Autoconcurrency. [Citation Graph (0, 0)][DBLP ] CONCUR, 2002, pp:402-417 [Conf ] Philippa Gardner , Cosimo Laneve , Lucian Wischik The Fusion Machine. [Citation Graph (0, 0)][DBLP ] CONCUR, 2002, pp:418-433 [Conf ] Mikkel Nygaard , Glynn Winskel HOPLA-A Higher-Order Process Language. [Citation Graph (0, 0)][DBLP ] CONCUR, 2002, pp:434-448 [Conf ] Maria Grazia Buscemi , Ugo Montanari A First Order Coalgebraic Model of pi-Calculus Early Observational Equivalence. [Citation Graph (0, 0)][DBLP ] CONCUR, 2002, pp:449-465 [Conf ] Stephen D. Brookes Traces, Pomsets, Fairness and Full Abstraction for Communicating Processes. [Citation Graph (0, 0)][DBLP ] CONCUR, 2002, pp:466-482 [Conf ] Michele Boreale , Maria Grazia Buscemi A Framework for the Analysis of Security Protocols. [Citation Graph (0, 0)][DBLP ] CONCUR, 2002, pp:483-498 [Conf ] Roberto M. Amadio , Witold Charatonik On Name Generation and Set-Based Analysis in the Dolev-Yao Model. [Citation Graph (0, 0)][DBLP ] CONCUR, 2002, pp:499-514 [Conf ] Ralf Küsters On the Decidability of Cryptographic Protocols with Open-Ended Data Structures. [Citation Graph (0, 0)][DBLP ] CONCUR, 2002, pp:515-530 [Conf ] H. C. M. Kleijn , Maciej Koutny Causality Semantics of Petri Nets with Weighted Inhibitor Arcs. [Citation Graph (0, 0)][DBLP ] CONCUR, 2002, pp:531-546 [Conf ] Hagen Völzer Refinement-Robust Fairness. [Citation Graph (0, 0)][DBLP ] CONCUR, 2002, pp:547-561 [Conf ] Slawomir Lasota Decidability of Strong Bisimilarity for Timed BPP. [Citation Graph (0, 0)][DBLP ] CONCUR, 2002, pp:562-578 [Conf ] Jirí Srba Undecidability of Weak Bisimilarity for Pushdown Processes. [Citation Graph (0, 0)][DBLP ] CONCUR, 2002, pp:579-593 [Conf ] Antonín Kucera , Richard Mayr Why Is Simulation Harder than Bisimulation? [Citation Graph (0, 0)][DBLP ] CONCUR, 2002, pp:594-610 [Conf ]