Structure of concurrency
From MaRDI portal
Publication:685384
DOI10.1016/0304-3975(93)90238-OzbMATH Open0814.68061MaRDI QIDQ685384FDOQ685384
Maciej Koutny, Ryszard Janicki
Publication date: 17 October 1993
Published in: Theoretical Computer Science (Search for Journal in Brave)
Recommendations
Cites Work
- Theory of relations. Transl. from the French by P. Clote
- Incidence matrices and interval graphs
- Title not available (Why is that?)
- Concurrent Machines
- Title not available (Why is that?)
- Calculi for synchrony and asynchrony
- On interprocess communication. I: Basic formalism
- Modeling concurrency with partial orders
- Intransitive indifference with unequal indifference intervals
- Title not available (Why is that?)
- A Characterization of Comparability Graphs and of Interval Graphs
- A calculus of communicating systems
- Set theory. With an introduction to descriptive set theory. Translation of the original Polish edition. 2nd, completely revised ed
- Title not available (Why is that?)
- Notes on finite asynchronous automata
- Title not available (Why is that?)
- Betweenness, orders and interval graphs
- Title not available (Why is that?)
- Petri net semantics of priority systems
- A formal semantics for concurrent systems with a priority relation
- Concurrent histories: a basis for observing distributed systems
- The mutual exclusion problem
- Structure of concurrency
- A methodology for programming with concurrency: An informal presentation
- Subset languages of Petri nets. I: The relationship to string languages and normal forms
- Title not available (Why is that?)
- A resource-based prioritized bisimulation for real-time systems
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
Cited In (45)
- Relational structures model of concurrency
- Operational and denotational semantics for the box algebra
- Interval traces with mutex relation
- Concurrency in Boolean networks
- On Interval Semantics of Inhibitor and Activator Nets
- Inevitability in concurrent systems
- Process semantics of general inhibitor nets
- Inevitability in diamond processes
- Concurrent systems and inevitability
- Algebraic Structure of Step Traces and Interval Traces
- Concurrency: handling interference formally
- Synchronized composition of graph grammar productions
- Title not available (Why is that?)
- Modeling concurrency with partial orders
- Relational structures for concurrent behaviours
- On-line computations of the ideal lattice of posets
- Causal ambiguity and partial orders in event structures
- Modelling Concurrency with Quotient Monoids
- Concurrent graph and term graph rewriting
- On Interval Process Semantics of Petri Nets with Inhibitor Arcs
- A weak order approach to group ranking
- Myhill-Nerode theorem for higher-dimensional automata
- Title not available (Why is that?)
- Interval semantics for Petri nets with inhibitor arcs
- Dynamic Partial Order Reduction Using Probe Sets
- Languages of higher-dimensional automata
- Token trail semantics -- modeling behavior of Petri nets with labeled Petri nets
- Contextual Petri nets, asymmetric event structures, and processes
- Title not available (Why is that?)
- Generating Posets Beyond N
- Non-atomic Transition Firing in Contextual Nets
- The Mutex Paradigm of Concurrency
- A Myhill-Nerode theorem for higher-dimensional automata
- Contextual nets
- Solving recursive net equations
- Modeling concurrency with interval traces
- THE PHASE WEB PARADIGM
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Modelling concurrency with comtraces and generalized comtraces
- Structure of concurrency
- Classifying invariant structures of step traces
- Title not available (Why is that?)
- Step traces
This page was built for publication: Structure of concurrency
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q685384)
