Vaughan Pratt  Home/Search
Context Related
| stanford.edu/pub/ijpp.ps.gz laas.fr/~fanchon/pratt.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: stanford.edu/abstracts (more) (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: Concurrency has been expressed variously in terms of formal languages (typically via the shuffle operator), partial orders, and temporal logic, inter alia. In this paper we extract from these three approaches a single hybrid approach having a rich language that mixes algebra and logic and having a natural class of models of concurrent processes. The heart of the approach is a notion of partial string derived from the view of a string as a linearly ordered multiset by relaxing the linearity... (Update)
Context of citations to this paper: More
.... are many other traits that distinguish models of computation, including: levels of abstraction, partial orders models (e.g. POMSETS [11] and Mazurkiewicz Traces [10] vs total orders, action based vs value based, different styles of computation, communication and...
...a parallel composition operation. The corresponding notion of behaviour is that of N free (labelled, nite) posets also known as pomsets [21]. Under certain conditions (of bounded parallel width, de ned later) recognizable sp languages were shown to be equal to those de ned by...
Cited by: More
Unknown - Mobile Agent Based (2001) (Correct)
The Algebraic Structure of Petri Nets - Sassone (2000) (Correct)
Series-Parallel Languages and 1-Safe Nets - Lodaya, Ranganayakulu, Rangarajan (Correct)
Active bibliography (related documents): More All
0.6: Metric Process Models - Crew (1992) (Correct)
0.2: Chu spaces: Complementarity and Uncertainty in Rational Mechanics - Pratt (1994) (Correct)
0.2: Parsing Partially Ordered Multisets - Basten (1997) (Correct)
Similar documents based on text: More All
0.2: Deterministic Behavioural Models for Concurrency.. - Sassone, Nielsen, Winskel (1993) (Correct)
0.2: Deterministic Pomsets - Rensink (1994) (Correct)
0.2: A Syntactic Congruence for the Recognizability of Pomset Languages - Fanchon (1999) (Correct)
Related documents from co-citation: More All
16: Communication and Concurrency (context) - Milner - 1989
15: Presheaf models for concurrency - Cattani, Winskel - 1997
11: On partial languages (context) - Grabowski - 1981
BibTeX entry: (Update)
V. Pratt. Modelling Concurrency with Partial Orders. International Journal of Parallel Programming, n. 15, 1986. http://citeseer.ist.psu.edu/pratt86modelling.html More
@article{ pratt86modelling,
author = "Vaughan R. Pratt",
title = "Modelling concurrency with partial orders",
journal = "International Journal of Parallel Programming",
volume = "15",
number = "1",
pages = "33--71",
year = "1986",
url = "citeseer.ist.psu.edu/pratt86modelling.html" }
Citations (may not include all citations):302 The Semantics of a Simple Language for Parallel Programming (context) - Kahn - 1974
168 Petri Nets: An Introduction (context) - Reisig - 1985
163 the Temporal Analysis of Fairness (context) - Gabbay, Pnueli et al. - 1980
107 Coroutines and Networks of Parallel Processes (context) - Kahn, MacQueen - 1977
78 Scenarios: A Model of Non-Determinate Computation (context) - Brock, Ackerman - 1981
64 Calculi for Synchrony and Asynchrony (context) - Milner - 1983
62 DEC Systems Research Center (context) - Lamport - 1985
35 The Logic of Time (context) - Van Benthem - 1983
27 the Composition of Processes (context) - Pratt - 1982
26 University of Edinburgh (context) - Winskel, Events et al. - 1980
18 th IEEE Symposium on Foundations of Computer Science (context) - Pnueli - 1977
17 The Pomset Model of Parallel Processes: Unifying the Tempora.. (context) - Pratt - 1984
17 Semantics of Communicating Parallel Processes (context) - Greif - 1975
14 The Natural Philosophy of Time (context) - Whitrow - 1980
9 Categories of Models for Concurrency (context) - Winskel - 1984
8 A New Definition of Morphism on Petri Nets (context) - Winskel - 1984
7 Some Constructions for Order-Theoretic Models of Concurrency (context) - Pratt - 1985
5 Partial Orders and the Axiomatic Theory of Shuffle (context) - Gischer - 1984
2 A Temporal Logic to Reason about Partially Ordered Computati.. (context) - Pinter - 1984
1 Outline of a Sheaf-theoretic Approach to Concurrency (context) - Monteiro - 1986
1 Logic Designers Toss Out the Clock (context) - Barney - 1985
1 Final Report on the Foundational Part of the Project BEGRUND (context) - Best, Fernandez et al. - 1985
1 Two-Way Channel with Disconnect (context) - Pratt - 1983
1 on Mathematical Foundations of Computer Science (context) - Traces, Graphs et al. - 1984
The graph only includes citing articles where the year of publication is known.
Documents on the same site (http://boole.stanford.edu/abstracts.html): More
Origins of the Calculus of Binary Relations - Pratt (1992) (Correct)
Branching Bisimulation as a Tool in the Analysis of Weak.. - van Glabbeek (1995) (Correct)
Action Logic and Pure Induction - Pratt (1991) (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