The FacetedDBLP logo    Search for: in:

Disable automatic phrases ?     Syntactic query expansion: ?

Searching for CFSMs with no syntactic query expansion in all metadata.

Publication years (Num. hits)
1995-2006 (14)
Publication types (Num. hits)
article(2) inproceedings(12)
Venues (Conferences, Journals, ...)
GrowBag graphs for keyword ? (Num. hits/coverage)

Group by:
The graphs summarize 11 occurrences of 10 keywords

Results
Found 14 publication records. Showing 14 according to the selection in the facets
Hits ? Authors Title Venue Year Link Author keywords
92Wuxu Peng Deadlock Detection in Communicating Finite State Machines by Even Reachability Analysis. Search on Bibsonomy ICCCN The full citation details ... 1995 DBLP  DOI  BibTeX  RDF Communication protocols, reachability analysis, specification and verification
46Tristan Le Gall, Bertrand Jeannet, Thierry Jéron Verification of Communication Protocols Using Abstract Interpretation of FIFO Queues. Search on Bibsonomy AMAST The full citation details ... 2006 DBLP  DOI  BibTeX  RDF
46Suman Roy 0001, Bhaskar Chakraborty A Finite Union of DFAs in Symbolic Model Checking of Infinite Systems. Search on Bibsonomy CIAA The full citation details ... 2006 DBLP  DOI  BibTeX  RDF
46Wuxu Peng, Kia Makki Lossy Communicating Finite State Machines. Search on Bibsonomy Telecommun. Syst. The full citation details ... 2004 DBLP  DOI  BibTeX  RDF concurrency model, verification, specification, communication protocols
39Karnig Derderian, Robert M. Hierons, Mark Harman, Qiang Guo 0001 Input Sequence Generation for Testing of Communicating Finite State Machines (CFSMs). Search on Bibsonomy GECCO (2) The full citation details ... 2004 DBLP  DOI  BibTeX  RDF
39Hans van der Schoot, Hasan Ural On Improving Reachability Analysis for Verifying Progress Properties for Networks of CFSMs. Search on Bibsonomy ICDCS The full citation details ... 1998 DBLP  DOI  BibTeX  RDF
39Wuxu Peng, Kia Makki Reachability and reverse reachability analysis of CFSMs. Search on Bibsonomy Comput. Commun. The full citation details ... 1996 DBLP  DOI  BibTeX  RDF
39Yves-Marie Quemener, Thierry Jéron Finitely Representing Infinite Reachability Graphs of CFSMs with Graph Grammars. Search on Bibsonomy FORTE The full citation details ... 1996 DBLP  BibTeX  RDF
36I. D. Bates, E. Graeme Chester, David J. Kinniment A statechart based HW/SW codesign system. Search on Bibsonomy CODES The full citation details ... 1999 DBLP  DOI  BibTeX  RDF CFSMs, POLIS, statecharts
23Stefan Leue, Richard Mayr, Wei Wei 0015 A Scalable Incomplete Test for Message Buffer Overflow in Promela Models. Search on Bibsonomy SPIN The full citation details ... 2004 DBLP  DOI  BibTeX  RDF
23Stefan Leue, Richard Mayr, Wei Wei 0015 A Scalable Incomplete Test for the Boundedness of UML RT Models. Search on Bibsonomy TACAS The full citation details ... 2004 DBLP  DOI  BibTeX  RDF
23Suman Roy 0001 Symbolic Verification of Infinite Systems using a Finite Union of DFAs. Search on Bibsonomy SEFM The full citation details ... 2004 DBLP  DOI  BibTeX  RDF Symbolic Verification, Accelerations, DFA, Infinite State Systems, FIFO queues
23Partha S. Roop, Arcot Sowmya CFSMcharts: A New Language for Microprocessor Based system Design. Search on Bibsonomy VLSI Design The full citation details ... 1998 DBLP  DOI  BibTeX  RDF
23Kassem Saleh, M. Ilangovan, Robert L. Probert Recovery of Communications Protocol Design from Run Time Protocol Traces. Search on Bibsonomy ICECCS The full citation details ... 1996 DBLP  DOI  BibTeX  RDF
Displaying result #1 - #14 of 14 (100 per page; Change: )
Valid XHTML 1.1! Valid CSS! [Valid RSS]
Maintained by L3S.
Previously maintained by Jörg Diederich.
Based upon DBLP by Michael Ley.
open data data released under the ODC-BY 1.0 license