CONCUR'99. Concurrency Theory: 10th International Conference Eindhoven, The Netherlands, August 24-27, 1999 Proceedings
- ISBN-10
- 3540483209
- ISBN-13
- 9783540483205
- Category
- Mathematics
- Pages
- 584
- Language
- English
- Published
- 2003-07-31
- Publisher
- Springer
- Authors
- Jos C.M. Baeten, Sjouke Mauw
Description
This book constitutes the proceedings of the 10th International Conference on Concurrency Theory, CONCUR'99, held in Eindhoven, The Netherlands in August 1999. The 32 revised full papers presented together with four invited contributions were selected from a total of 91 submissions. The papers address all areas of semantics, logics, and verification techniques for concurrent systems, in particular process algebras, Petri nets, event-structures, real-time systems, hybrid systems, stochastic systems, decidability, model-checking, verification, refinement, term and graph rewriting, distributed programming, logic constraint programming, typing systems, etc.
Get the book
Other editions
-
- 1999-08-13
- 584 pages
- Paperback
- Springer
Similar books
-
CONCUR 2003 - Concurrency Theory: 14th International Conference, Marseille, France, September 3-5, 2003, Proceedings
By Roberto Amadio, Denis LugiezIn CONCUR'99: Concurrency Theory. 10th Int. Conf., volume 1664 of Lect. Notes in Comp. Sci., pages 258–273. Springer, 1999. J. Desharnais, V. Gupta, R. Jagadeesan, and P. Panangaden. The metric analogue of weak bisimulation for ...
-
CONCUR 2000 - Concurrency Theory: 11th International Conference, University Park, PA, USA, August 22-25, 2000 Proceedings
By Catuscia Palamidessi120 9. J. Esparza and S. Römer. An unfolding algorithm for synchronous products of transition systems. In Proceedings of the 10th International Conference on Concurrency Theory (Concur'99), pages 2–20. Springer-Verlag, 1999. LNCS 1664.
-
CONCUR 2001 - Concurrency Theory: 12th International Conference, Aalborg, Denmark, August 20-25, 2001 Proceedings
By Mogens Nielsen, Kim G. LarsenIn 7th International Conference on Concurrency Theory (CONCUR'96), volume 1119 of Lecture Notes in Computer Science, pages 406–421. Springer, 1996. D. Gollmann. Computer Security. John Wiley & Sons Ltd., 1999. M. Hennessy and J. Riely.
-
CONCUR 2006 - Concurrency Theory: 17th International Conference, CONCUR 2006, Bonn, Germany, August 27-30, 2006
By Christel Baier, Holger Hermanns17th International Conference, CONCUR 2006, Bonn, Germany, August 27-30, 2006 Christel Baier, Holger Hermanns. 10. 11. 12. 13. ... In CONCUR'96: Concurrency Theory, pages 655–670. ... In CONCUR '99: Concurrency Theory, pages 288–303.
-
CONCUR 2002 - Concurrency Theory: 13th International Conference, Brno, Czech Republic, August 20-23, 2002. Proceedings
By Lubos Brim, Petr Jancar, Mojmir KretinskyIn Proceedings of the 9th International Conference on Concurrency Theory (CONCUR 99), Eindhoven (The Netherlands), number 1664 in Lecture Notes in Computer Science, pages 114–129. Springer, 1999. 178, 181 4. H. Ben-Abdallah and S. Leue.
-
Foundation of Software Science and Computation Structures: Third International Conference, FOSSACS 2000 Held as Part of the Joint European Conferences...
By Jerzy TiurynThird International Conference, FOSSACS 2000 Held as Part of the Joint European Conferences on Theory and Practice of Software, ETAPS 2000 Berlin, Germany, ... Concurrency Theory (CONCUR'99), Eindhoven, The Netherlands, Aug.
-
Logic, Rewriting, and Concurrency: Essays Dedicated to José Meseguer on the Occasion of His 65th Birthday
By Narciso Martí-Oliet, Carolyn Talcott, Peter Csaba Ölveczky23–41 (1999) Meseguer, J., Talcott, C.L.: A partial order event model for concurrent objects. In: Baeten, J.C.M., Mauw, S. (eds.) CONCUR '99: Concurrency Theory, 10th International Conference, Eindhoven, The Netherlands, August 24–27, ...
-
Modeling and Verification of Parallel Processes: 4th Summer School, MOVEP 2000, Nantes, France, June 19-23, 2000. Revised Tutorial Lectures
By Mark D. Ryan, Franck Cassez, Claude JardSystem Unit Functional Executable Model Machines. SDLSDL. tool is a unique finite state machine (represented in standard SDL) that can be directly provided in input to the ObjectGEODE model checker. The SdlSdl tool relies on an ...
-
The Pi-Calculus: A Theory of Mobile Processes
By David Walker, Davide SangiorgiGraduate text on the p-calculus, a mathematical model of mobile computing systems.
-
Theoretical Aspects of Computer Software: 4th International Symposium, TACS 2001, Sendai, Japan, October 29-31, 2001. Proceedings
By Benjamin C. Pierce, Naoki KobayashiThe completeness result for our infinitary type system is based on the connection between Abramsky's ... In fact, to obtain a non-trivial model for the λ-calculus one needs to consider a fixed collection of basic types.