The following pages link to Jos C. M. Baeten (Q393088):
Displaying 50 items.
- (Q208692) (redirect page) (← links)
- Reactive Turing machines (Q393091) (← links)
- Unguardedness mostly means many solutions (Q549175) (← links)
- Recursive process definitions with the state operator (Q758198) (← links)
- Duplication of constants in process algebra (Q864505) (← links)
- On the consistency of Koomen's fair abstraction rule (Q1090103) (← links)
- Global renaming operators in concrete process algebra (Q1106660) (← links)
- An algebra for process creation (Q1203719) (← links)
- Term-rewriting systems with rule priorities (Q1262749) (← links)
- Real space process algebra (Q1329194) (← links)
- On sequential composition, action prefixes and process prefix (Q1333405) (← links)
- Process algebra with propositional signals (Q1391792) (← links)
- A brief history of process algebra (Q1781995) (← links)
- Process algebra with timing (Q1847280) (← links)
- Axiomatizing GSOS with termination (Q1878716) (← links)
- Axiomatizing probabilistic processes: ACP with generative probabilities (Q1899914) (← links)
- Discrete time process algebra (Q1914041) (← links)
- Reconciling real and stochastic time: the need for probabilistic refinement (Q1941867) (← links)
- Analyzing a \(\chi\) model of a turntable system using Spin, CADP and Uppaal (Q2568979) (← links)
- Real time process algebra (Q2640341) (← links)
- (Q2760247) (← links)
- (Q2760250) (← links)
- (Q2769588) (← links)
- (Q2779789) (← links)
- Model-based Engineering of Embedded Systems Using the Hybrid Process Algebra Chi (Q2870190) (← links)
- Turing Meets Milner (Q2914361) (← links)
- Expressiveness modulo bisimilarity of regular expressions with parallel composition (Q2971071) (← links)
- Reactive Turing Machines (Q3088297) (← links)
- Decidability of bisimulation equivalence for process generating context-free languages (Q3140021) (← links)
- A Process-Theoretic Look at Automata (Q3400912) (← links)
- (Q3404131) (← links)
- Calculating with Automata (Q3507400) (← links)
- A Context-Free Process as a Pushdown Automaton (Q3541013) (← links)
- A ground-complete axiomatisation of finite-state processes in a generic process algebra (Q3545273) (← links)
- A characterization of regular expressions under bisimulation (Q3546331) (← links)
- (Q3734393) (← links)
- (Q3761680) (← links)
- Ready-Trace Semantics for Concrete Process Algebra with the Priority Operator (Q3763573) (← links)
- (Q3774929) (← links)
- (Q3776606) (← links)
- (Q3805891) (← links)
- (Q3820057) (← links)
- Process Algebra (Q3999164) (← links)
- (Q4013244) (← links)
- (Q4029584) (← links)
- (Q4223007) (← links)
- Embedding untimed into timed process algebra: the case for explicit termination (Q4461215) (← links)
- (Q4518413) (← links)
- (Q4619824) (← links)
- (Q4727412) (← links)
