Conferences in DBLP
Robin Milner The Polyadic Pi-calculus (Abstract). [Citation Graph (0, 0)][DBLP ] CONCUR, 1992, pp:1- [Conf ] Michele Boreale , Rocco De Nicola Testing Equivalence for Mobile Processes (Extended Abstract). [Citation Graph (0, 0)][DBLP ] CONCUR, 1992, pp:2-16 [Conf ] Lalita Jategaonkar , Albert R. Meyer Testing Equivalence for Petri Nets with Action Refinement: Preliminary Report. [Citation Graph (0, 0)][DBLP ] CONCUR, 1992, pp:17-31 [Conf ] Davide Sangiorgi , Robin Milner The Problem of ``Weak Bisimulation up to''. [Citation Graph (0, 0)][DBLP ] CONCUR, 1992, pp:32-46 [Conf ] Ed Brinksma On the Uniqueness of Fixpoints Modulo Observation Congruence. [Citation Graph (0, 0)][DBLP ] CONCUR, 1992, pp:47-61 [Conf ] Jan Friso Groote , Faron Moller Verification of Parallel Systems via Decomposition. [Citation Graph (0, 0)][DBLP ] CONCUR, 1992, pp:62-76 [Conf ] Rob Gerth , Ruurd Kuiper , John Segers Interface Refinement in Reactive Systems (Extended Abstract). [Citation Graph (0, 0)][DBLP ] CONCUR, 1992, pp:77-93 [Conf ] Matthew Hennessy Concurrent Testing of Processes (Extended Abstract). [Citation Graph (0, 0)][DBLP ] CONCUR, 1992, pp:94-107 [Conf ] Gérard Boudol , Ilaria Castellani , Matthew Hennessy , Astrid Kiehn A Theory of Process with Localities (Extended Abstract). [Citation Graph (0, 0)][DBLP ] CONCUR, 1992, pp:108-122 [Conf ] Olaf Burkart , Bernhard Steffen Model Checking for Context-Free Processes. [Citation Graph (0, 0)][DBLP ] CONCUR, 1992, pp:123-137 [Conf ] Søren Christensen , Hans Hüttel , Colin Stirling Bisimulation Equivalence is Decidable for all Context-Free Processes. [Citation Graph (0, 0)][DBLP ] CONCUR, 1992, pp:138-147 [Conf ] Søren Christensen Distributed Bisimularity is Decidable for a Class of Infinite State-Space Systems. [Citation Graph (0, 0)][DBLP ] CONCUR, 1992, pp:148-161 [Conf ] Amir Pnueli How Vital is Liveness? Verifying Timing Properties of Reactive and Hybrid Systems (Extended Abstract). [Citation Graph (0, 0)][DBLP ] CONCUR, 1992, pp:162-175 [Conf ] Frank A. Stomp Preserving Specific Properties in Programm Development: How to Debug Programs (Conference Version). [Citation Graph (0, 0)][DBLP ] CONCUR, 1992, pp:176-191 [Conf ] Doron Peled Sometimes 'Some' is as Good as 'All'. [Citation Graph (0, 0)][DBLP ] CONCUR, 1992, pp:192-206 [Conf ] Roope Kaivola , Antti Valmari The Weakest Compositional Semantic Equivalence Preserving Nexttime-less Linear temporal Logic. [Citation Graph (0, 0)][DBLP ] CONCUR, 1992, pp:207-221 [Conf ] Ursula Goltz , Ruurd Kuiper , Wojciech Penczek Propositional Temporal Logics and Equivalences. [Citation Graph (0, 0)][DBLP ] CONCUR, 1992, pp:222-236 [Conf ] Vaughan R. Pratt The Duality of TIme and Information. [Citation Graph (0, 0)][DBLP ] CONCUR, 1992, pp:237-253 [Conf ] Eric Goubault , Thomas P. Jensen Homology of Higher Dimensional Automata. [Citation Graph (0, 0)][DBLP ] CONCUR, 1992, pp:254-268 [Conf ] Arend Rensink Posets for Configurations! [Citation Graph (0, 0)][DBLP ] CONCUR, 1992, pp:269-285 [Conf ] José Meseguer , Ugo Montanari , Vladimiro Sassone On the Semantics of Petri Nets. [Citation Graph (0, 0)][DBLP ] CONCUR, 1992, pp:286-301 [Conf ] Eric Badouel , Philippe Darondeau Structural Operational Specifications and the Trace Automata. [Citation Graph (0, 0)][DBLP ] CONCUR, 1992, pp:302-316 [Conf ] Butler W. Lampson , Nancy A. Lynch , Jørgen F. Søgaard-Andersen At-Most-Once Message Delivery. A Case Study in Algorithm Verification. [Citation Graph (0, 0)][DBLP ] CONCUR, 1992, pp:317-324 [Conf ] Nick Reingold , Da-Wei Wang , Lenore D. Zuck Games I/O Automata Play (Extended Abstract). [Citation Graph (0, 0)][DBLP ] CONCUR, 1992, pp:325-339 [Conf ] Rajeev Alur , Costas Courcoubetis , Nicolas Halbwachs , David L. Dill , Howard Wong-Toi Minimization of Timed Transition Systems. [Citation Graph (0, 0)][DBLP ] CONCUR, 1992, pp:340-354 [Conf ] Jim Davies , Steve Schneider Using CSP to Verify a Timed Protocol over a Fair Medium. [Citation Graph (0, 0)][DBLP ] CONCUR, 1992, pp:355-369 [Conf ] Henri B. Weinberg , Lenore D. Zuck Timed Ethernet: Real-Time Formal Specification of Ethernet. [Citation Graph (0, 0)][DBLP ] CONCUR, 1992, pp:370-385 [Conf ] Günter Karjoth Implementing LOTOS Specifications by Communicating State Machines. [Citation Graph (0, 0)][DBLP ] CONCUR, 1992, pp:386-400 [Conf ] Jos C. M. Baeten , Jan A. Bergstra Discrete Time Process Algebra. [Citation Graph (0, 0)][DBLP ] CONCUR, 1992, pp:401-420 [Conf ] Steven Klusener The Silent Step in Time. [Citation Graph (0, 0)][DBLP ] CONCUR, 1992, pp:421-435 [Conf ] Frits W. Vaandrager , Nancy A. Lynch Action Transducers and Timed Automata. [Citation Graph (0, 0)][DBLP ] CONCUR, 1992, pp:436-455 [Conf ] Kim Guldstrand Larsen , Arne Skou Compositional Verification of Probabilistic Processes. [Citation Graph (0, 0)][DBLP ] CONCUR, 1992, pp:456-471 [Conf ] Jos C. M. Baeten , Jan A. Bergstra , Scott A. Smolka Axiomization Probabilistic Processes: ACP with Generative Probabililties (Extended Abstract). [Citation Graph (0, 0)][DBLP ] CONCUR, 1992, pp:472-485 [Conf ] Ehud Y. Shapiro Embeddings Among Concurrent Programming Languages (Preliminary Version). [Citation Graph (0, 0)][DBLP ] CONCUR, 1992, pp:486-503 [Conf ] Alexander Moshe Rabinovich Logic of Trace Languages (Extended Abstract). [Citation Graph (0, 0)][DBLP ] CONCUR, 1992, pp:504-517 [Conf ] Joachim Parrow , Peter Sjödin Multiway Synchrinizaton Verified with Coupled Simulation. [Citation Graph (0, 0)][DBLP ] CONCUR, 1992, pp:518-533 [Conf ] Steven M. German Programming in a General Model of Synchronization. [Citation Graph (0, 0)][DBLP ] CONCUR, 1992, pp:534-549 [Conf ] Florence Maraninchi Operational and Compositional Semantics of Synchronous Automaton Compositions. [Citation Graph (0, 0)][DBLP ] CONCUR, 1992, pp:550-564 [Conf ] Gul Agha , Ian A. Mason , Scott F. Smith , Carolyn L. Talcott Towards a Theory of Actor Computation. [Citation Graph (0, 0)][DBLP ] CONCUR, 1992, pp:565-579 [Conf ]