Efficient Solution of Language Equations Using Partitioned Representations

A class of discrete event synthesis problems can be reduced to solving language equations f X S, where F is the fixed component and S the specification. Sequential synthesis deals with FSMs when the automata for F and S are prefix closed, and are naturally represented by multi-level networks with la...

Full description

Saved in:
Bibliographic Details
Published in:Design, Automation and Test in Europe pp. 418 - 423
Main Authors: Mishchenko, Alan, Brayton, Robert, Jiang, Roland, Villa, Tiziano, Yevtushenko, Nina
Format: Conference Proceeding
Language:English
Published: Washington, DC, USA IEEE Computer Society 07.03.2005
IEEE
Series:ACM Conferences
Subjects:
Automata
Boolean functions
Computing methodologies > Symbolic and algebraic manipulation > Symbolic and algebraic algorithms
Data structures
Equations
Formal verification
Hardware > Hardware validation > Functional verification
Hardware > Integrated circuits > Logic circuits > Sequential circuits
Image converters
Input variables
Network synthesis
Protocols
Testing
Theory of computation > Design and analysis of algorithms
Theory of computation > Formal languages and automata theory
ISBN:9780769522883, 0769522882
ISSN:1530-1591
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Abstract A class of discrete event synthesis problems can be reduced to solving language equations f X S, where F is the fixed component and S the specification. Sequential synthesis deals with FSMs when the automata for F and S are prefix closed, and are naturally represented by multi-level networks with latches. For this special case, we present an efficient computation, using partitioned representations, of the most general prefix-closed solution of the above class of language equations. The transition and the output relations of the FSMs for F and S in their partitioned form are represented by the sets of output and next state functions of the corresponding networks. Experimentally, we show that using partitioned representations is much faster than using monolithic representations, as well as applicable to larger problem instances.
AbstractList A class of discrete event synthesis problems can be reduced to solving language equations f ? X ? S, where F is the fixed component and S the specification. Sequential synthesis deals with FSMs when the automata for F and S are prefix closed, and are naturally represented by multi-level networks with latches. For this special case, we present an efficient computation, using partitioned representations, of the most general prefix-closed solution of the above class of language equations. The transition and the output relations of the FSMs for F and S in their partitioned form are represented by the sets of output and next state functions of the corresponding networks. Experimentally, we show that using partitioned representations is much faster than using monolithic representations, as well as applicable to larger problem instances.
A class of discrete event synthesis problems can be reduced to solving language equations, F /spl middot/ X /spl sube/ S, where F is the fixed component and S the specification. Sequential synthesis deals with FSMs when the automata for F and S are prefix closed. and are naturally represented by multi-level networks with latches. For this special case, we present an efficient computation, using partitioned representations, of the most general prefix-closed solution of the above class of language equations. The transition and the output relations of the FSMs for F and S in their partitioned form are represented by the sets of output and next state functions of the corresponding networks. Experimentally, we show that using partitioned representations is much faster than using monolithic representations, as well as applicable to larger problem instances.
Author Yevtushenko, Nina
Brayton, Robert
Jiang, Roland
Villa, Tiziano
Mishchenko, Alan
Author_xml – sequence: 1
  givenname: Alan
  surname: Mishchenko
  fullname: Mishchenko, Alan
  organization: University of California, Berkeley
– sequence: 2
  givenname: Robert
  surname: Brayton
  fullname: Brayton, Robert
  organization: University of California, Berkeley
– sequence: 3
  givenname: Roland
  surname: Jiang
  fullname: Jiang, Roland
  organization: University of California, Berkeley
– sequence: 4
  givenname: Tiziano
  surname: Villa
  fullname: Villa, Tiziano
  organization: University of Udine, Italy
– sequence: 5
  givenname: Nina
  surname: Yevtushenko
  fullname: Yevtushenko, Nina
  organization: Tomsk State University, Russia
