CONCUR B

40 papers

YearTitle / Authors
2002A Calculus of Mobile Resources.
Jens Chr. Godskesen, Thomas T. Hildebrandt, Vladimiro Sassone
2002A Decidable Class of Asynchronous Distributed Controllers.
P. Madhusudan, P. S. Thiagarajan
2002A Decidable Fixpoint Logic for Time-Outs.
Maria Sorea
2002A Deductive Proof System for CTL.
Amir Pnueli, Yonit Kesten
2002A First Order Coalgebraic Model of pi-Calculus Early Observational Equivalence.
Maria Grazia Buscemi, Ugo Montanari
2002A Framework for the Analysis of Security Protocols.
Michele Boreale, Maria Grazia Buscemi
2002A Hierarchy of Polynomial-Time Computable Simulations for Automata.
Kousha Etessami
2002A Spatial Logic for Concurrency (Part II).
Luís Caires, Luca Cardelli
2002Alphabet-Based Synchronisation is Exponentially Cheaper.
Antti Valmari, Antti Kervinen
2002Axiomatizing an Algebra of Step Reactions for Synchronous Languages.
Gerald Lüttgen, Michael Mendler
2002CONCUR 2002 - Concurrency Theory, 13th International Conference, Brno, Czech Republic, August 20-23, 2002, Proceedings
Lubos Brim, Petr Jancar, Mojmír Kretínský, Antonín Kucera
2002Causality Semantics of Petri Nets with Weighted Inhibitor Arcs.
H. C. M. Kleijn, Maciej Koutny
2002Decidability of Strong Bisimilarity for Timed BPP.
Slawomir Lasota
2002Decision Algorithms for Probabilistic Bisimulation.
Stefano Cattani, Roberto Segala
2002Event-State Duality: The Enriched Case.
Vaughan R. Pratt
2002Expressive Power of Temporal Logics.
Alexander Moshe Rabinovich
2002HOPLA-A Higher-Order Process Language.
Mikkel Nygaard, Glynn Winskel
2002Introduction to Modal and Temporal Mu-Calculi (Abstract).
Julian C. Bradfield
2002Local Model Checking Games for Fixed Point Logic with Chop.
Martin Lange
2002Network Invariants in Action.
Yonit Kesten, Amir Pnueli, Elad Shahar, Lenore D. Zuck
2002On Name Generation and Set-Based Analysis in the Dolev-Yao Model.
Roberto M. Amadio, Witold Charatonik
2002On the Decidability of Cryptographic Protocols with Open-Ended Data Structures.
Ralf Küsters
2002Orchestrating Transactions in Join Calculus.
Roberto Bruni, Cosimo Laneve, Ugo Montanari
2002Reducing Model Checking from Multi-valued {\rm CTL}^{\ast} to {\rm CTL}^{\ast}.
Beata Konikowska, Wojciech Penczek
2002Refinement and Verification Applied to an In-Flight Data Acquisition Unit.
Wan J. Fokkink, Natalia Ioustinova, Ernst Kesseler, Jaco van de Pol, Yaroslav S. Usenko, Yuri A. Yushtein
2002Refinement-Robust Fairness.
Hagen Völzer
2002Regular Model Checking Made Simple and Efficient.
Parosh Aziz Abdulla, Bengt Jonsson, Marcus Nilsson, Julien d'Orso
2002Regular Sets of Pomsets with Autoconcurrency.
Jean Fanchon, Rémi Morin
2002Safe Realizability of High-Level Message Sequence Charts.
Markus Lohrey
2002Simulation for Continuous-Time Markov Chains.
Christel Baier, Joost-Pieter Katoen, Holger Hermanns, Boudewijn R. Haverkort
2002The Fusion Machine.
Philippa Gardner, Cosimo Laneve, Lucian Wischik
2002Traces, Pomsets, Fairness and Full Abstraction for Communicating Processes.
Stephen D. Brookes
2002Types for Cryptographic Protocols.
Andrew D. Gordon
2002Types, or: Where's the Difference Between CCS and pi?
Davide Sangiorgi
2002Typing and Subtyping Mobility in Boxed Ambients.
Massimo Merro, Vladimiro Sassone
2002Undecidability of Weak Bisimilarity for Pushdown Processes.
Jirí Srba
2002Using Ambients to Control Resources.
David Teller, Pascal Zimmer, Daniel Hirschkoff
2002Weak Bisimulation is Sound and Complete for PCTL*.
Josée Desharnais, Vineet Gupta, Radha Jagadeesan, Prakash Panangaden
2002Why Is Simulation Harder than Bisimulation?
Antonín Kucera, Richard Mayr
2002Widening the Boundary between Decidable and Undecidable Hybrid Systems.
Eugene Asarin, Gerardo Schneider