- TAPAAL: Editor, Simulator and Verifier of Timed-Arc Petri Nets
- Electronic Notes in Theoretical Computer Science 39 No. 1 (2000) URL: http://www.elsevier.nl/locate/entcs/volume39.html 15 pages
- Under consideration for publication in Math. Struct. in Comp. Science Complexity of Weak Bisimilarity and
- INFINITY 2003 Preliminary Version Completeness Results for Undecidable
- !"$&'+,-.012345yA| Context-free Process Algebras
- Undecidability Results for Bisimilarity on Prefix Rewrite Systems
- Checking Thorough Refinement on Modal Transition Systems Is EXPTIME-Complete
- Teaching Concurrency: Theory in Practice Luca Aceto1
- International Conference on Computer Systems and Technologies -CompSysTech'10 An Experiment with Using Google Tools
- Recursion vs. Replication in Simple Cryptographic Protocols
- Towards a Notion of Distributed Time for Petri Nets
- Properties of Distributed Timed-Arc Petri Nets Mogens Nielsen1
- Timed-Arc Petri Nets vs. Networks of Timed Automata
- Height-Deterministic Pushdown Automata Dirk Nowotka1
- A Framework for Relating Timed Transition Systems and Preserving TCTL Model Checking
- Modelling and Verification of Web Services Business Activity Protocol
- Strong Bisimilarity and Regularity of Basic Parallel Processes is PSPACE-Hard
- Undecidability of Weak Bisimilarity for PA-Processes
- Verification of Timed-Arc Petri Nets Lasse Jacobsen, Morten Jacobsen, Mikael H. Mller, and Jiri Srba
- A Formal Analysis of the Web Services Atomic Transaction Protocol with UPPAAL
- An Efficient Translation of Timed-Arc Petri Nets to Networks of Timed Automata
- Infinite Runs in Weighted Timed Automata with Energy Constraints
- Roadmap of Infinite Results Jir Srba #
- Selected Techniques for Verification of Infinite-State Systems
- opaal: A Lattice Model Checker Andreas Engelbredt Dalsgaard, Rene Rydhof Hansen, Kenneth Yrke Jrgensen,
- Energy Games in Multiweighted Automata Uli Fahrenberg1
- Comparing the Expressiveness of Timed Automata and Timed Extensions of Petri Nets
- Monotonic Set-Extended Prefix Rewriting and Verification of Recursive Ping-Pong Protocols
- Visibly Pushdown Automata: From Language Equivalence to Simulation and Bisimulation
- On Counting the Number of Consistent Genotype Assignments for Pedigrees
- Undecidability of Weak Bisimilarity for Pushdown Processes
- Strong Bisimilarity and Regularity of Basic Process Algebra Is PSPACE-Hard
- Note on the Tableau Technique for Commutative Transition Systems
- On the Power of Labels in Transition Systems Dept. of Computer Science, University of Aarhus, Denmark
- Matching Modulo Associativity and Idempotency is NPcomplete
- Pattern Equations and Equations with Ivana Cerna1
- On Determinism in Modal Transition Systems N. Benes1,2
- Acta Informatica manuscript No. (will be inserted by the editor)
- Basic Process Algebra Deadlocking States
- Decidability and Complexity Issues for Infinite-State Processes
- Applications of the Existential Quantification
- Roadmap of Infinite Results Department of Computer Science, University of Aalborg
- Deadlocking States in Context-free Process Algebra
- Parametric Modal Transition Systems Nikola Benes2
- Tool Supported Analysis of Web Services Protocols
- Modal Transition Systems with Weight Intervals , Kim G. Larsen, Jiri Srba1
- Under consideration for publication in Math. Struct. in Comp. Science Extending Modal Transition Systems
- Dual-Priced Modal Transition Systems with Time Durations
