| Publication | Date of Publication | Type |
|---|
Dualities between nets and automata induced by schizophrenic objects
Category Theory and Computer Science | 2022-12-16 | Paper |
Stratified petri nets
Fundamentals of Computation Theory | 2022-12-09 | Paper |
Polynomial algorithms for the synthesis of bounded nets
TAPSOFT '95: Theory and Practice of Software Development | 2022-08-18 | Paper |
Context-free event domains are recognizable
Algebraic Methodology and Software Technology | 2022-08-16 | Paper |
Supervisory Control for Opacity
IEEE Transactions on Automatic Control | 2017-08-25 | Paper |
Petri net synthesis
Texts in Theoretical Computer Science. An EATCS Series | 2015-12-16 | Paper |
Petri net distributability
Perspectives of Systems Informatics | 2015-12-07 | Paper |
Enforcing opacity of regular predicates on modal transition systems
Discrete Event Dynamic Systems | 2015-06-12 | Paper |
Distributed Control of Discrete-Event Systems: A First Step
Transactions on Petri Nets and Other Models of Concurrency VI | 2013-03-13 | Paper |
Petri net reachability graphs: decidability status of first order properties
Logical Methods in Computer Science | 2012-10-22 | Paper |
Petri net reachability graphs: decidability status of FO properties
| 2012-08-31 | Paper |
Deciding Selective Declassification of Petri Nets
Lecture Notes in Computer Science | 2012-06-29 | Paper |
Separability in persistent Petri nets
| 2012-03-22 | Paper |
Assembling Sessions
Automated Technology for Verification and Analysis | 2011-10-07 | Paper |
Quasi-static scheduling of communicating tasks
Information and Computation | 2010-10-07 | Paper |
Separability in Persistent Petri Nets
Applications and Theory of Petri Nets | 2010-06-22 | Paper |
Equality of languages coincides with isomorphism of reachable state graphs for bounded and persistent Petri nets
Information Processing Letters | 2009-12-04 | Paper |
Synthesis of nets with step firing policies
Fundamenta Informaticae | 2009-11-30 | Paper |
Modular synthesis of Petri nets from regular languages
| 2009-07-27 | Paper |
A decomposition theorem for finite persistent transition systems
Acta Informatica | 2009-05-08 | Paper |
Quasi-Static Scheduling of Communicating Tasks
CONCUR 2008 - Concurrency Theory | 2008-11-25 | Paper |
Decomposition Theorems for Bounded Persistent Petri Nets
Applications and Theory of Petri Nets | 2008-07-03 | Paper |
Synthesis of Nets with Step Firing Policies
Applications and Theory of Petri Nets | 2008-07-03 | Paper |
On the Synthesis of Zero-Safe Nets
Concurrency, Graphs and Models | 2008-06-19 | Paper |
scientific article; zbMATH DE number 5286860 (Why is no real title available?)
| 2008-06-11 | Paper |
Products of Message Sequence Charts
Foundations of Software Science and Computational Structures | 2008-04-11 | Paper |
Concurrent secrets
Discrete Event Dynamic Systems | 2008-01-04 | Paper |
Making Petri nets safe and free of internal transitions
| 2008-01-02 | Paper |
Lectures on Concurrency and Petri Nets
Lecture Notes in Computer Science | 2005-12-23 | Paper |
Transition systems without transitions
Theoretical Computer Science | 2005-06-30 | Paper |
The synthesis of Petri nets from path-automatic specifications
Information and Computation | 2004-10-01 | Paper |
scientific article; zbMATH DE number 1973126 (Why is no real title available?)
| 2003-09-01 | Paper |
Linear control of live marked graphs
Automatica | 2003-04-27 | Paper |
scientific article; zbMATH DE number 1820097 (Why is no real title available?)
| 2003-03-20 | Paper |
Distributing finite automata through Petri net synthesis
Formal Aspects of Computing | 2002-12-01 | Paper |
scientific article; zbMATH DE number 1696446 (Why is no real title available?)
| 2002-06-13 | Paper |
scientific article; zbMATH DE number 1746448 (Why is no real title available?)
| 2002-05-28 | Paper |
On the Petri net realization of context-free graphs
Theoretical Computer Science | 2001-08-20 | Paper |
scientific article; zbMATH DE number 1305001 (Why is no real title available?)
| 1999-06-17 | Paper |
Context-free event domains are recognizable
Information and Computation | 1999-05-03 | Paper |
The synthesis problem for elementary net systems is NP-complete
Theoretical Computer Science | 1998-06-30 | Paper |
scientific article; zbMATH DE number 1302048 (Why is no real title available?)
| 1998-01-01 | Paper |
Trace nets and process automata
Acta Informatica | 1996-02-13 | Paper |
Refinement of actions in event structures and causal trees
Theoretical Computer Science | 1993-12-06 | Paper |
Proof systems for infinite behaviours
Information and Computation | 1992-09-27 | Paper |
Fairness, distances and degrees
Theoretical Computer Science | 1992-09-27 | Paper |
On guarded recursion
Theoretical Computer Science | 1991-01-01 | Paper |
scientific article; zbMATH DE number 4185040 (Why is no real title available?)
| 1991-01-01 | Paper |
scientific article; zbMATH DE number 4213438 (Why is no real title available?)
| 1990-01-01 | Paper |
scientific article; zbMATH DE number 4199644 (Why is no real title available?)
| 1990-01-01 | Paper |
scientific article; zbMATH DE number 3995044 (Why is no real title available?)
| 1987-01-01 | Paper |
scientific article; zbMATH DE number 3900141 (Why is no real title available?)
| 1985-01-01 | Paper |
About fair asynchrony
Theoretical Computer Science | 1985-01-01 | Paper |
scientific article; zbMATH DE number 3926216 (Why is no real title available?)
| 1985-01-01 | Paper |