BookMark eNqNkD1PwzAQhi0BEqV0ZGLJxESKz47jeKxK-FIlELSz5SbnytDGbZwM_HscFYmVW0569dyr03NBThvfICFXQKcAVN3dz5bllFEqpsDpCZkoWVCZK8FYUfBTMgLBaQpCwTmZhPBJ43CVQS5H5KW01lUOmy758Nu-c75JvE0Wptn0ZoNJeejNEIZkFVyzSd5M27khwDp5x32LIZ4eiUtyZs024OR3j8nqoVzOn9LF6-PzfLZIDZNZl9asNlZlNQWwtJbAmC1iwizNxZrR-BaTIpMUM1bUmHPGrTSVFSIDhKISfExujr371h96DJ3euVDhdmsa9H3QHEAWUUEEr4-gQ0S9b93OtN8auBJC5X81ptrptfdfQQPVg089-NSDzwjTCN7-C9Tr1qHlP_b5dOk
ContentType Conference Proceeding
DBID 6IE
6IL
CBEJK
RIE
RIL
7SC
8FD
JQ2
L7M
L~C
L~D
DOI 10.1109/DATE.2005.130
DatabaseName IEEE Electronic Library (IEL) Conference Proceedings
IEEE Xplore POP ALL
IEEE Xplore All Conference Proceedings
IEEE Electronic Library (IEL)
IEEE Proceedings Order Plans (POP All) 1998-Present
Computer and Information Systems Abstracts
Technology Research Database
ProQuest Computer Science Collection
Advanced Technologies Database with Aerospace
Computer and Information Systems Abstracts – Academic
Computer and Information Systems Abstracts Professional
DatabaseTitle Computer and Information Systems Abstracts
Technology Research Database
Computer and Information Systems Abstracts – Academic
Advanced Technologies Database with Aerospace
ProQuest Computer Science Collection
Computer and Information Systems Abstracts Professional
DatabaseTitleList Computer and Information Systems Abstracts
Database_xml – sequence: 1
  dbid: RIE
  name: IEEE Electronic Library (IEL)
  url: https://ieeexplore.ieee.org/
  sourceTypes: Publisher
DeliveryMethod fulltext_linktorsrc
Discipline Engineering
Computer Science
EndPage 423
ExternalDocumentID 1395596
Genre orig-research
Conference Paper
GroupedDBID 6IE
6IF
6IK
6IL
6IN
AAJGR
AARBI
ACM
ADPZR
ALMA_UNASSIGNED_HOLDINGS
APO
BEFXN
BFFAM
BGNUA
BKEBE
BPEOZ
CBEJK
GUFHI
OCL
RIB
RIC
RIE
RIL
123
29F
29O
6IH
AAWTH
ABLEC
ADZIZ
CHZPO
FEDTE
IEGSK
IPLJI
KZ1
LMP
M43
RNS
7SC
8FD
JQ2
L7M
L~C
L~D
ID FETCH-LOGICAL-a274t-d2daf94d011f0d7122f8daf2f065b20416275470e428de6323f7acf5541e18c53
IEDL.DBID RIE
ISBN 9780769522883
0769522882
ISICitedReferencesCount 10
ISICitedReferencesURI http://www.webofscience.com/api/gateway?GWVersion=2&SrcApp=Summon&SrcAuth=ProQuest&DestLinkType=CitingArticles&DestApp=WOS_CPL&KeyUT=000228086900077&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D
ISSN 1530-1591
IngestDate Fri Jul 11 07:20:50 EDT 2025
Wed Aug 27 02:14:00 EDT 2025
Wed Jan 31 06:48:15 EST 2024
Wed Jan 31 06:38:23 EST 2024
IsDoiOpenAccess false
IsOpenAccess true
IsPeerReviewed false
IsScholarly true
Language English
LinkModel DirectLink
MeetingName DATE05: Design, Automation and Test in Europe
MergedId FETCHMERGED-LOGICAL-a274t-d2daf94d011f0d7122f8daf2f065b20416275470e428de6323f7acf5541e18c53
Notes SourceType-Conference Papers & Proceedings-1
ObjectType-Conference Paper-1
content type line 25
PQID 31178978
PQPubID 23500
PageCount 6
ParticipantIDs proquest_miscellaneous_31178978
acm_books_10_1109_DATE_2005_130
acm_books_10_1109_DATE_2005_130_brief
ieee_primary_1395596
PublicationCentury 2000
PublicationDate 20050307
20050000
PublicationDateYYYYMMDD 2005-03-07
2005-01-01
PublicationDate_xml – month: 03
  year: 2005
  text: 20050307
  day: 07
