Language-Based Comparison of Petri Nets with Black Tokens, Pure Names and Ordered Data
From MaRDI portal
Publication:3564891
DOI10.1007/978-3-642-13089-2_44zbMath1284.68433DBLPconf/lata/VelardoD10OpenAlexW1833466413WikidataQ57831224 ScholiaQ57831224MaRDI QIDQ3564891
Fernando Rosa-Velardo, Giorgio Delzanno
Publication date: 26 May 2010
Published in: Language and Automata Theory and Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-642-13089-2_44
Formal languages and automata (68Q45) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)
This page was built for publication: Language-Based Comparison of Petri Nets with Black Tokens, Pure Names and Ordered Data
