default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCID9th CONCUR 1998: Nice, France
- Davide Sangiorgi, Robert de Simone:
CONCUR '98: Concurrency Theory, 9th International Conference, Nice, France, September 8-11, 1998, Proceedings. Lecture Notes in Computer Science 1466, Springer 1998, ISBN 3-540-64896-8
Invited Lecture
- Moshe Y. Vardi:
Sometimes and Not Never Re-revisited: On Branching Versus Linear Time. 1-17
Contributions
- P. Madhusudan, P. S. Thiagarajan:
Controllers for Discrete Event Systems via Morphisms. 18-33 - Ron van der Meyden, Moshe Y. Vardi:
Synthesis from Knowledge-Based Specifications (Extended Abstract). 34-49 - Denis Lugiez, Philippe Schnoebelen:
The Regular Viewpoint on PA-Processes. 50-66 - Werner Damm, Amir Pnueli, Sitvanit Ruah:
Herbrand Automata for Hardware Verification. 67-83 - Chiara Bodei, Pierpaolo Degano, Flemming Nielson, Hanne Riis Nielson:
Control Flow Analysis for the pi-calculus. 84-98 - Joachim Parrow, Björn Victor:
The Tau-Laws of Fusion. 99-114 - José-Luis Vivas, Mads Dam:
From Higher-Order pi-Calculus to pi-Calculus in the Presence of Static Operators. 115-130 - Nobuko Yoshida
:
Minimality and Separation Results on Asynchronous Mobile Processes: Representability Theorems by Concurrent Combinators (Extended Abstract). 131-146 - Perdita Stevens:
Abstract Games for Infinite State Processes. 147-162 - Rajeev Alur, Thomas A. Henzinger, Orna Kupferman, Moshe Y. Vardi:
Alternating Refinement Relations. 163-178 - Simone Veglioni, Rocco De Nicola:
Possible Worlds for Process Algebras. 179-193
Invited Lecture
- Jan J. M. M. Rutten:
Automata and Coinduction (An Exercise in Coalgebra). 194-218
Contributions
- Jean-François Raskin, Pierre-Yves Schobbens, Thomas A. Henzinger:
Axioms for Real-Time Logics. 219-236 - Holger Hermanns, Markus Lohrey:
Priority and Maximal Progress Are Completely Axioatisable (Extended Abstract). 237-252 - Parosh Aziz Abdulla, Karlis Cerans:
Simulation Is Decidable for One-Counter Nets (Extended Abstract). 253-268 - Peter Sewell:
From Rewrite to Bisimulation Congruences. 269-284 - Frank S. de Boer:
Reasoning about Asynchronous Communication in Dynamically Evolving Object Structures. 285-300 - Roberto M. Amadio, Sanjiva Prasad:
Modelling IP Mobility. 301-316 - Ernie Cohen, Leslie Lamport:
Reduction in TLA. 317-331 - Lisbeth Fajstrup, Eric Goubault, Martin Raußen:
Detecting Deadlocks in Concurrent Systems. 332-347 - Sandro Etalle, Maurizio Gabbrielli, Maria Chiara Meo:
Unfold/Fold Transformations of CCP Programs. 348-365
Invited Tutorial
- Benjamin C. Pierce:
Type Systems for Concurrent Calculi (Abstract). 364-365
Invited Lecture
- Ulrich Herzog:
Stochastic Process Algebras Benefits for Performance Evaluation and Challenges (Extended Abstract). 366-372
Contributions
- Albert Benveniste, Claude Jard, Stephane Gaubert:
Algebraic Techniques for Timed Systems. 373-388 - Anna Philippou, Rance Cleaveland, Insup Lee, Scott A. Smolka, Oleg Sokolsky:
Praobabilistic Resource Failure in Real-Time Process Algebra. 389-404 - Mario Bravetti, Marco Bernardo, Roberto Gorrieri:
Towards Performance Evaluation with General Distributions in Process Algebras. 405-422 - Luca de Alfaro:
Stochastic Transition Systems. 423-438
Invited Lecture
- Thomas A. Henzinger:
It's About Time: Real-Time Logics Reviewed. 439-454
Contributions
- François Demichelis, Wieslaw Zielonka:
Controlled Timed Automata. 455-469 - Eugene Asarin, Oded Maler, Amir Pnueli:
On Discretization of Delays in Timed Automata and Digital Circuits. 470-484 - Johan Bengtsson, Bengt Jonsson, Johan Lilius, Wang Yi:
Partial Order Reductions for Timed Systems. 485-500 - Walter Vogler, Alexei L. Semenov, Alexandre Yakovlev:
Unfolding and Finite Prefix for Nets with Read Arcs. 501-516 - Dietrich Kuske:
Asynchronous Cellular Automata and Asynchronous Automata for Pomsets. 517-532 - Philippe Darondeau:
Deriving Unbounded Petri Nets from Formal Languages. 533-548 - Rémi Morin:
Decompositions of Asynchronous Systems. 549-564 - Marta Pietkiewicz-Koutny:
Synthesis of ENI-systems Using Minimal Regions. 565-580 - Gian Luca Cattani, John Power, Glynn Winskel:
A Categorical Axiomatics for Bisimulation. 581-596 - Eugene W. Stark:
Fibrational Semantics of Dataflow Networks. 597-612 - Thomas T. Hildebrandt, Prakash Panangaden, Glynn Winskel:
A Relational Model of Non-deterministic Dataflow. 613-628
Invited Tutorial
- Jan Friso Groote, François Monin, Jaco van de Pol:
Checking Verifications of Protocols and Distributed Systems by Computer. 629-655
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 2025-03-11 19:48 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:
