On Reachability for Unidirectional Channel Systems Extended with Regular Tests
"Unidirectional channel systems" (Chambart & Schnoebelen, CONCUR 2008) are finite-state systems where one-way communication from a Sender to a Receiver goes via one reliable and one unreliable unbounded fifo channel. While reachability is decidable for these systems, equipping them wit...
Main Authors: | Jancar Petr, Prateek Karandikar, Philippe Schnoebelen |
---|---|
Format: | Article |
Language: | English |
Published: |
Logical Methods in Computer Science e.V.
2015-04-01
|
Series: | Logical Methods in Computer Science |
Subjects: | |
Online Access: | https://lmcs.episciences.org/876/pdf |
Similar Items
-
Bounded Reachability Problems are Decidable in FIFO Machines
by: Benedikt Bollig, et al.
Published: (2022-01-01) -
Reachability Problem for Weak Multi-Pushdown Automata
by: Wojciech Czerwiński, et al.
Published: (2013-09-01) -
The height of piecewise-testable languages and the complexity of the logic of subwords
by: Prateek Karandikar, et al.
Published: (2019-04-01) -
All-Path Reachability Logic
by: Andrei Stefanescu, et al.
Published: (2019-04-01) -
Branching Bisimilarity of Normed BPA Processes as a Rational Monoid
by: Petr Jancar
Published: (2017-11-01)