Pages that link to "Item:Q1091134"

The following pages link to Modeling concurrency with partial orders (Q1091134):

Displaying 50 items.

• Truly concurrent constraint programming (Q1605181) (← links)
• Axiomatizing the subsumption and subword preorders on finite and infinite partial words (Q1605337) (← links)
• Two equational theories of partial words (Q1643141) (← links)
• CCS with Hennessy's merge has no finite-equational axiomatization (Q1763725) (← links)
• Deciding global partial-order properties (Q1774565) (← links)
• Schedulers and finishers: on generating and filtering the behaviours of an event structure (Q1786565) (← links)
• Toward an algebraic theory of systems (Q1786609) (← links)
• Modular specification of process algebras (Q1802074) (← links)
• Algebra and theory of order-deterministic pomsets (Q1815430) (← links)
• Membership problems for regular and context-free trace languages (Q1824384) (← links)
• Molecular interaction. (Q1853559) (← links)
• Towards a language theory for infinite N-free pomsets. (Q1874399) (← links)
• Architectural CCS (Q1914040) (← links)
• Conflict vs causality in event structures (Q1996864) (← links)
• Relational structures for concurrent behaviours (Q1998872) (← links)
• Realisability of pomsets (Q2011200) (← links)
• Entropy conservation for comparison-based algorithms (Q2077296) (← links)
• A denotational semantics for SPARC TSO (Q2130595) (← links)
• Towards refinable choreographies (Q2141294) (← links)
• An abstract framework for choreographic testing (Q2239278) (← links)
• Classifying invariant structures of step traces (Q2424691) (← links)
• Labeled posets are universal (Q2472843) (← links)
• Determinism \(\to\) (event structure isomorphism \(=\) step sequence equivalence) (Q2638769) (← links)
• Interleaving set temporal logic (Q2639046) (← links)
• A compositional proof system on a category of labelled transition systems (Q2640340) (← links)
• Posets with interfaces as a model for concurrency (Q2672275) (← links)
• Building Bridges Between Sets of Partial Orders (Q2799169) (← links)
• A chart semantics for the pi-calculus (Q2864369) (← links)
• Modeling Quantitative Aspects of Concurrent Systems Using Weighted Petri Net Transducers (Q2941142) (← links)
• Independence Abstractions and Models of Concurrency (Q2961560) (← links)
• Bayesian Authentication: Quantifying Security of the Hancke-Kuhn Protocol (Q3178248) (← links)
• Fairness, Resources, and Separation (Q3178252) (← links)
• A Truly Concurrent Process Semantics over Multi-Pomsets of Consumable Resources (Q3178291) (← links)
• Schedulers and Finishers: On Generating the Behaviours of an Event Structure (Q3179396) (← links)
• Concurrent Kleene Algebra (Q3184688) (← links)
• (Q3385652) (← links)
• Approximating Behaviors in Embedded System Design (Q3507398) (← links)
• Twenty Years on: Reflections on the CEDISYS Project. Combining True Concurrency with Process Algebra (Q3507401) (← links)
• MSO Logic for Unambiguous Shared-Memory Systems (Q3533037) (← links)
• Semantics of Deterministic Shared-Memory Systems (Q3541010) (← links)
• UNAMBIGUOUS SHARED-MEMORY SYSTEMS (Q3586410) (← links)
• Event Correlation with Boxed Pomsets (Q3614848) (← links)
• Unifying Petri Net Semantics with Token Flows (Q3636837) (← links)
• Pomset Languages of Finite Step Transition Systems (Q3636841) (← links)
• Parity complexes (Q3994019) (← links)
• Temporal Structures (Q4006231) (← links)
• Step bisimulation is pomset equivalence on a parallel language without explicit internal choice (Q4279248) (← links)
• Behavioural equivalence for infinite systems — Partially decidable! (Q4633177) (← links)
• Nonfinite axiomatizability of the equational theory of shuffle (Q4645164) (← links)
• Causality for mobile processes (Q4645219) (← links)