Arend Rensink, Heike Wehrheim  Home/Search
Context Related
| ub.utwente.nl/webdocs/ct...00000010.pdf 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: wwwhome.cs.utwente...publications (more) (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: Process algebras are a frequently used tool for the specification and verification of distributed reactive systems. In process algebras, actions are used to denote the basic entities of systems. In general, actions are just abstract names with no particular interpretation. The semantics of a system description, given in form of a process algebra term, is not influenced by the choice of names. (Update)
Context of citations to this paper: More
...imagine a client behaving in this way, if the system on which it is running has a form of weak sequential 25 composition (see, e.e. [55, 56]) that allows to invoke a second action (b in this example) after the first (a) has started but before it has terminated. Rather...
Cited by: More
An Algebraic Approach to Fault Tolerant Distributed Computing - Fuzzati (2004) (Correct)
Action Contraction Using Coupled Simulation - Rensink (2000) (Correct)
Active bibliography (related documents): More All
2.9: Refinement of Actions and Equivalence Notions for Concurrent .. - van Glabbeek, Goltz (1998) (Correct)
2.1: Vertical Implementation - Rensink, Gorrieri (2000) (Correct)
2.0: Dependency-Based Action Refinement - Rensink, Wehrheim (1997) (Correct)
Similar documents based on text: More All
0.5: An Algebraic Semantics for Message Sequence Chart Documents - Gehrke, Huhn, Rensink.. (1998) (Correct)
0.4: Modelling Causality via Action Dependencies in Branching Time .. - Goltz, Wehrheim (1996) (Correct)
0.4: Weak Sequential Composition in Process Algebras - Rensink, Wehrheim (1994) (Correct)
Related documents from co-citation: More All
3: Weak Sequential Composition (context) - Rensink, Wehrheim - 1994
3: Theoretical Computer Science (context) - Hennessy, Lin - 1995
3: Lecture Notes in Computer Science (context) - Milner, of et al. - 1980
BibTeX entry: (Update)
A. Rensink and H. Wehrheim. Process algebra with action dependencies. CTIT Technical Report 99--02, University of Twente, 1999. To appear in Acta Informatica. http://citeseer.ist.psu.edu/rensink99process.html More
@article{ rensink01process,
author = "Arend Rensink and Heike Wehrheim",
title = "Process algebra with action dependencies",
journal = "Acta Informatica",
volume = "38",
number = "3",
month = "????",
pages = "155--234",
year = "2001",
url = "citeseer.ist.psu.edu/rensink99process.html" }
Citations (may not include all citations):2732 Communicating Sequential Processes (context) - Hoare - 1985
1933 Communication and Concurrency (context) - Milner - 1989
906 A structural approach to operational semantics - Plotkin - 1981
502 Concurrency and automata on infinite sequences (context) - Park - 1981
407 Introduction to the ISO specification language LOTOS (context) - Bolognesi, Brinksma - 1987
231 A theory of communicating sequential processes (context) - Brookes, Hoare et al. - 1984
182 Structured operational semantics and bisimulation as a congr.. (context) - Groote, Vaandrager - 1992
155 Algebra of communicating processes with abstraction (context) - Bergstra, Klop - 1985
139 An introduction to event structures (context) - Winskel
139 Cambridge University Press (context) - Baeten, Weijland - 1990
123 A congruence theorem for structured operational semantics wi.. - Verhoef
123 A congruence theorem for structured operational semantics wi.. - Baeten, Verhoef
121 Bisimulation can't be traced (context) - Bloom, Istrail et al. - 1995
116 volume 630 of Lecture Notes in Computer Science (context) - Cleaveland, Concur - 1992
92 Concurrent program schemes and their interpretations (context) - Mazurkiewicz - 1977
86 Basic notions of trace theory (context) - Mazurkiewicz
84 Transition system specifications with negative premises (context) - Groote - 1993
65 World Scientific (context) - Diekert, Rozenberg et al. - 1995
64 Turning SOS rules into equations - Aceto, Bloom et al. - 1994
61 weak bisimulation up to (context) - Milner, Sangiorgi et al.
45 A theory of processes with localities (context) - Boudol, Castellani et al. - 1994
45 Towards action-refinement (context) - Aceto, Hennessy - 1993
37 International Standard - processing, -- et al. - 1989
36 Higher-level synchronising devices in Meije-SCCS (context) - De Simone - 1985
35 High-level Message Sequence Charts - Mauw, Reniers - 1997
34 Modelling nondeterministic concurrent processes with event s.. (context) - Loogen, Goltz - 1991
33 Decomposition of distributed programs into commu- nication c.. (context) - Elrad, Francez - 1982
29 Adding action refinement to a finite process algebra (context) - Aceto, Hennessy - 1994
26 Failures semantics based on interval semiwords is a congruen.. (context) - Vogler - 1991
25 A partial ordering semantics for CCS (context) - Degano, De Nicola et al. - 1991
23 Actions systems and action refinement in the development of .. (context) - Janssen, Poel et al. - 1991
23 A conservative look at operational semantics with variable b.. - Fokkink, Verhoef - 1998
22 Bisimulation and action refinement (context) - Vogler - 1993
22 Bisimilarity of open terms - Rensink - 1997
20 Weak sequential composition (context) - Rensink, Wehrheim
20 Fully abstract models for a process language with refinement (context) - Nielsen, Engberg et al.
17 Models and Methods for Action Refinement (context) - Rensink - 1993
15 Formal Aspects of Computing (context) - Aceto, view et al. - 1994
15 Refining interfaces of communicating systems (context) - Brinksma, Jonsson et al. - 1991
15 Testing equivalences for Petri nets with action refinement - Jategaonkar, Meyer
13 A causal operational semantics of action refinement (context) - Degano, Gorrieri - 1995
12 An Algebra for Process Creation (context) - Baeten, Vaandrager - 1992
11 Axiomatising ST bisimulation equivalence - Busi, van Glabbeek et al.
10 Comparing syntactic and semantic action refinement (context) - Goltz, Gorrieri et al. - 1996
10 volume 715 of Lecture Notes in Computer Science (context) - Best, Concur - 1993
10 Posets for configurations - Rensink
10 Methodological aspects of action refinement - Rensink
9 Parametric action refinement - Wehrheim - 1993
9 From sequential layers to distributed processes (context) - Janssen, Zwiers - 1992
9 Refinement of actions in causality based mod- els (context) - van Glabbeek, Goltz - 1990
8 A categorical view of process refine- ment (context) - Degano, Gorrieri et al. - 1992
8 Partial Order Methods in Verification (context) - Peled, Pratt et al. - 1997
7 vol- ume 1119 of Lecture Notes in Computer Science (context) - Montanari, Sassone et al. - 1996
7 An event-based SOS for a language with refinement - Rensink - 1995
7 Action refinement and property inheritance in systems of seq.. (context) - Huhn
7 An algebraic semantics for message sequence chart documents - Gehrke, Huhn et al. - 1998
7 The meaning of negative premises in transition system specif.. - van Glabbeek - 1995
7 interleaving: An instructive example (context) - Castellano, De Michelis et al. - 1987
6 Refinement of actions in event structures and causal trees (context) - Darondeau, Degano - 1993
6 Action Refinement as an Implementation Relation - Rensink, Gorrieri et al. - 1998
6 General refinement and recursion opera- tors for the Petri b.. (context) - Best, Devillers et al. - 1993
5 Refinement of actions and equivalence notions for concurrent.. - van Glabbeek, Goltz - 1998
5 the concatenation of infinite traces (context) - Diekert - 1993
4 Centre for Mathematics and Computer Science (context) - Vaandrager, for et al. - 1993
4 Modular completeness for communication closed layers (context) - Fokkinga, Poel et al.
4 Branching Time and Partial Order in Logics and Models for Co.. (context) - de Bakker, de Roever et al. - 1989
4 volume A-56 of IFIP Transactions (context) - Olderog, Concepts et al. - 1994
4 Layering and action refinement for timed systems (context) - Zwiers - 1991
3 Dependency-based action refinement - Rensink, Wehrheim - 1997
3 Modelling a simple communication protocol in a lan- guage wi.. (context) - Goltz, GStz - 1991
3 Refinements in interworkings - Mauw, Reniers
3 Abstraction and empty process (context) - Baeten, van Glabbeek - 1989
3 Protocol design by layered decomposition: A com- positional .. (context) - Janssen, Zwiers - 1992
2 Modeling concurrency in partial orders and nonlinear transit.. (context) - Gaifman
2 volume 836 of Lecture Notes in Computer Science (context) - Jonsson, Parrow et al. - 1994
2 Information and Computation (context) - de Bakker, Zucker et al. - 1982
2 the Hierarchical Design of Distributed Systems (context) - Huhn - 1997
1 Lecutre Notes in Computer Science (context) - Mazurkiewicz, histories et al. - 1984
1 Theoretical Cornput (context) - Badouel, Darondeau et al. - 1991
1 A domain for concurrent termination: A general- ization of M.. - Diekert, Gastin - 1995
Documents on the same site (http://wwwhome.cs.utwente.nl/~rensink/publications.html): More
A Typed Functional Calculus with State - Rensink (1997) (Correct)
Weak Sequential Composition in Process Algebras - Rensink, Wehrheim (1994) (Correct)
Dependency-Based Action Refinement - Rensink, Wehrheim (1997) (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