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)- Event Correlation with Boxed Pomsets
- Independence abstractions and models of concurrency
- A model of concurrency with fair merge and full recursion
- Fairness, resources, and separation
- A dynamic temporal logic for quality of service in choreographic models
- Labeled posets are universal
- Molecular interaction.
- Step traces
- Four domains for concurrency
- A partial ordering semantics for CCS
- Partial order behaviour and structure of Petri nets
- Mitigating covert channels based on analysis of the potential for communication
- Failures semantics based on interval semiwords is a congruence for refinement
- scientific article; zbMATH DE number 140261 (Why is no real title available?)
- Asynchronous cellular automata for pomsets
- Read-write causality
- A truly concurrent semantics for a process algebra using resource pomsets
- Reasoning about causality between distributed nonatomic events
- Petri nets and bisimulation
- Concurrent regular expressions and their relationship to Petri nets
- Event-based proof of the mutual exclusion property of Peterson's algorithm
- Causality for mobile processes
- Conflict vs causality in event structures
- Logical classification of distributed algorithms (Bakery algorithms as an example)
- Conflict vs causality in event structures
- Automatizing parametric reasoning on distributed concurrent systems
- Concurrency and atomicity
- Modular specification of process algebras
- On weighted Petri net transducers
- Pomset Languages of Finite Step Transition Systems
- A truly concurrent process semantics over multi-pomsets of consumable resources
- Unifying Petri Net Semantics with Token Flows
- A denotational semantics for SPARC TSO
- Branching pomsets: design, expressiveness and applications to choreographies
- Partial ordering models for concurrency can be defined operationally
- Rational mechanics and natural mathematics
- On the specification of elementary reactive behaviour
- Partial order aware concurrency sampling
- Architectural CCS
- Towards refinable choreographies
- Building bridges between sets of partial orders
- Category-theoretic approach to software systems design
- Non-interleaving semantics for mobile processes
- An abstract framework for choreographic testing
- Higher categories, strings, cubes and simplex equations
- Causality and true concurrency: A data-flow analysis of the Pi-Calculus
- scientific article; zbMATH DE number 3902007 (Why is no real title available?)
- Undecidability of partial order logics
- Concurrent Kleene algebra with tests and branching automata
- Compositional transformational design for concurrent programs
- Relational structures for concurrent behaviours
- Presenting interval pomsets with interfaces
- Compositional process semantics of Petri Boxes
- Truly concurrent constraint programming
- Towards a language theory for infinite N-free pomsets.
- ENFORCING CONCURRENT TEMPORAL BEHAVIORS
- Axiomatizing the subsumption and subword preorders on finite and infinite partial words
- The difference between splitting in \(n\) and \(n+1\)
- Concurrent Kleene algebra and its foundations
- Two equational theories of partial words
- Executability of scenarios in Petri nets
- Free shuffle algebras in language varieties
- Synchronous Kleene algebra
- Adding partial orders to linear temporal logic
- Temporal structures
- Chu spaces as a semantic bridge between linear logic and mathematics.
- Approximating Behaviors in Embedded System Design
- Twenty Years on: Reflections on the CEDISYS Project. Combining True Concurrency with Process Algebra
- Bayesian authentication: quantifying security of the Hancke-Kuhn protocol
- Sequent systems on undirected graphs
- Causal ambiguity and partial orders in event structures
- Deciding global partial-order properties
- scientific article; zbMATH DE number 40564 (Why is no real title available?)
- Step bisimulation is pomset equivalence on a parallel language without explicit internal choice
- Bisimulation, games, and logic
- CCS with Hennessy's merge has no finite-equational axiomatization
- The equational theory of pomsets
- A compositional proof system on a category of labelled transition systems
- Interleaving set temporal logic
- Executions: A new partial-order semantics of Petri nets
- Unambiguous shared-memory systems
- MSO Logic for Unambiguous Shared-Memory Systems
- Sculptures in concurrency
- Proving partial order properties
- Presheaf models for CCS-like languages
- A denotational semantics for SPARC TSO
- Models and logics for true concurrency.
- Schedulers and finishers: on generating and filtering the behaviours of an event structure
- Series-parallel languages and the bounded-width property
- A Nice labelling for tree-like event structures of degree 3
- Schedulers and finishers: on generating the behaviours of an event structure
- An algebra of concurrent non-deterministic processes
- Connectedness and synchronization
- Realisability of pomsets
- Membership problems for regular and context-free trace languages
- Languages of higher-dimensional automata
- Universal axioms for bisimulations
- Detecting causal relationships in distributed computations: In search of the holy grail
- On the mutual-exclusion problem -- a quest for minimal solutions
- On the homomorphism order of labeled posets
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)
