Over-Approximative Petri Net Synthesis for Restricted Subclasses of Nets

Autor:	Uli Schlachter
Rok vydání:	2018
Předmět:	Discrete mathematics TheoryofComputation_COMPUTATIONBYABSTRACTDEVICES Region theory Preorder Computer Science::Software Engineering 020207 software engineering 02 engineering and technology Petri net TheoryofComputation_LOGICSANDMEANINGSOFPROGRAMS Computer Science::Logic in Computer Science Bounded function Hardware_INTEGRATEDCIRCUITS 0202 electrical engineering electronic engineering information engineering 020201 artificial intelligence & image processing Computer Science::Formal Languages and Automata Theory Mathematics
Zdroj:	Language and Automata Theory and Applications ISBN: 9783319773124 LATA
Popis:	We show that, given a finite lts, there is a minimal bounded Petri net over-approximation according to a structural preorder and present an algorithm to compute this over-approximation. This result is extended to subclasses of nets, namely pure Petri nets, plain Petri nets, T-nets, and marked graphs, plus combinations of these properties.
Databáze:	OpenAIRE
Externí odkaz:	https://explore.openaire.eu/search/publication?articleId=doi_________::c16f84343b66312669e4cacfeaae2e7e https://doi.org/10.1007/978-3-319-77313-1_23 Zobrazit plný text záznamu