Learning Pomset Automata

Alexandra Silva; Gerco van Heerdt; Jurriaan Rot; Tobias Kapp\'e

REVIEW

Learning Pomset Automata

Not yet reviewed by Pith; the record is open.

Re-run · record.json Download PDF Read on arXiv ↗

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv 2102.07504 v1 pith:FWQBCENX submitted 2021-02-15 cs.FL

Gerco van Heerdt , Tobias Kappé , Jurriaan Rot , Alexandra Silva This is my paper · ORCID

classification cs.FL

keywords pomsetautomatabimonoidsclasslanguagesacceptsalgorithmconvert

verification ladder T0 review T1 audit T2 compute T3 formal

Signed reviews

No signed human review yet.

0 comments

read the original abstract

We extend the L* algorithm to learn bimonoids recognising pomset languages. We then identify a class of pomset automata that accepts precisely the class of pomset languages recognised by bimonoids and show how to convert between bimonoids and automata.

Discussion (0). Continue with ORCID to comment.

Pith tools