Filters








40 Hits in 1.6 sec

Learning Pomset Automata [article]

Gerco van Heerdt, Tobias Kappé, Jurriaan Rot, Alexandra Silva
2021 arXiv   pre-print
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.  ...  We extend tree automata learning algorithms [7, 8, 30] to pomset recognisers.  ... 
arXiv:2102.07504v1 fatcat:lfqtrbr76vg4rp6hf333remcfi

Learning Pomset Automata [chapter]

Gerco van Heerdt, Tobias Kappé, Jurriaan Rot, Alexandra Silva
2021 Lecture Notes in Computer Science  
\star }$$ 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.  ...  We extend tree automata learning algorithms [7, 8, 31] to pomset recognisers.  ... 
doi:10.1007/978-3-030-71995-1_26 fatcat:ozzr6nzrwfdczgzlztbu5bnpki

Page 5239 of Mathematical Reviews Vol. , Issue 98H [page]

1998 Mathematical Reviews  
Weimar, Cellular automata for reaction- diffusion systems (1699-1715 i Most of the papers are being reviewed individually. } pp. tt and 98h:68007 68-06 68T0S 68T30 * Computational learning and probabilistic  ...  The first part describes several new techniques in computational learning.  ... 

Algebraic recognizability of languages [article]

Pascal Weil
2006 arXiv   pre-print
Automata for Graph Languages. We have seen some automata, designed for specific situations (finite and infinite words, traces, series-parallel pomsets, MSC languages, n-pomsets), see Sect. 4.2.  ...  Pomsets in General. There does not seem to be a natural model of automaton that makes sense on all pomsets.  ... 
arXiv:cs/0609110v1 fatcat:2fnhr3gu5rdbbdugq76cqfvl4y

Algebraic Recognizability of Languages [chapter]

Pascal Weil
2004 Lecture Notes in Computer Science  
It can be approached from several angles: recognizability by automata, recognizability by finite monoids or finite-index congruences, rational expressions, monadic second order definability.  ...  Since the beginnings of language theory, there has been an interest for other models than words -especially for the purpose of modeling distributed or timed computation (trees, traces, pomsets, graphs,  ...  Automata for Graph Languages. We have seen some automata, designed for specific situations (finite and infinite words, traces, series-parallel pomsets, MSC languages, n-pomsets), see Sect. 4.2.  ... 
doi:10.1007/978-3-540-28629-5_8 fatcat:5el7wd3umvgdzhw4dxukeugoci

Choreographic Development of Message-Passing Applications [chapter]

Alex Coto, Roberto Guanciale, Emilio Tuosto
2020 Lecture Notes in Computer Science  
This operation can be done either by inferring the model from the code (if possible) or by learning it by observing the behaviour of the new version of the component.  ...  A possible way of representing local views is by communicating finite-state machines [6] which basically are finitestate automata where transitions are labelled by communication actions.  ... 
doi:10.1007/978-3-030-50029-0_2 fatcat:5hclbo55p5betpw6wqwensa4nm

Page 3183 of Mathematical Reviews Vol. , Issue 98E [page]

1998 Mathematical Reviews  
for branching time and partial order (611-626); Manfred Droste and Paul Gastin, Asynchronous cellular automata for pomsets without auto-concurrency (627-638); Michaela Huhn, Action refinement and property  ...  Some of the papers are being reviewed individually. } 98e:68004 68-06 68Q45 68TO0S * Grammatical inference: learning syntax from sentences.  ... 

Distributed Computation as Hierarchy [article]

Michael Manthey
1998 arXiv   pre-print
The model uses mutual-exclusion to express sequence, and a new kind of hierarchy to replace event sequences, posets, and pomsets.  ...  Also related is Pratt's work with Chu spaces and automata [Pratt95] .  ...  We now learn that not having a block on p does not exclude having a block on q. What can we conclude?  ... 
arXiv:cs/9809019v1 fatcat:gh455v6is5acxmandmtahc4iiu

