Petri Nets Are Less Expressive Than State-Extended PA
KŘETÍNSKÝ, Mojmír, Vojtěch ŘEHÁK and Jan STREJČEK. Petri Nets Are Less Expressive Than State-Extended PA. Theoretical Computer Science. Amsterdam, North Holland: Elsevier Science Publishers, 2008, vol. 394, 1-2, p. 134-140. ISSN 0304-3975. |
Other formats:
BibTeX
LaTeX
RIS
|
Basic information | |
---|---|
Original name | Petri Nets Are Less Expressive Than State-Extended PA |
Name in Czech | Petriho sítě mají menší vyjadřovací sílu než stavově-rozšířené PA |
Authors | KŘETÍNSKÝ, Mojmír (203 Czech Republic), Vojtěch ŘEHÁK (203 Czech Republic) and Jan STREJČEK (203 Czech Republic, guarantor). |
Edition | Theoretical Computer Science, Amsterdam, North Holland, Elsevier Science Publishers, 2008, 0304-3975. |
Other information | |
---|---|
Original language | English |
Type of outcome | Article in a journal |
Field of Study | 10201 Computer sciences, information science, bioinformatics |
Country of publisher | Netherlands |
Confidentiality degree | is not subject to a state or trade secret |
Impact factor | Impact factor: 0.806 |
RIV identification code | RIV/00216224:14330/08:00024164 |
Organization unit | Faculty of Informatics |
UT WoS | 000255221900006 |
Keywords in English | Petri nets; PA processes; bisimulation |
Tags | bisimulation, PA processes, Petri nets |
Tags | International impact, Reviewed |
Changed by | Changed by: doc. RNDr. Vojtěch Řehák, Ph.D., učo 3721. Changed: 22/5/2009 16:55. |
Abstract |
---|
We show that the class of Petri nets is less expressive with respect to bisimulation equivalence than the class of PA processes extended with a finite state control unit. |
Abstract (in Czech) |
---|
Ukážeme, že třída Petriho sítí má menší vyjadřovací sílu vzhledem k bisimulační ekvivalenci než třída PA procesů rozšířených o konečně-stavovou řídící jednotku. |
Links | |
---|---|
GA201/06/1338, research and development project | Name: Automatizovaná verifikace softwaru |
Investor: Czech Science Foundation, Automated software verification | |
GP201/08/P375, research and development project | Name: Formální verifikace: algoritmy, vlastnosti modelovacích formalismů a temporálních logik |
Investor: Czech Science Foundation, Formal verification: algorithms, properties of modelling formalisms amd temporal logics | |
GP201/08/P459, research and development project | Name: Nové možnosti automatické verifikace síťových protokolů |
Investor: Czech Science Foundation, New possibilities in automatic verification of network protocols | |
MSM0021622419, plan (intention) | Name: Vysoce paralelní a distribuované výpočetní systémy |
Investor: Ministry of Education, Youth and Sports of the CR, Highly Parallel and Distributed Computing Systems | |
1ET408050503, research and development project | Name: Techniky automatické verifikace a validace softwarových a hardwarových systémů |
Investor: Academy of Sciences of the Czech Republic, Techniques for automatic verification and validation of software nad hardware systems | |
1M0545, research and development project | Name: Institut Teoretické Informatiky |
Investor: Ministry of Education, Youth and Sports of the CR, Institute for Theoretical Computer Science |
PrintDisplayed: 23/9/2024 15:03