From Rule-Based to Automata-Based Testing

Kousha Etessami, Mihalis Yannakakis

Research output: Chapter in Book/Report/Conference proceedingChapter

Abstract / Description of output

Rule based languages have been used extensively to provide a declarative description of causal relationships between events and conditions in a wide variety of systems. On the other hand, automata (finite state machine) based models provide a detailed operational specification of how the system state evolves over time. While rules are a convenient declarative mechanism, a finite automaton is more flexible and far more easily analyzed than a collection of rules with potentially complicated
Original languageEnglish
Title of host publicationFormal Methods for Distributed System Development
Subtitle of host publicationFORTE / PSTV 2000 IFIP TC6 WG6.1 Joint International Conference on Formal Description Techniques for Distributed Systems and Communication Protocols (FORTE XIII) and Protocol Specification, Testing and Verification (PSTV XX) October 10–13, 2000, Pisa, Italy
PublisherSpringer US
Pages53-68
Number of pages16
ISBN (Electronic)978-0-387-35533-7
ISBN (Print)978-0-7923-7968-3, 978-1-4757-5264-9
DOIs
Publication statusPublished - 2000

Publication series

NameIFIP Advances in Information and Communication Technology
PublisherSpringer US
Volume55
ISSN (Print)1868-4238

Fingerprint

Dive into the research topics of 'From Rule-Based to Automata-Based Testing'. Together they form a unique fingerprint.

Cite this