Found: 17
Select item for more details and to access through your institution.
MODAL INTERFACE AUTOMATA.
- Published in:
- Logical Methods in Computer Science (LMCS), 2013, v. 9, n. 3, p. 1, doi. 10.2168/LMCS-9(3:4)2013
- By:
- Publication type:
- Article
Fault-Free Refinements for Interface Automata.
- Published in:
- Scientific Annals of Computer Science, 2018, v. 28, n. 2, p. 289, doi. 10.7561/SACS.2018.2.289
- By:
- Publication type:
- Article
Representing groups by graphs with constant link and hypergraphs.
- Published in:
- Journal of Graph Theory, 1986, v. 10, n. 4, p. 461, doi. 10.1002/jgt.3190100406
- By:
- Publication type:
- Article
The square of a connected S(K<sub>1,3</sub>)-free graph is vertex pancyclic.
- Published in:
- Journal of Graph Theory, 1985, v. 9, n. 4, p. 535, doi. 10.1002/jgt.3190090415
- By:
- Publication type:
- Article
Graphs with given group and given constant link.
- Published in:
- Journal of Graph Theory, 1984, v. 8, n. 1, p. 111, doi. 10.1002/jgt.3190080113
- By:
- Publication type:
- Article
Interface Automata for Shared Memory.
- Published in:
- Acta Informatica, 2022, v. 59, n. 5, p. 521, doi. 10.1007/s00236-021-00408-8
- By:
- Publication type:
- Article
Correction to: A linear-time branching-time perspective on interface automata.
- Published in:
- 2021
- By:
- Publication type:
- Correction Notice
A linear-time branching-time perspective on interface automata.
- Published in:
- Acta Informatica, 2020, v. 57, n. 3-5, p. 513, doi. 10.1007/s00236-020-00369-4
- By:
- Publication type:
- Article
Richer interface automata with optimistic and pessimistic compatibility.
- Published in:
- Acta Informatica, 2015, v. 52, n. 4/5, p. 305, doi. 10.1007/s00236-014-0211-0
- By:
- Publication type:
- Article
Trace- and failure-based semantics for responsiveness.
- Published in:
- Acta Informatica, 2014, v. 51, n. 8, p. 499, doi. 10.1007/s00236-014-0205-y
- By:
- Publication type:
- Article
A trace-based service semantics guaranteeing deadlock freedom.
- Published in:
- Acta Informatica, 2012, v. 49, n. 2, p. 69, doi. 10.1007/s00236-012-0151-5
- By:
- Publication type:
- Article
STG decomposition strategies in combination with unfolding.
- Published in:
- Acta Informatica, 2009, v. 46, n. 6, p. 433, doi. 10.1007/s00236-009-0102-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
Merged processes: a new condensed representation of Petri net behaviour.
- Published in:
- Acta Informatica, 2006, v. 43, n. 5, p. 307, doi. 10.1007/s00236-006-0023-y
- By:
- Publication type:
- Article
Canonical prefixes of Petri net unfoldings.
- Published in:
- Acta Informatica, 2003, v. 40, n. 2, p. 95, doi. 10.1007/s00236-003-0122-y
- By:
- Publication type:
- Article
Comparing the worst-case efficiency of asynchronous systems with PAFAS.
- Published in:
- Acta Informatica, 2002, v. 38, n. 11/12, p. 735, doi. 10.1007/s00236-002-0094-3
- By:
- Publication type:
- Article
Fair testing and stubborn sets.
- Published in:
- International Journal on Software Tools for Technology Transfer, 2018, v. 20, n. 5, p. 589, doi. 10.1007/s10009-017-0481-2
- By:
- Publication type:
- Article