Pages that link to "Item:Q1091134"
From MaRDI portal
The following pages link to Modeling concurrency with partial orders (Q1091134):
Displaying 50 items.
- Event-based proof of the mutual exclusion property of Peterson's algorithm (Q271900) (← links)
- Category-theoretic approach to software systems design (Q289772) (← links)
- Undecidability of partial order logics (Q294640) (← links)
- Concurrent Kleene algebra with tests and branching automata (Q299205) (← links)
- Mitigating covert channels based on analysis of the potential for communication (Q530557) (← links)
- Logical classification of distributed algorithms (Bakery algorithms as an example) (Q541220) (← links)
- Concurrent Kleene algebra and its foundations (Q549679) (← links)
- On the homomorphism order of labeled posets (Q634750) (← links)
- Free shuffle algebras in language varieties (Q671351) (← links)
- Denotational linear time semantics and sequential composition (Q671406) (← links)
- On interprocess communication and the implementation of multi-writer atomic registers (Q672706) (← links)
- Petri nets and bisimulation (Q672873) (← links)
- On-the-fly analysis of distributed computations (Q673006) (← links)
- Structure of concurrency (Q685384) (← links)
- Bisimulation and action refinement (Q685407) (← links)
- Universal axioms for bisimulations (Q685411) (← links)
- Synchronous Kleene algebra (Q710676) (← links)
- Failures semantics based on interval semiwords is a congruence for refinement (Q757073) (← links)
- A model of concurrency with fair merge and full recursion (Q808690) (← links)
- Causal message sequence charts (Q843103) (← links)
- Branching versus linear logics yet again (Q911747) (← links)
- Partial order behaviour and structure of Petri nets (Q911779) (← links)
- Some behavioural aspects of net theory (Q913516) (← links)
- A partial ordering semantics for CCS (Q914400) (← links)
- A Nice labelling for tree-like event structures of degree 3 (Q979077) (← links)
- Executability of scenarios in Petri nets (Q1006647) (← links)
- Partial ordering models for concurrency can be defined operationally (Q1111013) (← links)
- The equational theory of pomsets (Q1119012) (← links)
- Concurrency and atomicity (Q1124366) (← links)
- Four domains for concurrency (Q1179700) (← links)
- An algebra of concurrent non-deterministic processes (Q1179704) (← links)
- Connectedness and synchronization (Q1179707) (← links)
- Executions: A new partial-order semantics of Petri nets (Q1183595) (← links)
- Concurrent regular expressions and their relationship to Petri nets (Q1184987) (← links)
- Modelling knowledge and action in distributed systems (Q1262142) (← links)
- Non-interleaving semantics for mobile processes (Q1285660) (← links)
- Proving partial order properties (Q1322161) (← links)
- On the mutual-exclusion problem -- a quest for minimal solutions (Q1329738) (← links)
- Detecting causal relationships in distributed computations: In search of the holy grail (Q1331790) (← links)
- Refinement of events in the development of real-time distributed systems (Q1341711) (← links)
- Higher categories, strings, cubes and simplex equations (Q1346409) (← links)
- Automatizing parametric reasoning on distributed concurrent systems (Q1346610) (← links)
- The difference between splitting in \(n\) and \(n+1\) (Q1370654) (← links)
- Chu spaces as a semantic bridge between linear logic and mathematics. (Q1398475) (← links)
- Presheaf models for CCS-like languages (Q1399958) (← links)
- Reasoning about causality between distributed nonatomic events (Q1402743) (← links)
- Series-parallel languages and the bounded-width property (Q1566734) (← links)
- Processes of timed Petri nets (Q1575631) (← links)
- Asynchronous cellular automata for pomsets (Q1583242) (← links)
- A truly concurrent semantics for a process algebra using resource pomsets (Q1603698) (← links)
