Stable trace automata vs. full trace automata

V Schmitt - Theoretical computer science, 1998 - Elsevier
Trace automata provide a well-studied model for systems with concurrent behavior, which is
usually given by associated domains of finite or infinite computation systems. Several …
被引用次数：5 相关文章
[PDF] core.ac.uk

[PDF][PDF] Fundamental Study Stable trace automata vs. full trace automata'

V Schmitt - Theoretical Computer Science, 1998 - core.ac.uk
Trace automata provide a well-studied model for systems with concurrent behavior, which is
usually given by associated domains of finite or infinite computation systems. Several …

[引用][C] Stable trace automata vs. full trace automata

V Schmitt - Theoretical Computer Science, 1998 - dl.acm.org
Stable trace automata vs. full trace automata | Theoretical Computer Science skip to main
content ACM Digital Library home ACM home Google, Inc. (search) Advanced Search Browse …

Stable trace automata vs. full trace automata

V Schmitt - Theoretical Computer Science, 1998 - infona.pl
Trace automata provide a well-studied model for systems with concurrent behavior, which is
usually given by associated domains of finite or infinite computation systems. Several …

[引用][C] Stable trace automata vs. full trace automata

V SCHMITT - Theoretical computer science, 1998 - pascal-francis.inist.fr
Stable trace automata vs. full trace automata CNRS Inist Pascal-Francis CNRS Pascal and
Francis Bibliographic Databases Simple search Advanced search Search by classification …

Stable trace automata vs. full trace automata

V Schmitt - Theoretical Computer Science, 1998 - elibrary.ru
Trace automata provide a well-studied model for systems with concurrent behavior, which is
usually given by associated domains of finite or infinite computation systems. Several …

[引用][C] Stable trace automata vs. full trace automata

V SCHMITT - Theoretical computer science, 1998 - Elsevier