(Enter summary)
Abstract: This paper presents a process algebra for distributed systems in which some actions may
take precedence over others. In contrast with existing approaches to priorities, our algebra
only allows actions to take priority over others at the same "location" and therefore captures
a notion of localized preemption. Using Park's and Milner's notion of strong bisimulation as
a basis, we develop a behavioral congruence and axiomatize it for finite processes; we also
derive an associated observational... (Update)
Context of citations to this paper: More
.... The problems arising from expressing priority have been previously studied in the context of prioritized process algebras, see e.g. [5, 10, 3] and [4] for a survey. One of the open questions in this context (see [4] is nding a complete axiomatization for observational...
...concept of priorities, although the introduction of priorities was a goal of the Committee initially. As regards Lotos NT, based on [BCL97, CLN97] we propose to attach priorities to internal actions (using the hide operator to specify priorities) in such a way that...
Cited by: More
Equivalence Semantics for Concurrency: Comparison and Application - Galpin (1998)
(Correct)
CCS with Priority Guards - Phillips
(Correct)
Towards a Second Generation of Formal Description.. - Garavel, Sighireanu (1998)
(Correct)
Similar documents (at the sentence level):
55.3%: A Process Algebra with Distributed Priorities - Cleaveland, Lüttgen, Natarajan (1996)
(Correct)
6.7%: An Algebraic Theory of Distributed Real-Time - Cleaveland, Lüttgen (1996)
(Correct)
Active bibliography (related documents): More All
0.3: Priorities for Modeling and Verifying Distributed Systems - Cleaveland, Lüttgen..
(Correct)
0.2: Priority as Extremal Probability - Smolka, Steffen (1995)
(Correct)
0.2: An Implementable Formal Language for Hard Real-Time Systems - Bradley (1995)
(Correct)
Similar documents based on text: More All
0.2: A Practical Approach to Implementing Real-Time Semantics - Bhat, Cleaveland, Lüttgen (1999)
(Correct)
0.1: Modeling and Verifying Distributed Systems Using.. - Cleaveland.. (1996)
(Correct)
0.1: Dynamic Priorities for Modeling Real-Time - Bhat, Cleaveland, Lüttgen (1996)
(Correct)
Related documents from co-citation: More All
13: Communication and Concurrency (context) - Milner - 1989
9: Priorities and Abstraction (context) - Natarajan, Christoff et al. - 1994
8: Communicating Sequential Processes (context) - Hoare - 1985
BibTeX entry: (Update)
R. Cleaveland, G. Luttgen, and V. Natarajan. A process algebra with distributed priorities. Technical Report TR-96-02, North Carolina State University, March 1996. http://citeseer.ist.psu.edu/article/cleaveland96proces.html More
@inproceedings{ cleaveland96process,
author = "Rance Cleaveland and Gerald Luttgen and V. Natarajan",
title = "A Process Algebra with Distributed Priorities",
booktitle = "International Conference on Concurrency Theory",
pages = "34-49",
year = "1996",
url = "citeseer.ist.psu.edu/article/cleaveland96proces.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 - 1980
322
volume 92 of Lecture Notes in Computer Science (context) - Milner, of et al. - 1980
299
Algebraic Theory of Processes (context) - Hennessy - 1988
254
Theoretical Computer Science (context) - Boudol, Castellani et al. - 1993
232
The Concurrency Workbench: A semantics-based tool for the ve..
- Cleaveland, Parrow et al. - 1993
201
Three partition refinement algorithms (context) - Paige, Tarjan - 1987
136
Information and Computation (context) - Kanellakis, Smolka et al. - 1990
116
volume 630 of Lecture Notes in Computer Science (context) - Cleaveland, CONCUR - 1992
89
volume 18 of Cambridge Tracts in Theoretical Computer Scienc.. (context) - Baeten, Weijland - 1990
61
weak bisimulation up to (context) - Sangiorgi, Milner et al.
57
Petri net models for algebraic theories of concurrency (context) - van Glabbeek, Vaandrager - 1987
47
The meaning of negative premises in transition system specif.. (context) - Bol, Groote
45
Syntax and defining equations for an interrupt mechanism (context) - Baeten, Bergstra et al. - 1986
24
CCS with priority choice (context) - Camilleri, Winskel - 1991
23
locations and asynchronous transition systems (context) - Mukund, Nielsen - 1992
21
Priority as extremal probability
- Smolka, Steffen
17
A parametric approach to localities (context) - Montanari, Yankelevich - 1992
15
Analyzing concurrent systems using the Concurrency Workbench (context) - Cleaveland - 1993
15
Formal Aspects of Computing (context) - Aceto, view et al. - 1994
12
Priorities and abstraction (context) - Natarajan, Christoff et al. - 1994
10
Petri net semantics of priority systems (context) - Best, Koutny - 1992
9
A process calculus with incomparable priorities (context) - Hansson, Orava - 1992
8
ACSR: An algebra of communicating shared resources with dens.. (context) - Br'emonde-Gr'egoire, Lee et al. - 1993
5
volume 458 of Lecture Notes in Computer Science (context) - Baeten, Klop et al. - 1990
5
CCSR: A calculus for communicating shared resources (context) - Gerber, Lee
4
Prioritized and Independent Actions in Distributed Computer .. (context) - Jensen - 1994
3
volume 510 of Lecture Notes in Computer Science (context) - Albert, Monien et al. - 1991
The graph only includes citing articles where the year of publication is known.
Documents on the same site (http://osl.csc.ncsu.edu/research/tech-reports/README.html): More
The Expected Size of the Sphere-of-Influence Graph - Dwyer (1995)
(Correct)
Affordances for Acting in Direct Manipulation Interfaces - Amant (1998)
(Correct)
HiPeR-l: A High Performance Reservation Protocol with.. - Sivaraman, Rouskas (1996)
(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