Electronic Notes in Theoretical Computer Science, Volume 68

Volume 68, Number 1, 2002

• Richard Buckland, Michael Johnson, Dominic Verity:
  On the Specification of Higher Dimensional Automata. 1-11
  
• Marco Kick:
  Rule Formats for Timed Processes. 12-31
  
• Jan Rothe, Dragan Masulovic:
  Towards Weak Bisimulation For Coalgebras. 32-46
  
• Ralf Schweimeier:
  A categorical framework for typing CCS-style process communication. 47-69
  
• Krzysztof Worytkiewicz:
  Concrete Process Categories. 70-85
  
• Alexander Kurz:
  Preface. 86
  

Volume 68, Number 2, 2002

• Uwe Nestmann, Prakash Panangaden:
  Preface. 1-2
  
• Catuscia Palamidessi:
  On the Expressive Power of Temporal Concurrent Constraint Programming Languages (invited talk). 3
  
• Danièle Beauquier, Yoram Hirshfeld, Alexander Moshe Rabinovich, Anatol Slissenko:
  The Probability Nesting Game. 4-14
  
• Marco Carbone, Sergio Maffeis:
  On the Expressive Power of Polyadic Synchronisation in pi-calculus. 15-32
  
• Rance Cleaveland, Gerald Lüttgen:
  A Logical Process Calculus. 33-50
  
• Maribel Fernández, Lionel Khalil:
  Interaction Nets with McCarthy's amb. 51-68
  
• Igor Walukiewicz:
  Describing properties of concurrent systems (Logic for Traces) (invited talk). 69
  
• Martin Lange:
  Alternating Context-Free Languages and Linear Time mu-Calculus with Sequential Composition. 70-86
  
• Nicolas Markey:
  Past is for Free: on the Complexity of Verifying Linear Temporal Properties with Past. 87-104
  
• Vladimiro Sassone, Pawel Sobocinski:
  Deriving Bisimulation Congruences: A 2-categorical Approach. 105-123
  
• Ulrik Frendrup, Hans Hüttel, Jesper Nyholm Jensen:
  Modal Logics for Cryptographic Processes. 124-141
  
• Joël Ouaknine, James Worrell:
  Timed CSP = Closed Timed Safety Automata. 142-159
  

Volume 68, Number 3, 2003

• Antonio Brogi, Jean-Marie Jacquet:
  Preface. 247
  
• Timo Aaltonen, Joni Helin, Mika Katara, Pertti Kellomäki, Tommi Mikkonen:
  Coordinating Aspects and Objects. 248-267
  
• Mikael Brannstrom, Erland Jungert:
  A Scalable Agent Architecture for a Dynamic Sensor Network. 268-283
  
• Antonio Brogi, Jean-Marie Jacquet, Isabelle Linden:
  On Modeling Coordination via Asynchronous Communication and Enhanced Matching. 284-309
  
• Nadia Busi, Roberto Gorrieri, Roberto Lucchi, Gianluigi Zavattaro:
  SecSpaces: a Data-driven Coordination Model for Environments Open to Untrusted Agents. 310-327
  
• John Field, Carlos A. Varela:
  Towards a Programming Model for Building Reliable Systems with Distributed State. 328-346
  
• Jean-Marie Jacquet, Lubos Brim, David Gilbert, Mojmír Kretínský:
  Coordination by Means of Synchronous and Asynchronous Communication in Concurrent Constraint Programming. 347-370
  
• Simona Orzan, Jaco van de Pol:
  Distribution of a Simple Shared Dataspace Architecture. 371-388
  
• David Safránek:
  SGCCS: A Graphical Language for Real-time Coordination. 389-404
  
• Ahmed Saleh, George R. Ribeiro-Justo, Stephen C. Winter:
  Non-Functional Oriented Dynamic Integration of Distributed Components. 405-418
  
• Juan Guillen Scholten, Farhad Arbab, Frank S. de Boer, Marcello M. Bonsangue:
  A Channel-based Coordination Model for Components. 419-438
  
• Antonio Vallecillo, Vasco Thudichum Vasconcelos, António Ravara:
  Typing the Behavior of Objects and Component Using Session Types. 439-456
  
• Mirko Viroli, Andrea Omicini:
  Coordination as a Service: Ontological and Formal Foundation. 457-482
  

Volume 68, Number 4, 2002

• Lubos Brim, Orna Grumberg:
  Preface. 483
  
• Moshe Y. Vardi:
  Model Checking: A Complexity-Theoretic Perspective (invited talk). 484
  
• Orna Grumberg:
  Different directions in parallel and distributed model checking (invited talk). 485
  
• Gerd Behrmann:
  A Performance Study of Distributed Timed Automata Reachability Analysis. 486-502
  
• Víctor A. Braberman, Alfredo Olivero, Fernando Schapachnik:
  ZEUS: A Distributed Timed Model-Checker Based on KRONOS. 503-522
  
• Stefan Blom, Simona Orzan:
  A Distributed Algorithm for Strong Bisimulation Reduction of State Spaces. 523-538
  
• Alexander Bell, Boudewijn R. Haverkort:
  Sequential and Distributed Model Checking of Petri Net Specifications. 539-558
  
• Lubos Brim, Jitka Crhova, Karen Yorav:
  Using Assumptions to Distribute CTL Model Checking. 559-574
  
• Tomás Brázdil, Ivana Cerná:
  Local Distributed Model Checking of RegCTL. 575-588
  
• Cornelia P. Inggs, Howard Barringer:
  Effective State Exploration for Model Checking on a Shared Memory Architecture. 605-620
  
• Marta Z. Kwiatkowska, Rashid Mehmood, Gethin Norman, David Parker:
  A Symbolic Out-of-Core Solution Method for Markov Models. 589-604
  

Volume 68, Number 5, 2002

• Alvaro E. Arenas:
  An Algebraic Approach for Compiling Real-Time Programs. 1-15
  
• Eugene Asarin, Catalin Dima:
  Balanced timed regular expressions. 16-33
  
• Mario Bravetti:
  An Integrated Approach for the Specification and Analysis of Stochastic Real-Time Systems. 34-64
  
• Mario Bravetti:
  Revisiting Interactive Markov Chains. 65-84
  
• Cécile Bui Thanh, Hanna Klaudel, Franck Pommereau:
  Petri nets with causal time for system verification. 85-100
  
• Friedger Müffke:
  Process Algebras as Specification Language. 101-115
  
• Maria Sorea:
  Bounded Model Checking for Timed Automata. 116-134
  
• Walter Vogler, Kim Larsen:
  Preface. 135-136
  

Volume 68, Number 6, 2002

• Hans Hüttel:
  Deciding Framed Bisimilarity. 1-18
  
• Jitka Stríbrná, Ivana Cerná:
  Modifications of Expansion Trees for Weak Bisimulation in BPA. 19-39
  
• Thomas Colcombet:
  Rewriting in the partial algebra of typed terms modulo AC. 40-54
  
• Chloe Rispal:
  The synchronized graphs trace the context-sensitive languages. 55-70
  
• Thierry Cachat:
  Uniform Solution of Parity Games on Prefix-Recognizable Graphs. 71-84
  
• Alain Finkel, Jean-François Raskin, Mathias Samuelides, Laurent Van Begin:
  Monotonic Extensions of Petri Nets: Forward and Backward Search Revisited. 85-106
  
• Antonín Kucera, Richard Mayr:
  Preface. 107-108
  

Last update Sat May 25 20:07:14 2013 CET by the DBLP Team — Data released under the ODC-BY 1.0 license — See also our legal information page