Representation of semiautomata by canonical words and equivalences. II: Specification of software modules

DOI10.1142/S0129054107005133MaRDI QIDQ3065617zbMATH OpenOpenAlexFDO

Authors Helmut Jürgensen, Janusz Brzozowski

Publication date 6 January 2011

Published in International Journal of Foundations of Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1142/s0129054107005133

zbMATH Keywords

equivalenceautomatonspecificationtracerewritingmodulecanonical

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Mathematical aspects of software engineering (specification, verification, metrics, requirements, etc.) (68N30) Grammars and rewriting systems (68Q42) Specification and verification (program logics, model checking, etc.) (68Q60)

Recommendations

• Representation of a class of nondeterministic semiautomata by canonical words.
• REPRESENTATION OF SEMIAUTOMATA BY CANONICAL WORDS AND EQUIVALENCES
• Automata- and logic-based systems design
• Automata theory and model checking
• Trace rewriting systems

Cites work

• scientific article; zbMATH DE number 3358370 (Why is no real title available?)
• A Formal Method for the Abstract Specification of Software
• REPRESENTATION OF SEMIAUTOMATA BY CANONICAL WORDS AND EQUIVALENCES
• Representation of a class of nondeterministic semiautomata by canonical words.

Cited in

(4)

• REPRESENTATION OF SEMIAUTOMATA BY CANONICAL WORDS AND EQUIVALENCES
• Applying string-rewriting to sequence-based specification
• An axiom system for sequence-based specification
• Representation of a class of nondeterministic semiautomata by canonical words.

This page was built for publication: Representation of semiautomata by canonical words and equivalences. II: Specification of software modules

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3065617)