Hans Hüttel, Sandeep Shukla  Home/Search
Context
Related
| cs.auc.dk/~hans/Pu...mplexitysurvey.ps Cached: PS.gz PS PDF This document uses CoBlitz to cache paper downloads. If your firewall is blocking outgoing connections to port 3125, you can use these links to download local copies.
Image Update HelpPS.gz PS PDF From: cs.auc.dk/~hans/Publicatio...pubs (more) (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: this paper, we shall consider the equivalences that have come out of the study of interleaving semantics in the context of process calculi in the tradition of CCS [Mil80] and CSP [Hoa84]. Most of these preorders and equivalences first arose in the literature of comparative concurrency semantics [vG90a; BIM90; GV92]. In this particular area of concurrency semantics, the main emphasis is on full abstraction (Update)
Similar documents (at the sentence level):
71.1%: On the Complexity of Deciding Behavioural Equivalences and.. - Hüttel, al. (1996) (Correct)
6.1%: Undecidable Equivalences for Basic Process Algebra - Groote, Hüttel (1991) (Correct)
Active bibliography (related documents): More All
1.7: The Polynomial Time Decidability of Simulation.. - Shukla.. (Correct)
1.1: Undecidable Equivalences for Basic Parallel Processes - Hüttel (1993) (Correct)
0.4: Decidability and Complexity Issues for Infinite-State Processes - Srba (2003) (Correct)
Similar documents based on text: More All
1.3: Bisimilarity is Decidable in the Union of Normed BPA and .. - Cerna, Kretinsky, Kucera (Correct)
0.5: Precongruence Formats for Decorated Trace Preorders - Bloom, Fokkink, van Glabbeek (2000) (Correct)
0.5: Compositional Testing Preorders for Probabilistic Processes - Jonsson, Yi (1995) (Correct)
BibTeX entry: (Update)
@misc{ ttel-complexity,
author = "Hans Hüttel and Sandeep Shukla",
title = "The Complexity of Deciding Behavioural Equivalences and Preorders",
url = "citeseer.ist.psu.edu/231080.html" }
Citations (may not include all citations):906 A structural approach to operational semantics - Plotkin - 1981
502 Concurrency and automata on infinite sequences (context) - Park - 1981
247 Bisimulation through probabilistic testing (context) - Larsen, Skou - 1989
231 A theory of communicating sequential processes (context) - Brookes, Hoare et al. - 1984
121 Bisimulation can't be traced (context) - Bloom, Istrail et al. - 1990
97 Limits to parallel computation: P-completeness theory - Greenlaw, Hoover et al. - 1995
95 The linear time -- branching time spectrum (context) - van Glabbeek - 1990
95 The linear time - branching time spectrum (context) - van Glabbeek - 1990
93 A Complete Inference System for a Class of Regular Behaviour.. (context) - Milner - 1984
78 Specification-oriented semantics for communicating processes (context) - Olderog, Hoare - 1986
78 Modal logics for communicating systems (context) - Stirling - 1987
76 Principles of database and knowledge base systems : Volume (context) - Ullman - 1988
65 Computing simulations on finite and infinite graphs - Henzinger, Henzinger et al. - 1995
60 Modal and temporal logics for processes - Stirling - 1993
49 Actions speak louder than words: Proving bisimilarity for co.. - Huttel, Stirling - 1991
45 Undecidable Equivalences for Basic Process Algebra Informati.. - Groote, Huttel - 1994
44 Theoretical Computer Science (context) - Philips - 1987
34 A lattice theoretic fixpoint theorem and its applications (context) - Tarski - 1955
19 An Elementary Bisimulation Decision Procedure for Arbitrary .. - Burkart, Caucal et al. - 1995
18 A Polynomial-Time Algorithm for Deciding Bisimulation Equiva.. - Hirshfeld, Jerrum et al. - 1996
16 Theoretical Informatics and Applications (context) - Caucal, de graphes - 1990
15 On deciding readiness and failure equivalences for processes (context) - Huynh, Tian - 1990
13 Decidability Results in Automata and Process Theory In G (context) - Hirshfeld, Moller - 1994
12 Readies and failures in the algebra of communicating process.. (context) - Bergstra, Klop et al. - 1988
10 Characteristic formulae for ccs with divergence (context) - Steffen - 1989
9 A Polynomial-Time Algorithm for Deciding Equivalence of Norm.. (context) - Hirshfeld, Jerrum et al. - 1994
8 Behavioural Equivalences and Infinite Transition Graphs Ph (context) - Huttel - 1991
7 Parallel complexity in the design and analysis of concurrent.. (context) - Alvarez, Balcazar et al. - 1991
5 Communication and Concurrency Prentice-Hall International (context) - Milner - 1989
4 Department of Mathematics and Computer Science (context) - Liu, Decomposition et al. - 1992
4 Hopcroft Simple Deterministic Languages (context) - Korenjak - 1966
4 A Calculus of Communicating Systems Springer-Verlag LNCS (context) - Milner - 1980
4 Tenth Annual Symposium on Theory of Computing (context) - Schaefer, of et al. - 1978
3 Verification of technical properties of concurrent systems (context) - Andersen - 1993
2 REX Workshop on Real Time systems (context) - Lynch, Vaandrager et al. - 1991
2 Department of Computer Science (context) - Shukla, Rosenkrantz et al. - 1995
2 A short proof of the decidibility of bisimulation for normed.. (context) - Groote - 1992
2 Bisimilarity is decidable for all context-free processes (context) - Christensen, Huttel et al. - 1992
1 Local model checking in the modal mu-calculus (context) - Complexity, Behavioural et al. - 1991
Documents on the same site (http://www.cs.auc.dk/~hans/Publications/pubs.html): More
Undecidable Equivalences for Basic Parallel Processes - Hüttel (1993) (Correct)
Relating Semantic Models for the Object Calculus - Aceto, Hüttel.. (1997) (Correct)
Silence is Golden: Branching Bisimilarity is - Hüttel (1992) (Correct)
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC