The following pages link to (Q3030239):
Displaying 50 items.
- On concurrent games with payoff (Q265795) (← links)
- Contracts as games on event structures (Q272306) (← links)
- Atomicity, coherence of information, and point-free structures (Q290637) (← links)
- Reduction of event structures under history preserving bisimulation (Q338613) (← links)
- Probabilistic rely-guarantee calculus (Q507375) (← links)
- Mitigating covert channels based on analysis of the potential for communication (Q530557) (← links)
- Concurrent Kleene algebra and its foundations (Q549679) (← links)
- Distributed temporal logic for the analysis of security protocol models (Q549724) (← links)
- Extensional Petri net (Q667521) (← links)
- An event structure semantics for general Petri nets (Q672871) (← links)
- Process versus unfolding semantics for Place/Transition Petri nets (Q672872) (← links)
- Petri nets and bisimulation (Q672873) (← links)
- On the nature of events: another perspective in concurrency (Q674197) (← links)
- The poset of infinitary traces (Q689293) (← links)
- Closure functions and general iterates as reflectors (Q808275) (← links)
- Configuration structures, event structures and Petri nets (Q843106) (← links)
- Unfolding semantics of graph transformation (Q879600) (← links)
- Combining behavioural types with security analysis (Q890614) (← links)
- Reversibility and asymmetric conflict in event structures (Q890616) (← links)
- Some behavioural aspects of net theory (Q913516) (← links)
- Non-deterministic information systems and their domains (Q914401) (← links)
- Typed event structures and the linear \(\pi \)-calculus (Q964488) (← links)
- Graphical models of separation logic (Q989553) (← links)
- Concurrent transition systems (Q1119395) (← links)
- Concurrency and atomicity (Q1124366) (← links)
- Event structures and domains (Q1124367) (← links)
- Universal homogeneous event structures and domains (Q1175945) (← links)
- Event structures and trace monoids (Q1183599) (← links)
- Elementary transition systems (Q1190485) (← links)
- Causal automata (Q1194329) (← links)
- Towards an algebra for timed behaviours (Q1199544) (← links)
- Representation of computations in concurrent automata by dependence orders (Q1269906) (← links)
- Historical introduction to ``Concrete domains'' by G. Kahn and G. D. Plotkin (Q1314353) (← links)
- Finite labelling problem in event structures (Q1314399) (← links)
- Elementary transition systems and refinement (Q1323371) (← links)
- Denotational semantics in the cpo and metric approach (Q1346621) (← links)
- Labelled domains and automata with concurrency (Q1346626) (← links)
- The difference between splitting in \(n\) and \(n+1\) (Q1370654) (← links)
- Petri nets, traces, and local model checking (Q1391100) (← links)
- Parallel product of event structures (Q1391739) (← links)
- Truly concurrent constraint programming (Q1605181) (← links)
- On Scott's thesis for domains of information and well-quasi-orderings (Q1813971) (← links)
- Algebra and theory of order-deterministic pomsets (Q1815430) (← links)
- Recursive domain equations for concrete data structure (Q1823005) (← links)
- Membership problems for regular and context-free trace languages (Q1824384) (← links)
- Objects and classes in Algol-like languages (Q1854495) (← links)
- Domain and event structure semantics for Petri nets with read and inhibitor arcs (Q1882900) (← links)
- Clustering for Petri nets (Q1884880) (← links)
- Well-behaved flow event structures for parallel composition and action refinement (Q1884941) (← links)
- Unfolding-based diagnosis of systems with an evolving topology (Q1959480) (← links)
