The following pages link to (Q4874391):
Displayed 11 items.
- On the computational complexity of bisimulation, redux (Q703845) (← links)
- Generating priority rewrite systems for OSOS process languages (Q1012121) (← links)
- Compositionality and bisimulation: A negative result (Q1182130) (← links)
- A complete modal proof system for HAL: the Herbrand agent language (Q1311969) (← links)
- Actors, actions, and initiative in normative system specification (Q1353968) (← links)
- Essential transitions to bisimulation equivalences (Q1391753) (← links)
- Process algebra with language matching (Q1391794) (← links)
- Finite axiom systems for testing preorder and De Simone process languages (Q1575273) (← links)
- Ordered SOS process languages for branching and eager bisimulations (Q1854563) (← links)
- A Complete STIT Logic for Knowledge and Action, and Some of Its Applications (Q3601785) (← links)
- Basic process algebra with deadlocking states (Q5958771) (← links)