Difference between revisions of "Publications/renkin.22.forte"

From LRDE

(Created page with "{{Publication | published = true | date = 2020-04-26 | authors = Florian Renkin, Philipp Schlehuber-Caissier, Alexandre Duret-Lutz, Adrien Pommellet | title = Effective Reduct...")
 
Line 6: Line 6:
 
| booktitle = Proceedings of the 42nd International Conference on Formal Techniques for Distributed Objects, Components, and Systems (FORTE'22)
 
| booktitle = Proceedings of the 42nd International Conference on Formal Techniques for Distributed Objects, Components, and Systems (FORTE'22)
 
| series = Lecture Notes in Computer Science
 
| series = Lecture Notes in Computer Science
| pages = ??? to ???
+
| pages = 114 to 130
| volume = ?????
+
| volume = 13273
 
| publisher = Springer
 
| publisher = Springer
 
| abstract = We revisit the problem of reducing incompletely specified Mealy machines with reactive synthesis in mind. We propose two techniques: the former is inspired by the tool sc MeMin and solves the minimization problem, the latter is a novel approach derived from simulation-based reductions but may not guarantee a minimized machine. However, we argue that it offers a good enough compromise between the size of the resulting Mealy machine and performance. The proposed methods are benchmarked against MeMin on a large collection of test cases made of well-known instances as well as new ones.
 
| abstract = We revisit the problem of reducing incompletely specified Mealy machines with reactive synthesis in mind. We propose two techniques: the former is inspired by the tool sc MeMin and solves the minimization problem, the latter is a novel approach derived from simulation-based reductions but may not guarantee a minimized machine. However, we argue that it offers a good enough compromise between the size of the resulting Mealy machine and performance. The proposed methods are benchmarked against MeMin on a large collection of test cases made of well-known instances as well as new ones.
| note = To appear
 
 
| lrdekeywords = Spot
 
| lrdekeywords = Spot
 
| lrdenewsdate = 2020-04-26
 
| lrdenewsdate = 2020-04-26
Line 16: Line 15:
 
| type = inproceedings
 
| type = inproceedings
 
| id = renkin.22.forte
 
| id = renkin.22.forte
  +
| identifier = doi:10.1007/978-3-031-08679-3_8
 
| bibtex =
 
| bibtex =
 
@InProceedings<nowiki>{</nowiki> renkin.22.forte,
 
@InProceedings<nowiki>{</nowiki> renkin.22.forte,
Line 27: Line 27:
 
series = <nowiki>{</nowiki>Lecture Notes in Computer Science<nowiki>}</nowiki>,
 
series = <nowiki>{</nowiki>Lecture Notes in Computer Science<nowiki>}</nowiki>,
 
month = jun,
 
month = jun,
pages = <nowiki>{</nowiki>???--???<nowiki>}</nowiki>,
+
pages = <nowiki>{</nowiki>114--130<nowiki>}</nowiki>,
volume = <nowiki>{</nowiki>?????<nowiki>}</nowiki>,
+
volume = <nowiki>{</nowiki>13273<nowiki>}</nowiki>,
 
publisher = <nowiki>{</nowiki>Springer<nowiki>}</nowiki>,
 
publisher = <nowiki>{</nowiki>Springer<nowiki>}</nowiki>,
 
abstract = <nowiki>{</nowiki>We revisit the problem of reducing incompletely specified
 
abstract = <nowiki>{</nowiki>We revisit the problem of reducing incompletely specified
Line 41: Line 41:
 
collection of test cases made of well-known instances as
 
collection of test cases made of well-known instances as
 
well as new ones.<nowiki>}</nowiki>,
 
well as new ones.<nowiki>}</nowiki>,
note = <nowiki>{</nowiki>To appear<nowiki>}</nowiki>
+
doi = <nowiki>{</nowiki>10.1007/978-3-031-08679-3_8<nowiki>}</nowiki>
 
<nowiki>}</nowiki>
 
<nowiki>}</nowiki>
   

Revision as of 15:53, 17 June 2022

Abstract

We revisit the problem of reducing incompletely specified Mealy machines with reactive synthesis in mind. We propose two techniques: the former is inspired by the tool sc MeMin and solves the minimization problem, the latter is a novel approach derived from simulation-based reductions but may not guarantee a minimized machine. However, we argue that it offers a good enough compromise between the size of the resulting Mealy machine and performance. The proposed methods are benchmarked against MeMin on a large collection of test cases made of well-known instances as well as new ones.

Documents

Bibtex (lrde.bib)

@InProceedings{	  renkin.22.forte,
  author	= {Florian Renkin and Philipp Schlehuber-Caissier and
		  Alexandre Duret-Lutz and Adrien Pommellet},
  title		= {Effective Reductions of {M}ealy Machines},
  year		= 2022,
  booktitle	= {Proceedings of the 42nd International Conference on Formal
		  Techniques for Distributed Objects, Components, and Systems
		  (FORTE'22)},
  series	= {Lecture Notes in Computer Science},
  month		= jun,
  pages		= {114--130},
  volume	= {13273},
  publisher	= {Springer},
  abstract	= {We revisit the problem of reducing incompletely specified
		  Mealy machines with reactive synthesis in mind. We propose
		  two techniques: the former is inspired by the tool {\sc
		  MeMin} and solves the minimization problem, the latter is a
		  novel approach derived from simulation-based reductions but
		  may not guarantee a minimized machine. However, we argue
		  that it offers a good enough compromise between the size of
		  the resulting Mealy machine and performance. The proposed
		  methods are benchmarked against \textsc{MeMin} on a large
		  collection of test cases made of well-known instances as
		  well as new ones.},
  doi		= {10.1007/978-3-031-08679-3_8}
}