Modeling concurrency with partial orders
From MaRDI portal
Recommendations
Cites work
- scientific article; zbMATH DE number 3902007 (Why is no real title available?)
- scientific article; zbMATH DE number 3947615 (Why is no real title available?)
- scientific article; zbMATH DE number 3469994 (Why is no real title available?)
- scientific article; zbMATH DE number 3566181 (Why is no real title available?)
- scientific article; zbMATH DE number 3797702 (Why is no real title available?)
- Calculi for synchrony and asynchrony
- The logic of time. A model-theoretic investigation into the varieties of temporal ontology and temporal discourse
Cited in
(only showing first 100 items - show all)- Conflict vs causality in event structures
- Read-write causality
- scientific article; zbMATH DE number 1754584 (Why is no real title available?)
- Towards refinable choreographies
- The quest for equational axiomatizations of parallel composition: status and open problems
- Architectural CCS
- Branching pomsets: design, expressiveness and applications to choreographies
- A chart semantics for the pi-calculus
- On weighted Petri net transducers
- On relating concurrency and nondeterminism
- Reasoning about causality between distributed nonatomic events
- Deciding global partial-order properties
- Bisimulation, games, and logic
- Asynchronous cellular automata for pomsets without auto-concurrency
- Step bisimulation is pomset equivalence on a parallel language without explicit internal choice
- Bayesian authentication: quantifying security of the Hancke-Kuhn protocol
- On the specification of elementary reactive behaviour
- Building bridges between sets of partial orders
- Classifying invariant structures of step traces
- Partial-order model checking: A guide for the perplexed
- MSO Logic for Unambiguous Shared-Memory Systems
- An Analytic Propositional Proof System on Graphs
- scientific article; zbMATH DE number 3911691 (Why is no real title available?)
- Processes of timed Petri nets
- On continuous time agents
- Schedulers and finishers: on generating the behaviours of an event structure
- Entropy conservation for comparison-based algorithms
- ENFORCING CONCURRENT TEMPORAL BEHAVIORS
- Event Correlation with Boxed Pomsets
- Temporal structures
- Efficient rewriting in cograph trace monoids
- Molecular interaction.
- Modular specification of process algebras
- Languages of higher-dimensional automata
- Independence abstractions and models of concurrency
- Compositional process semantics of Petri Boxes
- Pomset Languages of Finite Step Transition Systems
- Unifying Petri Net Semantics with Token Flows
- Unambiguous shared-memory systems
- scientific article; zbMATH DE number 7454921 (Why is no real title available?)
- Partial order aware concurrency sampling
- A truly concurrent process semantics over multi-pomsets of consumable resources
- scientific article; zbMATH DE number 140261 (Why is no real title available?)
- Nonfinite axiomatizability of the equational theory of shuffle
- An algebra of concurrent non-deterministic processes
- Connectedness and synchronization
- On the mutual-exclusion problem -- a quest for minimal solutions
- Partial ordering models for concurrency can be defined operationally
- A truly concurrent semantics for a process algebra using resource pomsets
- Schedulers and finishers: on generating and filtering the behaviours of an event structure
- Causal ambiguity and partial orders in event structures
- Posets with interfaces as a model for concurrency
- Token trail semantics -- modeling behavior of Petri nets with labeled Petri nets
- Approximating Behaviors in Embedded System Design
- Twenty Years on: Reflections on the CEDISYS Project. Combining True Concurrency with Process Algebra
- An abstract framework for choreographic testing
- Fairness, resources, and separation
- Two equational theories of partial words
- Models and logics for true concurrency.
- A denotational semantics for SPARC TSO
- Branching Pomsets for Choreographies
- Behavioural equivalence for infinite systems -- partially decidable!
- Refinement of events in the development of real-time distributed systems
- Conflict vs causality in event structures
- Semantics of Deterministic Shared-Memory Systems
- Failures semantics based on interval semiwords is a congruence for refinement
- Executability of scenarios in Petri nets
- Executions: A new partial-order semantics of Petri nets
- Membership problems for regular and context-free trace languages
- Concurrent regular expressions and their relationship to Petri nets
- Event-based proof of the mutual exclusion property of Peterson's algorithm
- A partial ordering semantics for CCS
- Partial order behaviour and structure of Petri nets
- Labeled posets are universal
- Series-parallel languages and the bounded-width property
- Asynchronous cellular automata for pomsets
- Chu spaces as a semantic bridge between linear logic and mathematics.
- scientific article; zbMATH DE number 3902007 (Why is no real title available?)
- Relational structures for concurrent behaviours
- Sculptures in concurrency
- Higher categories, strings, cubes and simplex equations
- On relating some models for concurrency
- Temporal Structures
- Adding partial orders to linear temporal logic
- Causality for mobile processes
- Branching versus linear logics yet again
- A model of concurrency with fair merge and full recursion
- Causal message sequence charts
- Some behavioural aspects of net theory
- A compositional proof system on a category of labelled transition systems
- Interleaving set temporal logic
- Logical classification of distributed algorithms (Bakery algorithms as an example)
- Modeling quantitative aspects of concurrent systems using weighted Petri net transducers
- CCS with Hennessy's merge has no finite-equational axiomatization
- Petri nets and bisimulation
- On interprocess communication and the implementation of multi-writer atomic registers
- Modelling knowledge and action in distributed systems
- On-the-fly analysis of distributed computations
- Universal axioms for bisimulations
- Presheaf models for CCS-like languages
This page was built for publication: Modeling concurrency with partial orders
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1091134)
