CONCUR B

39 papers

YearTitle / Authors
2001A Faster-than Relation for Asynchronous Processes.
Gerald Lüttgen, Walter Vogler
2001A Game-Based Verification of Non-repudiation and Fair Exchange Protocols.
Steve Kremer, Jean-François Raskin
2001A Static Analysis Technique for Graph Transformation Systems.
Paolo Baldan, Andrea Corradini, Barbara König
2001A Testing Theory for Generally Distributed Stochastic Processes.
Natalia López, Manuel Núñez
2001Abstraction-Based Model Checking Using Modal Transition Systems.
Patrice Godefroid, Michael Huth, Radha Jagadeesan
2001An Algebraic Characterization of Data and Timed Languages.
Patricia Bouyer, Antoine Petit, Denis Thérien
2001An Algorithm for Quantitative Verification of Probabilistic Transition Systems.
Franck van Breugel, James Worrell
2001Bigraphical Reactive Systems.
Robin Milner
2001Bounded Reachability Checking with Process Semantics.
Keijo Heljanko
2001CCS with Priority Guards.
Iain Phillips
2001CONCUR 2001 - Concurrency Theory, 12th International Conference, Aalborg, Denmark, August 20-25, 2001, Proceedings
Kim Guldstrand Larsen, Mogens Nielsen
2001Channel Representations in Protocol Verification.
Parosh Aziz Abdulla, Bengt Jonsson
2001Compositional Methods for Probabilistic Systems.
Luca de Alfaro, Thomas A. Henzinger, Ranjit Jhala
2001Compositional Modeling of Reactive Systems Using Open Nets.
Paolo Baldan, Andrea Corradini, Hartmut Ehrig, Reiko Heckel
2001Control of Networks of Unmanned Vehicles.
Shankar Sastry
2001Divide and Compose: SCC Refinement for Language Emptiness.
Chao Wang, Roderick Bloem, Gary D. Hachtel, Kavita Ravi, Fabio Somenzi
2001Dynamic Input/Output Automata: A Formal Model for Dynamic Systems.
Paul C. Attie, Nancy A. Lynch
2001Efficient Multiple-Valued Model-Checking Using Lattice Representations.
Marsha Chechik, Benet Devereux, Steve M. Easterbrook, Albert Y. C. Lai, Victor Petrovykh
2001Extended Temporal Logic Revisited.
Orna Kupferman, Nir Piterman, Moshe Y. Vardi
2001Extending Memory Consistency of Finite Prefixes to Infinite Computations.
Marcelo Glusman, Shmuel Katz
2001Liveness and Fairness in Process-Algebraic Verification.
Antti Puhakka, Antti Valmari
2001Local First Search - A New Paradigm for Partial Order Reductions.
Peter Niebert, Michaela Huhn, Sarah Zennou, Denis Lugiez
2001Logic of Global Synchrony.
Yifeng Chen, Jeff W. Sanders
2001On Barbed Equivalences in pi-Calculus.
Davide Sangiorgi, David Walker
2001On the Power of Labels in Transition Systems.
Jirí Srba
2001Performance Evaluation : = (Process Algebra + Model Checking) × Markov Chains.
Holger Hermanns, Joost-Pieter Katoen
2001Probabilistic Information Flow in a Process Algebra.
Alessandro Aldini
2001Process Algebra and Security.
Steve A. Schneider
2001Randomized Non-sequential Processes.
Hagen Völzer
2001Reasoning about Security in Mobile Ambients.
Michele Bugliesi, Giuseppe Castagna, Silvia Crafa
2001Symbolic Algorithms for Infinite-State Games.
Luca de Alfaro, Thomas A. Henzinger, Rupak Majumdar
2001Symbolic Computation of Maximal Probabilistic Reachability.
Marta Z. Kwiatkowska, Gethin Norman, Jeremy Sproston
2001Synchronized Hyperedge Replacement with Name Mobility.
Dan Hirsch, Ugo Montanari
2001Techniques for Smaller Intermediary BDDs.
Jaco Geldenhuys, Antti Valmari
2001The Control of Synchronous Systems, Part II.
Luca de Alfaro, Thomas A. Henzinger, Freddy Y. C. Mang
2001Towards an Efficient Algorithm for Unfolding Petri Nets.
Victor Khomenko, Maciej Koutny
2001Typing Mobility in the Seal Calculus.
Giuseppe Castagna, Giorgio Ghelli, Francesco Zappa Nardelli
2001Unavoidable Configurations of Parameterized Rings of Processes.
Marie Duflot, Laurent Fribourg, Ulf Nilsson
2001Using the Bandera Tool Set to Model-Check Properties of Concurrent Java Software.
John Hatcliff, Matthew B. Dwyer