Abstract
We present an extension of Badouel & Darondeau's results for unlabeled Petri net synthesis from regular languages. We study synthesis from families of languages defined through modal mu-calculus sentence formulas, which translate into modal specifications. A structural restriction makes this problem is decidable.
Full Text 
Sign-in/Register to access full text options
Sign-in/Register to access full text options 
Published version (
Free)
Free) 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call