PublicationDecade 2000
PublicationPlace Washington, DC, USA
PublicationPlace_xml – name: Washington, DC, USA
PublicationSeriesTitle ACM Conferences
PublicationTitle Design, Automation and Test in Europe
PublicationTitleAbbrev DATE
PublicationYear 2005
Publisher IEEE Computer Society
IEEE
Publisher_xml – name: IEEE Computer Society
– name: IEEE
SSID ssj0000394167
ssj0005329
Score 1.619517
Snippet A class of discrete event synthesis problems can be reduced to solving language equations f X S, where F is the fixed component and S the specification....
A class of discrete event synthesis problems can be reduced to solving language equations, F /spl middot/ X /spl sube/ S, where F is the fixed component and S...
A class of discrete event synthesis problems can be reduced to solving language equations f ? X ? S, where F is the fixed component and S the specification....
SourceID proquest
ieee
acm
SourceType Aggregation Database
Publisher
StartPage 418
SubjectTerms Automata
Boolean functions
Computing methodologies -- Symbolic and algebraic manipulation -- Symbolic and algebraic algorithms
Data structures
Equations
Formal verification
Hardware -- Hardware validation -- Functional verification
Hardware -- Integrated circuits -- Logic circuits -- Sequential circuits
Image converters
Input variables
Network synthesis
Protocols
Testing
Theory of computation -- Design and analysis of algorithms
Theory of computation -- Formal languages and automata theory
Title Efficient Solution of Language Equations Using Partitioned Representations
URI https://ieeexplore.ieee.org/document/1395596
https://www.proquest.com/docview/31178978
WOSCitedRecordID wos000228086900077&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D
hasFullText 1
inHoldings 1
isFullTextHit
isPrint
link http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwlV07T8MwED61iAEWoBRRnh5gI9R2kjoeERQhhBADoG5RYl8QAy00Lb-fs5O0SCAhtiRK4uR8Z9_zO4ATshjySGQmQCnCIFKcBxpNEuRCYxxFBmPf6_D5Tt3fJ6ORfmjB2aIWBhF98hmeu0Mfy7cTM3eusj5pK6QAD9rQVmpQ1Wot_Ck81JEv6m7SO0LfoYwEmge0ZYvKZNekbpBOWSPvNOfhEnyzf3XxOKxcLcJlRrcz81Y3XvmxWvst6Hrjfx-_Cd1lLR97WOxSW9DCcQc2mmYOrJbtDqx_Qybchtuhh5agN7KGOdmkYI13k-FHBRFeMpc4_8LeHQd61CPLPE5mU9M0LrvwdD18vLwJ6rYLQUYm6iyw0maFjixJfsGtElIWCV2RBWkrueREZalimlUky8XiIJRhoTJTkF4iUCQmDndgZUzj7QLLE5nTb_PMWWXKKi1tRIuKMFGuUfG4B8dE39TZE2XqzRGuUzcDrjtm7EJtPTj94440n75i0YNtR_L0vcLoSGtq0wDNnKUkNy4Yko1xMi_TUAiVEBPs_f7gPqx5kFbvbDmAldl0joewaj5nr-X0yLPeF0xkzpM
linkProvider IEEE
linkToHtml http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwlV1RT9swED4VNgl46VZAFAb4gb0RsJ0Ex49oK2JbqXjoJt6sxL4gHmihafn9nJ2kRdoktLckSmznfGffne--Azghi6FIRG4jlCKOEsV5pNFmUSE0pkliMQ21Dv8M1WiU3d3p2w6cLnNhEDEEn-GZvwxn-W5qF95Vdk7aCinAF2vwgZqRvM7WWnpUeKyTkNbdBnjEoUYZiTSPaNMWtdGuSeEgrbLB3mnv4xX85vn3y_GgdrYIHxu9ltvHpvTKX-t12ISuuv83_E-ws8rmY7fLfeozdHDSg25bzoE10t2DrTfYhNvwcxDAJahF1rInm5as9W8yfK5BwivmQ-fv2ZPnwYB75FhAymyzmibVDvy-Goy_XUdN4YUoJyN1Hjnp8lInjmS_5E4JKcuMnsiS9JVCcqKyVCnNK5Lt4vAilnGpcluSZiJQZDaNd2F9Qv3tASsyWdBv89zbZcopLV1Cy4qwSaFR8bQPx0Rf4y2KygSDhGvjZ8DXx0z9YVsfvr7zhilmD1j2YduT3DzVKB2moTZ10M6ZIcnxxyH5BKeLysRCqIyYYP_fHx7DxvX4ZmiGP0a_DmAzQLYG18sXWJ_PFngIH-3L_KGaHQU2fAU8RtHa
openUrl ctx_ver=Z39.88-2004&ctx_enc=info%3Aofi%2Fenc%3AUTF-8&rfr_id=info%3Asid%2Fsummon.serialssolutions.com&rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Abook&rft.genre=proceeding&rft.title=Design%2C+Automation+and+Test+in+Europe&rft.atitle=Efficient+solution+of+language+equations+using+partitioned+representations&rft.au=Mishchenko%2C+A.&rft.au=Brayton%2C+R.&rft.au=Jiang%2C+R.&rft.au=Villa%2C+T.&rft.date=2005-01-01&rft.pub=IEEE&rft.isbn=9780769522883&rft.issn=1530-1591&rft.spage=418&rft.epage=423+Vol.+1&rft_id=info:doi/10.1109%2FDATE.2005.130&rft.externalDocID=1395596
thumbnail_l http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/lc.gif&issn=1530-1591&client=summon
thumbnail_m http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/mc.gif&issn=1530-1591&client=summon
thumbnail_s http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/sc.gif&issn=1530-1591&client=summon