| Publication | Date of Publication | Type |
|---|
Modal Open Petri Nets
Application and Theory of Petri Nets and Concurrency | 2024-01-29 | Paper |
Interface automata for shared memory
Lecture Notes in Computer Science | 2023-08-02 | Paper |
Efficiency of Token-Passing MUTEX-Solutions — Some Experiments
| 2022-12-09 | Paper |
Interface automata for shared memory
Acta Informatica | 2022-09-26 | Paper |
Stubborn Sets, Frozen Actions, and Fair Testing
Fundamenta Informaticae | 2021-05-21 | Paper |
scientific article; zbMATH DE number 7319030 (Why is no real title available?)
| 2021-03-10 | Paper |
scientific article; zbMATH DE number 7317251 (Why is no real title available?)
| 2021-03-03 | Paper |
scientific article; zbMATH DE number 7301461 (Why is no real title available?)
| 2021-01-26 | Paper |
A linear-time branching-time perspective on interface automata
Acta Informatica | 2020-05-26 | Paper |
Asynchronous communication of Petri nets and the refinement of transitions
Automata, Languages and Programming | 2019-12-04 | Paper |
Timed testing of concurrent systems
Automata, Languages and Programming | 2019-03-29 | Paper |
Fault-free refinements for interface automata
Scientific Annals of Computer Science | 2019-02-08 | Paper |
The limit of \(\operatorname{split}_n\)-language equivalence
Automata, Languages and Programming | 2019-01-10 | Paper |
Efficiency of asynchronous systems and read arcs in petri nets
Automata, Languages and Programming | 2018-07-04 | Paper |
ACTL for modal interface automata
Theoretical Computer Science | 2017-09-12 | Paper |
Nondeterministic modal interfaces
Theoretical Computer Science | 2016-07-20 | Paper |
Fair testing and stubborn sets
Model Checking Software | 2016-06-22 | Paper |
Error-pruning in interface automata
Theoretical Computer Science | 2015-08-17 | Paper |
Richer interface automata with optimistic and pessimistic compatibility
Acta Informatica | 2015-06-24 | Paper |
Nondeterministic modal interfaces
Lecture Notes in Computer Science | 2015-02-20 | Paper |
Error-pruning in interface automata
SOFSEM 2014: Theory and Practice of Computer Science | 2015-01-13 | Paper |
Recent advances in unfolding technique
Theoretical Computer Science | 2014-08-29 | Paper |
Undecidability of accordance for open systems with unbounded message queues
Information Processing Letters | 2014-08-28 | Paper |
Modular construction and partial order semantics of Petri nets
Lecture Notes in Computer Science | 2014-08-14 | Paper |
Fairness of components in system computations
| 2013-09-25 | Paper |
Modal interface automata
Logical Methods in Computer Science | 2013-09-06 | Paper |
Modal Interface Automata
Lecture Notes in Computer Science | 2012-09-21 | Paper |
A trace-based service semantics guaranteeing deadlock freedom
Acta Informatica | 2012-04-26 | Paper |
Safe reasoning with logic LTS
Theoretical Computer Science | 2011-07-07 | Paper |
A trace-based view on operating guidelines
Foundations of Software Science and Computational Structures | 2011-05-19 | Paper |
Ready simulation for concurrency: it's logical!
Information and Computation | 2010-08-18 | Paper |
Another short proof of optimality for the MIN cache replacement algorithm
Information Processing Letters | 2010-04-19 | Paper |
Relating fairness and timing in process algebras.
Lecture Notes in Computer Science | 2010-03-30 | Paper |
Avoiding irreducible CSC conflicts by internal communication
Fundamenta Informaticae | 2010-02-05 | Paper |
STG decomposition strategies in combination with unfolding
Acta Informatica | 2009-10-23 | Paper |
Liveness of a mutex algorithm in a fair process algebra
Acta Informatica | 2009-05-08 | Paper |
scientific article; zbMATH DE number 5507693 (Why is no real title available?)
| 2009-02-12 | Paper |
Time and Fairness in a Process Algebra with Non-blocking Reading
Lecture Notes in Computer Science | 2009-02-03 | Paper |
Safe Reasoning with Logic LTS
Lecture Notes in Computer Science | 2009-02-03 | Paper |
Stronger Reduction Criteria for Local First Search
Lecture Notes in Computer Science | 2008-09-11 | Paper |
Component refinement and CSC-solving for STG decomposition
Theoretical Computer Science | 2007-12-18 | Paper |
Ready Simulation for Concurrency: It’s Logical!
Automata, Languages and Programming | 2007-11-28 | Paper |
Foundations of Software Science and Computation Structures
Lecture Notes in Computer Science | 2007-09-28 | Paper |
Checking a Mutex Algorithm in a Process Algebra with Fairness
CONCUR 2006 – Concurrency Theory | 2007-09-04 | Paper |
Improved decomposition of signal transition graphs
| 2007-07-30 | Paper |
Foundations of Software Science and Computation Structures
Lecture Notes in Computer Science | 2007-05-02 | Paper |
Conjunction on processes: Full abstraction via ready-tree semantics
Theoretical Computer Science | 2007-04-13 | Paper |
Fair testing
Information and Computation | 2007-02-20 | Paper |
Performance of pipelined asynchronous systems
The Journal of Logic and Algebraic Programming | 2007-02-09 | Paper |
Merged processes: a new condensed representation of Petri net behaviour
Acta Informatica | 2006-12-06 | Paper |
Formal Modeling and Analysis of Timed Systems
Lecture Notes in Computer Science | 2006-11-14 | Paper |
CONCUR 2005 – Concurrency Theory
Lecture Notes in Computer Science | 2006-11-01 | Paper |
Formal Methods for the Design of Real-Time Systems
Lecture Notes in Computer Science | 2006-10-19 | Paper |
Bisimulation on speed: a unified approach
Theoretical Computer Science | 2006-09-14 | Paper |
Fairness of actions in system computations
Acta Informatica | 2006-09-12 | Paper |
Fairness of components in system computations
Theoretical Computer Science | 2006-05-29 | Paper |
Applications and Theory of Petri Nets 2005
Lecture Notes in Computer Science | 2005-12-14 | Paper |
Foundations of Software Science and Computational Structures
Lecture Notes in Computer Science | 2005-11-10 | Paper |
Foundations of Software Science and Computational Structures
Lecture Notes in Computer Science | 2005-11-10 | Paper |
Bisimulation on speed: Lower time bounds
RAIRO - Theoretical Informatics and Applications | 2005-09-01 | Paper |
Measuring the performance of asynchronous systems with PAFAS
Theoretical Computer Science | 2005-06-10 | Paper |
Canonical prefixes of Petri net unfoldings
Acta Informatica | 2004-12-09 | Paper |
scientific article; zbMATH DE number 2102738 (Why is no real title available?)
| 2004-09-24 | Paper |
Bisimulation on speed: Worst-case efficiency
Information and Computation | 2004-08-06 | Paper |
Comparing the worst-case efficiency of asynchronous systems with PAFAS
Acta Informatica | 2003-09-01 | Paper |
Faster asynchronous systems.
Information and Computation | 2003-08-19 | Paper |
scientific article; zbMATH DE number 1955908 (Why is no real title available?)
| 2003-07-29 | Paper |
scientific article; zbMATH DE number 1954396 (Why is no real title available?)
| 2003-07-28 | Paper |
scientific article; zbMATH DE number 1903382 (Why is no real title available?)
| 2003-05-01 | Paper |
scientific article; zbMATH DE number 1863169 (Why is no real title available?)
| 2003-02-03 | Paper |
Partial order semantics and read arcs
Theoretical Computer Science | 2002-08-13 | Paper |
Efficiency of asynchronous systems, read arcs, and the MUTEX-problem
Theoretical Computer Science | 2002-07-31 | Paper |
scientific article; zbMATH DE number 1696468 (Why is no real title available?)
| 2002-06-17 | Paper |
An improvement of McMillan's unfolding algorithm
Formal Methods in System Design | 2002-06-16 | Paper |
scientific article; zbMATH DE number 1755152 (Why is no real title available?)
| 2002-06-13 | Paper |
Fast asynchronous systems in dense time
Theoretical Computer Science | 2001-08-20 | Paper |
Axiomatizing a fragment of PAFAS
| 2001-05-08 | Paper |
Generalized OM-bisimulation
Information and Computation | 2000-07-04 | Paper |
scientific article; zbMATH DE number 1361506 (Why is no real title available?)
| 1999-11-10 | Paper |
scientific article; zbMATH DE number 1304999 (Why is no real title available?)
| 1999-06-17 | Paper |
Fairness and partial order semantics
Information Processing Letters | 1997-02-28 | Paper |
The limit of split\(_ n\)-language equivalence
Information and Computation | 1996-11-25 | Paper |
Timed testing of concurrent systems
Information and Computation | 1995-10-10 | Paper |
On hyperedge replacement and BNLC graph grammars
Discrete Applied Mathematics | 1993-12-10 | Paper |
Bisimulation and action refinement
Theoretical Computer Science | 1993-10-17 | Paper |
scientific article; zbMATH DE number 219258 (Why is no real title available?)
| 1993-06-29 | Paper |
scientific article; zbMATH DE number 176758 (Why is no real title available?)
| 1993-05-18 | Paper |
scientific article; zbMATH DE number 176514 (Why is no real title available?)
| 1993-05-18 | Paper |
scientific article; zbMATH DE number 177465 (Why is no real title available?)
| 1993-05-18 | Paper |
scientific article; zbMATH DE number 149517 (Why is no real title available?)
| 1993-04-01 | Paper |
Executions: A new partial-order semantics of Petri nets
Theoretical Computer Science | 1992-06-28 | Paper |
scientific article; zbMATH DE number 18633 (Why is no real title available?)
| 1992-06-26 | Paper |
scientific article; zbMATH DE number 965 (Why is no real title available?)
| 1992-06-25 | Paper |
A generalization of traces
RAIRO - Theoretical Informatics and Applications | 1991-01-01 | Paper |
Failures semantics based on interval semiwords is a congruence for refinement
Distributed Computing | 1991-01-01 | Paper |
scientific article; zbMATH DE number 4206024 (Why is no real title available?)
| 1990-01-01 | Paper |
On the synchronization of traces
Mathematical Systems Theory | 1989-01-01 | Paper |
Step failures semantics and a complete proof system
Acta Informatica | 1989-01-01 | Paper |
Failures semantics and deadlocking of modular Petri nets
Acta Informatica | 1989-01-01 | Paper |
Metatheorems for decision problems on hyperedge replacement graph languages
Acta Informatica | 1989-01-01 | Paper |
scientific article; zbMATH DE number 4060733 (Why is no real title available?)
| 1988-01-01 | Paper |
scientific article; zbMATH DE number 4064449 (Why is no real title available?)
| 1988-01-01 | Paper |
scientific article; zbMATH DE number 4072376 (Why is no real title available?)
| 1988-01-01 | Paper |
scientific article; zbMATH DE number 4079332 (Why is no real title available?)
| 1987-01-01 | Paper |
scientific article; zbMATH DE number 3990850 (Why is no real title available?)
| 1987-01-01 | Paper |
scientific article; zbMATH DE number 4087049 (Why is no real title available?)
| 1987-01-01 | Paper |
scientific article; zbMATH DE number 4049068 (Why is no real title available?)
| 1987-01-01 | Paper |
Representing abstract groups by powers of a graph
Journal of Combinatorial Theory. Series B | 1986-01-01 | Paper |
Representing groups by graphs with constant link and hypergraphs
Journal of Graph Theory | 1986-01-01 | Paper |
The square of a connected S(K1,3)-free graph is vertex pancyclic
Journal of Graph Theory | 1985-01-01 | Paper |
scientific article; zbMATH DE number 3896964 (Why is no real title available?)
| 1985-01-01 | Paper |
Some remarks on universal graphs
Combinatorica | 1985-01-01 | Paper |
Graphs with given group and given constant link
Journal of Graph Theory | 1984-01-01 | Paper |
