Structure of concurrency
From MaRDI portal
Publication:685384
DOI10.1016/0304-3975(93)90238-OzbMATH Open0814.68061MaRDI QIDQ685384FDOQ685384
Recommendations
- scientific article; zbMATH DE number 194148
- scientific article; zbMATH DE number 4096791
- Relational structures model of concurrency
- scientific article; zbMATH DE number 17833
- Concurrency in synchronous systems
- Relational structures for concurrent behaviours
- Concurrent Programming
- scientific article; zbMATH DE number 42962
- Nebenläufige Programme
Cites Work
- scientific article; zbMATH DE number 4206024 (Why is no real title available?)
- scientific article; zbMATH DE number 3821120 (Why is no real title available?)
- scientific article; zbMATH DE number 3825182 (Why is no real title available?)
- scientific article; zbMATH DE number 3905854 (Why is no real title available?)
- scientific article; zbMATH DE number 4030999 (Why is no real title available?)
- scientific article; zbMATH DE number 4039251 (Why is no real title available?)
- scientific article; zbMATH DE number 3722109 (Why is no real title available?)
- scientific article; zbMATH DE number 3740749 (Why is no real title available?)
- scientific article; zbMATH DE number 3755835 (Why is no real title available?)
- scientific article; zbMATH DE number 3550662 (Why is no real title available?)
- scientific article; zbMATH DE number 4119655 (Why is no real title available?)
- A Characterization of Comparability Graphs and of Interval Graphs
- A calculus of communicating systems
- A formal semantics for concurrent systems with a priority relation
- A methodology for programming with concurrency: An informal presentation
- A resource-based prioritized bisimulation for real-time systems
- Betweenness, orders and interval graphs
- Calculi for synchrony and asynchrony
- Concurrent Machines
- Concurrent histories: a basis for observing distributed systems
- Incidence matrices and interval graphs
- Intransitive indifference with unequal indifference intervals
- Modeling concurrency with partial orders
- Notes on finite asynchronous automata
- On interprocess communication. I: Basic formalism
- Petri net semantics of priority systems
- Set theory. With an introduction to descriptive set theory. Translation of the original Polish edition. 2nd, completely revised ed
- Structure of concurrency
- Subset languages of Petri nets. I: The relationship to string languages and normal forms
- The mutual exclusion problem
- Theory of relations. Transl. from the French by P. Clote
Cited In (52)
- Relational structures model of concurrency
- Modelling concurrent behaviours by commutativity and weak causality relations
- 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
- Modeling interval order structures with partially commutative monoids
- On interval process semantics of Petri nets with inhibitor arcs
- Process semantics of general inhibitor nets
- Inevitability in diamond processes
- Concurrent systems and inevitability
- Concurrency: handling interference formally
- Synchronized composition of graph grammar productions
- Title not available (Why is no real title available?)
- Modeling concurrency with partial orders
- Relational structures for concurrent behaviours
- Simultaneity in event structures
- 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
- The mutex paradigm of concurrency
- A weak order approach to group ranking
- Non-atomic transition firing in contextual nets
- Myhill-Nerode theorem for higher-dimensional automata
- Title not available (Why is no real title available?)
- Interval semantics for Petri nets with inhibitor arcs
- Dynamic Partial Order Reduction Using Probe Sets
- Characterising concurrent histories
- 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
- Posets with interfaces as a model for concurrency
- Title not available (Why is no real title available?)
- Algebraic structure of step traces and interval traces
- Concurrency-preserving minimal process representation
- Generating Posets Beyond N
- A Myhill-Nerode theorem for higher-dimensional automata
- Paradigms of concurrency. Observations, behaviours and systems -- a Petri net view
- Contextual nets
- Solving recursive net equations
- Modeling concurrency with interval traces
- THE PHASE WEB PARADIGM
- Title not available (Why is no real title available?)
- Title not available (Why is no real title available?)
- Title not available (Why is no real title available?)
- Modelling concurrency with comtraces and generalized comtraces
- Structure of concurrency
- Classifying invariant structures of step traces
- Title not available (Why is no real title available?)
- 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)
