default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCID7th CONCUR 1996: Pisa, Italy
- Ugo Montanari, Vladimiro Sassone:
CONCUR '96, Concurrency Theory, 7th International Conference, Pisa, Italy, August 26-29, 1996, Proceedings. Lecture Notes in Computer Science 1119, Springer 1996, ISBN 3-540-61604-7
Invited Talk
- Samson Abramsky
:
Retracing Some Paths in Process Algebra. 1-17
Process Algebras
- Andrew M. Pitts, Joshua R. X. Ross:
Process Calculus Based upon Evaluation to Committed Form. 18-33 - Rance Cleaveland, Gerald Lüttgen, V. Natarajan:
A Process Algebra with Distributed Priorities. 34-49 - Huimin Lin:
Symbolic Transition Graph with Assignment. 50-65
Tutorial
- Vineet Gupta, Radha Jagadeesan, Vijay A. Saraswat:
Models for Concurrent Constraint Programming. 66-83
Categorical Approaches
- Thomas T. Hildebrandt, Vladimiro Sassone:
Comparing Transition Systems with Independence and Asynchronous Transition Systems. 84-97 - Glynn Winskel:
A Presheaf Semantics of Value-Passing Processes. 98-114 - John Power:
Elementary Control Structures. 115-130
The pi-Calculus
- Anna Philippou, David Walker:
On Transformations of Concurrent Object Programs. 131-146 - Roberto M. Amadio, Ilaria Castellani, Davide Sangiorgi:
On Bisimulations for the Asynchronous pi-Calculus. 147-162 - Michele Boreale:
On the Expressiveness of Internal Mobility in Name-Passing Calculi. 163-178 - Uwe Nestmann, Benjamin C. Pierce:
Decoding Choice Encodings. 179-194
Invited Talk
- Faron Moller:
Infinite Results. 195-216
Decidability and Complexity
- Colin Stirling:
Decidability of Bisimulation Equivalence for Normed Pushdown Processes. 217-232 - Julian C. Bradfield:
The Modal mu-calculus Alternation Hierarchy is Strict. 233-246 - Olaf Burkart, Didier Caucal, Bernhard Steffen:
Bisimulation Collapse and the Process Taxonomy. 247-262 - David Janin, Igor Walukiewicz:
On the Expressive Completeness of the Propositional mu-Calculus with Respect to Monadic Second Order Logic. 263-277
Tutorial
- Bent Thomsen, Lone Leth Thomsen, Tsung-Min Kuo:
A Facile Tutorial. 278-298
Probability
- Roberto Segala:
Testing Probabilistic Automata. 299-314 - Marco Bernardo, Roberto Gorrieri:
Extended Markovian Process Algebra. 315-330
Invited Talk
- José Meseguer:
Rewriting Logic as a Semantic Framework for Concurrency: a Progress Report. 331-372
Functional & Constraint Programming
- Vineet Gupta, Radha Jagadeesan, Vijay A. Saraswat:
Truly Concurrent Constraint Programming. 373-388 - Björn Victor, Joachim Parrow:
Constraints as Processes. 389-405 - Cédric Fournet, Georges Gonthier, Jean-Jacques Lévy, Luc Maranget, Didier Rémy:
A Calculus of Mobile Agents. 406-421 - Carolina Lavatelli:
Algebraic Interpretation of Lambda Calculus with Resources. 422-437
Tutorial
- Andrea Corradini:
Concurrent Graph and Term Graph Rewriting. 438-464
Petri Nets
- Raymond Devillers:
Petri Boxes and Finite Precedence. 465-480 - Ahmed Bouajjani, Peter Habermehl:
Constrained Properties, Semilinear Systems, and Petri Nets. 481-497 - Eike Best, Catuscia Palamidessi:
Linear Constraint Systems as High-Level Nets. 498-513
Verification
- Thomas A. Henzinger, Orna Kupferman, Moshe Y. Vardi:
A Space-Efficient On-the-fly Algorithm for Real-Time Model Checking. 514-529 - Thomas A. Henzinger, Peter W. Kopke:
State Equivalences for Rectangular Hybrid Automata. 530-545 - Serdar Tasiran, Rajeev Alur, Robert P. Kurshan, Robert K. Brayton:
Verifying Abstractions of Timed Systems. 546-562 - Alessandro Fantechi, Stefania Gnesi, Diego Latella:
Towards Automatic Temporal Logic Verification of Value Passing Process Algebra Using Abstract Interpretation. 563-578
Invited Talk
- Wolfgang Reisig:
Modelling and Verification of Distributed Algorithms. 579-595
Automata & Cauality
- Doron A. Peled, Thomas Wilke, Pierre Wolper:
An Algorithmic Approach for Checking Closure Properties of omega-Regular Languages. 596-610 - Michaela Huhn, Peter Niebert:
Towards Automata for Branching Time and Partial Order. 611-626 - Manfred Droste, Paul Gastin:
Asynchronous Cellular Automata for Pomsets Without Auto-concurrency. 627-638 - Michaela Huhn:
Action Refinement and Property Inheritance in Systems of Sequential Agents. 639-654
Practical Models
- Paolo Di Blasio, Kathleen Fisher:
A Calculus for Concurrent Objects. 655-670 - Sjouke Mauw, Michel A. Reniers:
Refinement in Interworkings. 671-686 - Andrea Maggiolo-Schettini, Adriano Peron, Simone Tini:
Equivalences of Statecharts. 687-702
Shared-Memory Systems
- Jürgen Dingel:
Modular Verification for Shared-Variable Concurrent Programs. 703-718 - Jerry James, Ambuj K. Singh:
The Impact of Hardware Models on Shared Memory Consistency Conditions. 719-734 - Clemens Fischer, Wil Janssen:
Synchronous Development of Asynchonous Systems. 735-750
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-04-23 22:38 CEST 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:
