default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCID12th CONCUR 2001: Aalborg, Denmark
- Kim Guldstrand Larsen, Mogens Nielsen:
CONCUR 2001 - Concurrency Theory, 12th International Conference, Aalborg, Denmark, August 20-25, 2001, Proceedings. Lecture Notes in Computer Science 2154, Springer 2001, ISBN 3-540-42497-0
Invited Talks
- Parosh Aziz Abdulla, Bengt Jonsson:
Channel Representations in Protocol Verification. 1-15 - Robin Milner:
Bigraphical Reactive Systems. 16-35 - Shankar Sastry:
Control of Networks of Unmanned Vehicles. 36 - Steve A. Schneider:
Process Algebra and Security. 37-38
Invited Tutorials
- John Hatcliff, Matthew B. Dwyer:
Using the Bandera Tool Set to Model-Check Properties of Concurrent Java Software. 39-58 - Holger Hermanns, Joost-Pieter Katoen:
Performance Evaluation : = (Process Algebra + Model Checking) × Markov Chains. 59-81
Mobility
- Giuseppe Castagna, Giorgio Ghelli, Francesco Zappa Nardelli:
Typing Mobility in the Seal Calculus. 82-101 - Michele Bugliesi
, Giuseppe Castagna, Silvia Crafa:
Reasoning about Security in Mobile Ambients. 102-120 - Dan Hirsch, Ugo Montanari:
Synchronized Hyperedge Replacement with Name Mobility. 121-136 - Paul C. Attie, Nancy A. Lynch:
Dynamic Input/Output Automata: A Formal Model for Dynamic Systems. 137-151
Probabilistic Systems
- Alessandro Aldini:
Probabilistic Information Flow in a Process Algebra. 152-168 - Marta Z. Kwiatkowska, Gethin Norman, Jeremy Sproston:
Symbolic Computation of Maximal Probabilistic Reachability. 169-183 - Hagen Völzer:
Randomized Non-sequential Processes. 184-201
Model Checking
- Antti Puhakka, Antti Valmari:
Liveness and Fairness in Process-Algebraic Verification. 202-217 - Keijo Heljanko:
Bounded Reachability Checking with Process Semantics. 218-232 - Jaco Geldenhuys, Antti Valmari:
Techniques for Smaller Intermediary BDDs. 233-247 - Patricia Bouyer, Antoine Petit, Denis Thérien:
An Algebraic Characterization of Data and Timed Languages. 248-261
Process Algebra
- Gerald Lüttgen, Walter Vogler:
A Faster-than Relation for Asynchronous Processes. 262-276 - Jirí Srba:
On the Power of Labels in Transition Systems. 277-291 - Davide Sangiorgi, David Walker:
On Barbed Equivalences in pi-Calculus. 292-304 - Iain Phillips:
CCS with Priority Guards. 305-320
Probabilistic Systems
- Natalia López, Manuel Núñez:
A Testing Theory for Generally Distributed Stochastic Processes. 321-335 - Franck van Breugel, James Worrell:
An Algorithm for Quantitative Verification of Probabilistic Transition Systems. 336-350 - Luca de Alfaro, Thomas A. Henzinger, Ranjit Jhala:
Compositional Methods for Probabilistic Systems. 351-365
Unfoldings and Prefixes
- Victor Khomenko, Maciej Koutny:
Towards an Efficient Algorithm for Unfolding Petri Nets. 366-380 - Paolo Baldan, Andrea Corradini, Barbara König:
A Static Analysis Technique for Graph Transformation Systems. 381-395 - Peter Niebert, Michaela Huhn, Sarah Zennou, Denis Lugiez:
Local First Search - A New Paradigm for Partial Order Reductions. 396-410 - Marcelo Glusman, Shmuel Katz:
Extending Memory Consistency of Finite Prefixes to Infinite Computations. 411-425
Model Checking
- Patrice Godefroid, Michael Huth, Radha Jagadeesan:
Abstraction-Based Model Checking Using Modal Transition Systems. 426-440 - Marsha Chechik, Benet Devereux, Steve M. Easterbrook, Albert Y. C. Lai, Victor Petrovykh:
Efficient Multiple-Valued Model-Checking Using Lattice Representations. 441-455 - Chao Wang, Roderick Bloem, Gary D. Hachtel, Kavita Ravi, Fabio Somenzi:
Divide and Compose: SCC Refinement for Language Emptiness. 456-471 - Marie Duflot, Laurent Fribourg, Ulf Nilsson:
Unavoidable Configurations of Parameterized Rings of Processes. 472-486
Logic and Compositionality
- Yifeng Chen, Jeff W. Sanders:
Logic of Global Synchrony. 487-501 - Paolo Baldan, Andrea Corradini, Hartmut Ehrig, Reiko Heckel:
Compositional Modeling of Reactive Systems Using Open Nets. 502-518 - Orna Kupferman, Nir Piterman, Moshe Y. Vardi:
Extended Temporal Logic Revisited. 519-535
Games
- Luca de Alfaro, Thomas A. Henzinger, Rupak Majumdar:
Symbolic Algorithms for Infinite-State Games. 536-550 - Steve Kremer, Jean-François Raskin:
A Game-Based Verification of Non-repudiation and Fair Exchange Protocols. 551-565 - Luca de Alfaro, Thomas A. Henzinger, Freddy Y. C. Mang:
The Control of Synchronous Systems, Part II. 566-582
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
last updated on 2026-01-29 02:07 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