Active Learning for Sound Negotiations [article]

Anca Muscholl, Igor Walukiewicz
2021 arXiv   pre-print
We present two active learning algorithms for sound deterministic negotiations.  ...  Sound deterministic negotiations are models of distributed systems, a kind of Petri nets or Zielonka automata with additional structure.  ...  Active learning algorithms have been proposed for many extensions of deterministic finite automata: automata on infinite words, on trees, weighted automata, nominal automata, bi-monoids for pomset languages  ... 
arXiv:2110.02783v1 fatcat:b7fozdtdefhohgzx2k74zhbt54

Proceedings of the Third Workshop on Formal Integrated Development Environment

Kim G. Larsen
2017 Electronic Proceedings in Theoretical Computer Science  
Finite Tree Automata.  ...  Note that every trivial pomset is a parallel product of oneelement pomsets.  ...  The HDA in the center of Fig. 1 admits an accepting run (i, As series-parallel pomsets are N -free [5] , this shows that pomset labels of HDA runs are not necessarily series-parallel.  ... 
doi:10.4204/eptcs.240.0.1 fatcat:imfjolcxmrfm7kqiz523rbyj5i

Page 3233 of Mathematical Reviews Vol. , Issue 97E [page]

1997 Mathematical Reviews  
It is proved that the pomset equivalence is decidable and in fact is EXPTIME-complete.  ...  Summary: “A number of efficient learning algorithms achieve ex-  ... 

Time and information in sequential and concurrent computation [chapter]

Vaughan Pratt
1995 Lecture Notes in Computer Science  
This in contrast to factual conjunction, where two facts may be learned in either order (commutativity), and having learned a fact one learns nothing new by learning it again (idempotence).  ...  A pomset process, as a set of pomsets analogous to a trace process as a set of traces, may be understood as a Petri net with no branching at places.  ... 
doi:10.1007/bfb0026562 fatcat:peyenrws7redpolr7z44y6uorq

A Categorical Framework for Learning Generalised Tree Automata [article]

Gerco van Heerdt, Tobias Kappé, Jurriaan Rot, Matteo Sammartino, Alexandra Silva
2020 arXiv   pre-print
Automata learning is a popular technique used to automatically construct an automaton model from queries.  ...  We instantiate the abstract theory to a large class of Set functors, by which we recover for the first time practical tree automata learning algorithms from an abstract framework and at the same time obtain  ...  This excludes more complex models such as that of pomset automata, which feature languages of words modulo complex equations.  ... 
arXiv:2001.05786v1 fatcat:pevfelvmcjedfmcpj43na4kpva

Brzozowski Goes Concurrent-A Kleene Theorem for Pomset Languages *

Tobias Kappé, Paul Brunet, Bas Luttik, Alexandra Silva, Fabio Zanasi
unpublished
We present a new automaton model and a Kleene-like theorem that relates a relaxed version of CKA to series-parallel pomset languages, which are a natural candidate for the free model.  ...  There are two substantial differences with previous work: from expressions to automata, we use Brzozowski derivatives, which enable a direct construction of the automaton; from automata to expressions,  ...  whereas pomset automata distinguish based on the origin states of traces.  ... 
fatcat:kzabgvys4vb6vehzesexluhfyy

Subject index volumes 1–200

1999 Theoretical Computer Science  
, 3832 codings. 2784 congruence, 2271 continuity of -, 664 equivalence, 700, 1623,2102,2641 equivalence, pomset -, 2373 equivalences, 3389 function on algebras, 1815 information, 3457 invariant  ...  , 2052 low -, 2357 magic -, 2370, 2682 maintaining disjoint -. 2252 not helping any set, 1000 NP-complete -, 2507 NP-hard -, 2308 NP-simple -, 2288 sets of constraints, 3625 formulas, 830 pomsets  ... 
doi:10.1016/s0304-3975(98)00319-3 fatcat:s22ud3iiqjht7lfbtc3zctk7zm
« Previous Showing results 1 — 15 out of 40 results