Search


Volume

Author

Year

  • < Previous
  • 1
  • Next >
3 results

Branching Bisimilarity of Normed BPA Processes as a Rational Monoid

Petr Jancar.
The paper presents an elaborated and simplified version of the structural result for branching bisimilarity on normed BPA (Basic Process Algebra) processes that was the crux of a conference paper by Czerwinski and Jancar (arxiv 7/2014 and LiCS 2015). That paper focused on the computational&nbsp;[&hellip;]
Published on November 28, 2017
Volume 13, Issue 4

Bisimilarity on Basic Process Algebra is in 2-ExpTime (an explicit proof)

Petr Jancar.
Burkart, Caucal, Steffen (1995) showed a procedure deciding bisimulation equivalence of processes in Basic Process Algebra (BPA), i.e. of sequential processes generated by context-free grammars. They improved the previous decidability result of Christensen, H\"uttel, Stirling (1992), since their&nbsp;[&hellip;]
Published on March 13, 2013
Volume 9, Issue 1

On Reachability for Unidirectional Channel Systems Extended with Regular Tests

Jancar Petr ; Prateek Karandikar ; Philippe Schnoebelen.
"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 with the&nbsp;[&hellip;]
Published on April 17, 2015
Volume 11, Issue 2
  • < Previous
  • 1
  • Next >