Abstract
Automata with concurrency relations [Formula: see text], which occurred in formal verification methods of concurrent programs, are labeled transition systems with a collection of binary relations describing when two actions in a given state of the automaton can happen independently of each other. The concurrency monoid M($\mathcal{A}$) comprises all finite computation sequences of [Formula: see text], modulo a canonical congruence induced by the concurrency relations, with composition as monoid operation. Then M∞($\mathcal{A}$) denotes the set of all infinite products in M($\mathcal{A}$); its elements can be represented by labeled partially ordered sets. Under suitable assumptions on [Formula: see text], we show that a language L in M∞($\mathcal{A}$) is recognizable iff it is definable by a formula of monadic second order logic, and that it is recognizable iff it can be constructed from recognizable languages in M($\mathcal{A}$) using co-rational expressions. This generalizes various recent results in trace theory.
Sign-in/Register to access full text options 
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 callMore From: International Journal of Foundations of Computer Science
Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
