Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCID6th CONCUR 1995: Philadelphia, PA, USA
- Insup Lee, Scott A. Smolka:
CONCUR '95: Concurrency Theory, 6th International Conference, Philadelphia, PA, USA, August 21-24, 1995, Proceedings. Lecture Notes in Computer Science 962, Springer 1995, ISBN 3-540-60218-6
Invited Paper
- Colin Stirling:
Lokal Model Checking Games. 1-11
Model Checking I
- Mads Dam:
Compositional Proof Systems for Model Checking Infinite State Processes. 12-26 - François Laroussinie, Kim Guldstrand Larsen:
Compositional Model Checking of Real Time Systems. 27-41
Mobile Processes I
- Ugo Montanari, Marco Pistore
:
Checking Bisimilarity for Finitary pi-Calculus. 42-56 - Gian-Luigi Ferrari, Ugo Montanari, Paola Quaglia:
The Weak Late pi-Calculus Semantics as Observation Equivalence. 57-71
Invited Paper
- Bernhard Steffen, Andreas Claßen, Marion Klein, Jens Knoop, Tiziana Margaria:
The Fixpoint-Analysis Machine. 72-87
Mobile Processes II
- Huimin Lin:
Unique Fixpoint Induction for Mobile Processes. 88-102 - Xinxin Liu, David Walker:
A Polymorphic Type System for the Polyadic pi-calculus. 103-116
Process Theory
- Claudio Hermida, John Power:
Fibrational Control Structures. 117-129 - Flavio Corradini, Rocco De Nicola, Anna Labella:
Fully Abstract Models for Nondeterministic Regular Expressions. 130-144
True Concurrency
- Nadia Busi, Roberto Gorrieri:
A Petri Net Semantics for pi-Calculus. 145-159 - Arend Rensink:
A Complete Theory of Deterministic Event Structures. 160-174 - Mogens Nielsen, Lutz Priese, Vladimiro Sassone:
Characterizing Behavioural Congruences for Petri Nets. 175-189
Invited Paper
- Frits W. Vaandrager:
Verification of a Distributed Summation Algorithm. 190-203
Process Algebra I
- Jan Friso Groote, M. P. A. Sellink:
Confluence for Process Verification. 204-218 - Irek Ulidowski:
Axiomatisations of Weak Equivalences for De Simone Languages. 219-233
Probabilistic Automata
- Roberto Segala:
A Compositional Trace-Based Semantics for Probabilistic Automata. 234-248 - Manuel Núñez, David de Frutos-Escrig, Luis Fernando Llana Díaz:
Acceptance Trees for Probabilistic Processes. 249-263
Invited Paper
- David Harel:
Will I be Preety, Will I be Rich? Some Thoughts on Theory vs. Practice in Systems Engineering. 264-268
Real-Time Systems I
- Jeremy W. Bryans, Jim Davies, Steve A. Schneider:
Towards a denotational semantics for ET-LOTOS. 269-283 - Farn Wang:
Reachability Analysis at Procedure Level through Timing Coincidence. 284-298
Testing Semantics
- Walter Vogler:
Faster Asynchronous Systems. 299-312 - Ed Brinksma, Arend Rensink, Walter Vogler:
Fair Testing. 313-327
Invited Paper
- Dan Craigen:
Formal Methods Technology Transfer: Impediments and Innovation (Abstract). 328-332
Decidability Results
- Parosh Aziz Abdulla, Mats Kindahl:
Decidability of Simulation and Bisimulation between Lossy Channel Systems and Finite State Systems (Extended Abstract). 333-347 - Petr Jancar, Faron Moller:
Checking Regular Properties of Petri Nets. 348-362
Refinement Theory
- Marcello M. Bonsangue, Joost N. Kok, Erik P. de Vink:
Metric Predicate Transformers: Towards a Notion of Refinement for Concurrency. 363-377 - Michael Siegel:
A Refinement Theory that Supports both 'Decrease of Nondeterminism' and 'Increase of Parallelism'. 378-392
Invited Paper
- E. Allen Emerson:
Efficient Automation of Temporal Reasoning. 393-394
Model Checking II
- Edmund M. Clarke, Orna Grumberg, Somesh Jha:
Veryfying Parameterized Networks using Abstraction and Regular Languages. 395-407 - Orna Kupferman, Moshe Y. Vardi:
On the Complexity of Branching Modular Model Checking (Extended Abstract). 408-422
Linear-Time Logics
- Roope Kaivola:
Axiomatising Linear Time Mu-calculus. 423-437 - P. S. Thiagarajan:
A Trace Consistent Subset of PTL. 438-452
Invited Paper
- Gerard J. Holzmann:
Tutorial: Proving Properties of Concurrent System with SPIN. 453-455
Mobile Processes III
- Anna Philippou, David Walker:
On Sharing and Determinacy in Concurrent Systems. 456-470 - Simon Brock, Gerald Ostheimer:
Process Semantics of Graph Reduction. 471-485
Process Algebra II
- Matthew Hennessy, Julian Rathke:
Bisimulations for a Calculus of Broadcasting Systems. 486-500 - Pedro R. D'Argenio, Sjouke Mauw:
Delayed choice for process algebra with abstraction. 501-515
Real-Time Systems II
- Karlis Cerans:
CTR: A Calculus of Timed Refinement. 516-530 - Ahmed Bouajjani, Yassine Lakhnech:
Temporal Logic + Timed Automata: Expressiveness and Decidability. 531-545
a service of 
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 2024-04-25 20:48 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:
