Found: 4
Select item for more details and to access through your institution.
Hardness of equivalence checking for composed finite-state systems.
- Published in:
- Acta Informatica, 2009, v. 46, n. 3, p. 169, doi. 10.1007/s00236-008-0088-x
- By:
- Publication type:
- Article
A decomposition theorem for finite persistent transition systems.
- Published in:
- Acta Informatica, 2009, v. 46, n. 3, p. 237, doi. 10.1007/s00236-009-0095-6
- By:
- Publication type:
- Article
On the closure of pattern expressions languages under intersection with regular languages.
- Published in:
- Acta Informatica, 2009, v. 46, n. 3, p. 193, doi. 10.1007/s00236-009-0090-y
- By:
- Publication type:
- Article
Liveness of a mutex algorithm in a fair process algebra.
- Published in:
- Acta Informatica, 2009, v. 46, n. 3, p. 209, doi. 10.1007/s00236-009-0092-9
- By:
- Publication type:
- Article