- CSB - MetaPress - Google - Bing - Yahoo
 | 2013 | |
|---|---|---|
| i1 |      | Piotr Hofman, Richard Mayr, Patrick Totzke: Decidability of Weak Simulation on One-counter Nets. CoRR abs/1304.4104 (2013) |
| 2012 | ||
| c4 | | Wojciech Czerwinski, Piotr Hofman, Slawomir Lasota: Reachability Problem for Weak Multi-Pushdown Automata. CONCUR 2012: 53-68 |
| c3 | | Piotr Hofman, Patrick Totzke: Approximating Weak Bisimilarity of Basic Parallel Processes. DCM 2012: 99-113 |
| 2011 | ||
| c2 | | Wojciech Czerwinski, Piotr Hofman, Slawomir Lasota: Decidability of Branching Bisimulation on Normed Commutative Context-Free Processes. CONCUR 2011: 528-542 |
| 2010 | ||
| c1 | | Diego Figueira, Piotr Hofman, Slawomir Lasota: Relating timed and register automata. EXPRESS'10 2010: 61-75 |
| 1 | Wojciech Czerwinski | |
| 2 | Diego Figueira | |
| 3 | Slawomir Lasota | |
| 4 | Richard Mayr | |
| 5 | Patrick Totzke |
Colors in the list of coauthors
Last update Sun May 26 05:23:18 2013 CET by the DBLP Team —
Data released under the ODC-BY 1.0 license — See also our legal information page