On decidability of LTL model checking for process rewrite systems.
- Published in:
- Acta Informatica, 2009, v. 46, n. 1, p. 1, doi. 10.1007/s00236-008-0082-3
- By:
- Publication type:
- Article
Works matching IS 00015903 AND DT 2009 AND VI 46 AND IP 1
Results: 5
1
2
Semi-synchronous transductions.
- Published in:
- Acta Informatica, 2009, v. 46, n. 1, p. 29, doi. 10.1007/s00236-008-0083-2
- By:
- Publication type:
- Article
3
A complexity tradeoff in ranking-function termination proofs.
- Published in:
- Acta Informatica, 2009, v. 46, n. 1, p. 57, doi. 10.1007/s00236-008-0085-0
- By:
- Publication type:
- Article
4
Exploiting colored Petri nets to decide on permutation admissibility.
- Published in:
- Acta Informatica, 2009, v. 46, n. 1, p. 43, doi. 10.1007/s00236-008-0084-1
- By:
- Publication type:
- Article
5
A queue based mutual exclusion algorithm.
- Published in:
- Acta Informatica, 2009, v. 46, n. 1, p. 73, doi. 10.1007/s00236-008-0086-z
- By:
- Publication type:
- Article