Pages that link to "Item:Q1089787"
From MaRDI portal
The following pages link to Concurrent histories: a basis for observing distributed systems (Q1089787):
Displaying 22 items.
- Modeling concurrency with interval traces (Q515576) (← links)
- Structure of concurrency (Q685384) (← links)
- Universal axioms for bisimulations (Q685411) (← links)
- A partial ordering semantics for CCS (Q914400) (← links)
- Petri nets are monoids (Q922720) (← links)
- Relational structures model of concurrency (Q934912) (← links)
- A distributed operational semantics of CCS based on condition/event systems (Q1110338) (← links)
- Partial ordering models for concurrency can be defined operationally (Q1111013) (← links)
- Appraising fairness in languages for distributed programming (Q1112589) (← links)
- An algebraic characterisation of elementary net system (observable) state space (Q1203118) (← links)
- Automatizing parametric reasoning on distributed concurrent systems (Q1346610) (← links)
- Relational structures for concurrent behaviours (Q1998872) (← links)
- Event structure semantics for multiparty sessions (Q2683035) (← links)
- Graph-Based Design and Analysis of Dynamic Software Architectures (Q3507356) (← links)
- Ugo Montanari and Concurrency Theory (Q3507376) (← links)
- Twenty Years on: Reflections on the CEDISYS Project. Combining True Concurrency with Process Algebra (Q3507401) (← links)
- (Q4253662) (← links)
- Step bisimulation is pomset equivalence on a parallel language without explicit internal choice (Q4279248) (← links)
- Extended transition systems for parametric bisimulation (Q4630292) (← links)
- An algebraic view of interleaving and distributed operational semantics for CCS (Q5096249) (← links)
- Proved trees (Q5204353) (← links)
- (Q5875399) (← links)
