Antoni Mazurkiewicz. Concurrent program schemes and their interpretations. Technical Report Technical Report DAIMI PB 78, Aarhus University, 1977. Home/Search Document Not in Database Summary Related Articles Check |
This paper is cited in the following contexts:
First 50 documents Next 50
Confluence Problems for Trace Rewriting Systems - Lohrey (2001) (Correct)
....theory of free partially commutative monoids generalizes both, the theory of free monoids and the theory of free commutative monoids. In computer science, free partially commutative monoids are commonly called trace monoids and their elements are called traces. Both notions are due to Mazurkiewicz [20], who recognized traces as a model of concurrent processes. 14] gives an extensive overview about current research trends in trace theory. The relevance of trace theory for computer science can be explained as follows. Assume a nite alphabet . An element of the free monoid over , i.e. a ....
A. Mazurkiewicz. Concurrent program schemes and their interpretations. DAIMI Rep. PB 78, Aarhus University, Aarhus, 1977.
Four Equivalent Equivalences of Reductions - van Oostrom, de Vrijer (2002) (Correct)
....Owing to the tight connexion between permutation equivalence and concurrency, permutation equivalence appears in many guises in areas where concurrency is important. For instance, in trace theory the notion of Mazurkiewicz trace as a trace up to the order of independent actions was introduced in [29]. For another example, in transaction processing systems (TPSs: 12] concurrency control protocols must prevent interference by ensuring so called serialisability: a TPS should only accept a schedule if it is equivalent to some serial schedule. Roughly speaking, the notions of conflict and view ....
A. Mazurkiewicz. Concurrent program schemes and their interpretation. Technical Report DAIMI PB-78, Aarhus University, 1977.
Decidable First-Order Theories of One-Step Rewriting in Trace.. - Kuske, Lohrey (Correct)
....[57] This paper investigates the first order theory of the one step rewrite graphs of trace rewriting systems, which generalize semi Thue systems. Cartier and Foata [7] investigated the combinatorics of free partially commutative monoids that became later known as trace monoids. Mazurkiewicz [46] introduced them into computer science. They form a mathematically sound model for the concurrent behaviour of systems of high abstraction. Since trace monoids are a generalization of free monoids, it was tempting to extend the investigation of free monoids to free partially commutative monoids. ....
A. Mazurkiewicz. Concurrent program schemes and their interpretations. DAIMI Rep. PB 78, Aarhus University, Aarhus, 1977.
Solvability of Equations in Free Partially - Commutative Groups Is (2001) (Correct)
....then we obtain a PSPACE completeness result. Restricting ourselves to trace monoids we still obtain a better complexity result, as it was known previously. 1 Introduction Free partially commutative monoids (or trace monoids) serve as a basic algebraic tool for investigating concurrent systems, [15, 16]. Atomic actions are represented by letters and independency of actions is reflected by an independence relation on the alphabet. The independency defines a partial commutation. If each atomic action a has an inverse a, then, on the algebraic level, we switch from monoids to groups. This means ....
....that D is reflexive and symmetric and that (a; b) 2 D implies (a; b) 2 D for all a; b 2 Gamma . In particular, we have (a; a) 2 D for all a 2 Gamma . The free partially commutative monoid M ( Gamma; I) is defined by the quotient monoid Gamma =fab = ba j (a; b) 2 Ig. According to Mazurkiewicz [15] it is also called a trace monoid and its elements are traces. If the reference to ( Gamma; I) is clear, we also write M instead of M ( Gamma; I) The length jxj of a trace x is the length of any representing word. A letter a 2 Gamma is called minimal (maximal resp. in x, if we can write x = ay ....
A. Mazurkiewicz. Concurrent program schemes and their interpretations. DAIMI Rep. PB 78, Aarhus University, Aarhus, 1977.
Masarykova univerzita v Brn e - Rodov Edeck Fakulta (Correct)
....Processes (CSP) 22] or the ISO standard Formal Description Technique LOTOS. There were also proposed many different representations of behavioural semantics for these models of various levels of coarseness, e.g. labeled transition systems, Petri nets or event structures. In 1977 Mazurkiewicz [29] used free partially commutative monoids (often called trace monoids) for an intuitive and elegant coarse description of the behaviour of concurrent systems, and he showed that in this way the behaviour of elementary net systems (1 safe Petri nets) can be captured faithfully. In this approach one ....
A. Mazurkiewicz, Concurrent program schemes and their interpretations, DAIMI Rep. PB 78, Aarhus Univ., 1977.
Permutation Rewriting and Algorithmic Verification - Bouajjani, Muscholl, Touili (2001) (1 citation) (Correct)
.... 1 and 1 correspond respectively to upward and downward subword closed sets. For example, 1 is precisely the class SRE [2] for which it can be shown that inclusion can be checked in polynomial time. Related work: The notion of semi commutations was proposed in the late 70 s by Mazurkiewicz [13] for describing the semantics of 1 safe Petri nets. Problems related to closure of languages under semi commutations have been studied in the community of Mazurkiewicz trace theory (see e.g. chapter 12 in [8] for a survey) However, the problems we address here and our results are di erent: Our ....
A. Mazurkiewicz. Concurrent program schemes and their interpretations. DAIMI Rep. PB 78, Aarhus University, Aarhus, 1977.
Trace Semantics for Actor Systems - Vasconcelos, Tokoro (4 citations) (Correct)
....for Petri nets (e.g. 1, 5, 7] except for Meseguer s work [10] not much work on concurrent semantics for objects has been done. We propose a concurrent semantics for actor systems, based on the theory of traces [1, 5, 7] The theory of traces introduced in computer science by Mazurkiewicz [8] to describe the behavior of safe Petri nets views concurrent systems as a 1. a set of atomic actions X, together with 2. a relation I X Theta X specifying which actions can be performed independently or concurrently. This relation independence is assumed to be symmetric and ....
Antoni Mazurkiewicz. Concurrent program schemes and their interpretation. DAIMI Rept. PB 78, Aarhus University, Aarhus, 1977.
Modeling and Analysis of Timed Petri Nets Using Heaps of Pieces - Gaubert, Mairesse (1997) (2 citations) (Correct)
....transitions of the net can be read on the upper contour of a Tetris like heap of pieces, canonically associated to an (earliest) execution of the system. This representation theorem is best understood by comparison with the following existing approaches. 1. Trace languages. In the landmark paper [20], Mazurkiewicz observed that trace monoids (that is, free partially commutative monoids) and their subsets (trace languages) are the natural model of the untimed behavior of safe Petri nets. Trace monoids, in which certain (independent) letters commute, and others do not, allow us to identify the ....
....ng. This simple example shows that firing sequences, which provide a sequential description of the behavior, are not really adapted in the presence of concurrency. The problem of modeling concurrency in a more efficient way has long been considered. A classical approach, proposed by Mazurkiewicz [20], 21] uses the notion of trace monoid. For a general and recent reference on traces, see [13] DEFINITION III.4. Let T be an alphabet equipped with a reflexive symmetric relation called dependence relation and denoted by D. We denote by I the complement of D, called independence relation. The ....
A. Mazurkiewicz. Concurrent program schemes and their interpretations. Research report DAIMI Rep. PB-78, Aarhus Univ., 1977.
Methods for Computing fhe Concurrency Degree of Commutation.. - Saheb, Zemmari (2000) (1 citation) (Correct)
....connue pour le calculer. Ici, on introduit quelques nouvelles m#thodes pour une #valuation exacte de ce param#tre dans quelques cas, et une m#thode pour son approximation en g#n#ral. 1 Introduction Trace monoids were introduced by Mazurkiewicz in order to handle an algebraic study of concurrency [10]. the study has been developed and enriched by several authors [1] 3] 8] 9] 11] 12] Arqu#s and Fran#on proposed a measurement of parallelism, for concurrent processes based on the possibility of shuing words representing behaviors of processes. The approach allows some comparisons for ....
A. Mazurkiewicz, Concurrent Program Schemes and their Interpretations, DAIMI, BP78, Aarhus University, (1977).
Process Algebra with Action Dependencies - Rensink, Wehrheim (1999) (1 citation) (Correct)
.... information to allow action refinement within an interleaving model (under some assumptions that effectively require that the refinement of actions respects their dependencies) The idea of action dependencies regulating orderings has been suggested and inten sively studied by Mazurkiewicz [55, 56, 57] and others (see for instance [30] The basic concept in Mazurkiewicz work are traces, which are equivalence classes of sequences of actions, factorised by a permutation equivalence: in a sequence, adjacent independent actions may be commuted. System behaviour is described as a set of traces, ....
A. Mazurkiewicz. Concurrent program schemes and their interpretations. DAIMI Report PB-78, Aarhus University, 1977.
The Topology of Mazurkiewicz Traces - Kummetz, Kuske Self-citation (Mazurkiewicz) (Correct)
....of nite non trivial and of in nite connected components and on the number of isolated letters of the dependence alphabet. 1 Introduction Trace monoids were introduced by Cartier and Foata [3] who investigated combinatorial problems concerning the rearrangement of words, and by Mazurkiewicz [16], who was motivated to provide a mathematical model for concurrent systems. Since then trace theory has become a very popular topic, see the recent surveys [6, 7] Current a liation: 3SOFT GmbH, Frauenweiherstrae 14, D 91058 Erlangen, Germany. Corresponding author. This work was written ....
A. Mazurkiewicz. Concurrent program schemes and their interpretations. DAIMI Report PB-78, Aarhus University, Aarhus, 1977.
Logics for Mazurkiewicz Traces - Leucker (2002) (4 citations) Self-citation (Mazurkiewicz) (Correct)
....While the study of partially commutative monoids traces back to implementation. For example, we also call a protocol definition in some formal language an implementation rather than only its implementation in some low level programming language. Cartier and Foata [CF69] it was Mazurkiewicz [Maz77] who applied these structures for modeling concurrent systems. The exciting point on Mazurkiewicz traces is that only a single representative for each equivalence class might be employed for verifying a desired property. This is the insight underlying many of the partial order based verification ....
....all executions which we consider to be equivalent. Each of its paths represents a single observation. Every (maximal) path of the configuration graph is isomorphic to a linearization of the trace T , which will be defined in the next section. 3. 4 Traces and Words In its original formulation [Maz77] Mazurkiewicz introduced traces as certain equivalence classes of words, and this correspondence turns out to be essential for our developments here. While considering traces as partial orders reveals their correspondence to partial order executions within the application domain of concurrency, ....
A. Mazurkiewicz. Concurrent program schemes and their interpretations. DAIMI Rep. PB 78, Aarhus University, Aarhus, 1977.
Avoiding Causal Dependencies via Proof Irrelevance in a.. - Ley-Wild, Pfenning (2006) (Correct)
No context found.
Antoni Mazurkiewicz. Concurrent program schemes and their interpretations. Technical Report Technical Report DAIMI PB 78, Aarhus University, 1977.
Models for Data-Flow Sequential Processes - Josephs (2001) (Correct)
No context found.
A. Mazurkiewicz. Concurrent Program Schemes and their Interpretation. Technical Report DAIMI PB-78, Arhus University, Denmark, 1977.
Automatic Synthesis of Distributed Systems - Stefanescu (Correct)
No context found.
A. Mazurkiewicz. Concurrent program schemes and their interpretations. Technical Report DAIMI Rep. PB-78, Aarhus University, 1977.
Asynchronous Games 2 - The true concurrency of innocence - Mellies (2004) (1 citation) (Correct)
No context found.
A. Mazurkiewicz. Concurrent program schemes and their interpretations. Technical Report DAIMI PB 78, Aarhus University, 1977.
Complete Behavioural Testing - Two Extensions To (Correct)
No context found.
Mazurkiewicz, A (1977) Concurrent program schemes and their interpretations. Technical Report DAIMI Pb-78, Aarhus University, Denmark.
Decidability and Complexity Issues for Infinite-State Processes - Srba (2003) (Correct)
No context found.
A. Mazurkiewicz. Concurrent program schemes and their interpretations. DAIMI Rep. PB 78, Aarhus University, Aarhus, 1977.
On the Theory of One-Step Rewriting in Trace Monoids - Kuske, Lohrey (Correct)
No context found.
A. Mazurkiewicz. Concurrent program schemes and their interpretation. Technical report, DAIMI Report PB-78, Aarhus University, 1977.
On Concurrent Realization of Reactive Systems - And Their Morphisms (Correct)
No context found.
A. Mazurkiewicz. Concurrent program schemes and their interpretations. DAIMI PB--78, Arhus University, 1977.
Unknown - (Correct)
No context found.
A. Mazurkiewicz, Concurrent program schemes and their interpretations, DAIMI Rep. PB 78, Aarhus Univ., 1977.
Solvability of Equations in Free Partially - Commutative Groups Is (Correct)
No context found.
A. Mazurkiewicz. Concurrent program schemes and their interpretations. DAIMI Rep. PB 78, Aarhus University, Aarhus, 1977.
Determinants and Mobius - Functions In Trace (Correct)
No context found.
A. Mazurkiewicz, Concurrent program schemes and their interpretations, DAIMI Rep. PB 78, Aarhus University, 1977. 12
Code Problems on Traces - Volker Diekert Anca (1996) (2 citations) (Correct)
No context found.
A. Mazurkiewicz. Concurrent program schemes and their interpretations. DAIMI Rep. PB 78, Aarhus University, Aarhus, 1977.
A Product Version of Dynamic Linear Time Temporal Logic - Henriksen, Thiagarajan (1997) (1 citation) (Correct)
No context found.
Mazurkiewicz, A.: Concurrent program schemes and their interpretations. Technical report DAIMI PB-78, Department of Computer
First 50 documents Next 50
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