Eike Best

Fundam. Informaticae, 2015

Analysis of Petri Nets and Transition Systems.

[BibT_eX]

[DOI]

Uli Schlachter

Proceedings of the Proceedings 8th Interaction and Concurrency Experience, 2015

State space axioms for T-systems.

[BibT_eX]

[DOI]

Acta Informatica, 2015

Synthesis and reengineering of persistent systems.

[BibT_eX]

[DOI]

Acta Informatica, 2015

Synthesis of Bounded Choice-Free Petri Nets.

[BibT_eX]

[DOI]

Proceedings of the 26th International Conference on Concurrency Theory, 2015

On Binary Words Being Petri Net Solvable.

[BibT_eX]

[DOI]

Proceedings of the International Workshop on Algorithms & Theories for the Analysis of Event Data, 2015

2014

Characterisation of the State Spaces of Live and Bounded Marked Graph Petri Nets.

[BibT_eX]

[DOI]

Proceedings of the Language and Automata Theory and Applications, 2014

Synthesis of Persistent Systems.

[BibT_eX]

[DOI]

Proceedings of the Application and Theory of Petri Nets and Concurrency, 2014

2013

Structure Theory of Petri Nets.

[BibT_eX]

[DOI]

Harro Wimmel

Trans. Petri Nets Other Model. Concurr., 2013

2012

Unifying Equivalences for Higher Dimensional Automata.

[BibT_eX]

[DOI]

Elena S. Oshevskaya

Irina B. Virbitskaite

Fundam. Informaticae, 2012

Deciding Selective Declassification of Petri Nets.

[BibT_eX]

[DOI]

Proceedings of the Principles of Security and Trust - First International Conference, 2012

Unifying Equivalences for Timed Transition Systems.

[BibT_eX]

[DOI]

Irina B. Virbitskaite

Natalya Gribovskaya

Proceedings of the Turing-100, 2012

2011

Separability in Persistent Petri Nets.

[BibT_eX]

[DOI]

Fundam. Informaticae, 2011

Petri Net Distributability.

[BibT_eX]

[DOI]

Proceedings of the Perspectives of Systems Informatics, 2011

2010

A Categorical View of Timed Behaviours.

[BibT_eX]

[DOI]

Irina B. Virbitskaite

Natalya Gribovskaya

Fundam. Informaticae, 2010

On the Decidability of Non Interference over Unbounded Petri Nets

[BibT_eX]

[DOI]

Roberto Gorrieri

Proceedings of the Proceedings 8th International Workshop on Security Issues in Concurrency, 2010

2009

A decomposition theorem for finite persistent transition systems.

[BibT_eX]

[DOI]

Acta Informatica, 2009

2008

Relational Semantics Revisited.

[BibT_eX]

[DOI]

Kerstin Strecker

Proceedings of the Fifth Workshop on Structural Operational Semantics, 2008

A Slicing Technique for Business Processes.

[BibT_eX]

[DOI]

Astrid Rakow

Proceedings of the Information Systems and e-Business Technologies, 2008

A Note on Persistent Petri Nets.

[BibT_eX]

[DOI]

Proceedings of the Concurrency, 2008

Decomposition Theorems for Bounded Persistent Petri Nets.

[BibT_eX]

[DOI]

Proceedings of the Applications and Theory of Petri Nets, 29th International Conference, 2008

2007

Making Petri Nets Safe and Free of Internal Transitions.

[BibT_eX]

[DOI]

Harro Wimmel

Fundam. Informaticae, 2007

2006

Separability in Conflict-Free Petri Nets.

[BibT_eX]

[DOI]

Proceedings of the Perspectives of Systems Informatics, 2006

2003

Process Algebra: A Petri-Net-Oriented Tutorial.

[BibT_eX]

[DOI]

Proceedings of the Lectures on Concurrency and Petri Nets, 2003

2002

The Box Algebra = Petri Nets + Process Expressions.

[BibT_eX]

[DOI]

Inf. Comput., 2002

2001

Recursion and Petri nets.

[BibT_eX]

[DOI]

Acta Informatica, 2001

A Unified Model for Nets and Process Algebras.

[BibT_eX]

[DOI]

Proceedings of the Handbook of Process Algebra, 2001

Petri net algebra.

[BibT_eX]

[DOI]

Monographs in Theoretical Computer Science. An EATCS Series, Springer, ISBN: 978-3-662-04457-5, 2001

2000

Reducing k -Safe Petri Nets to Pomset-Equivalent 1-Safe Petri Nets.

[BibT_eX]

[DOI]

Harro Wimmel

Proceedings of the Application and Theory of Petri Nets 2000, 2000

1999

Operational and Denotational Semantics for the Box Algebra.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 1999

Generalised Composition Operations for High-level Petri Nets.

[BibT_eX]

[DOI]

Alexander Lavrov

Fundam. Informaticae, 1999

Weak and Strong Composition of High-Level Petri-Nets.

[BibT_eX]

[DOI]

Alexander Lavrov

Proceedings of the CONCUR '99: Concurrency Theory, 1999

The Box Algebra - A Model of Nets and Process Expressions.

[BibT_eX]

[DOI]

Proceedings of the Application and Theory of Petri Nets 1999, 1999

1998

M-Nets: An Algebra of High-Level Petri Nets, with an Application to the Semantics of Concurrent Programming Languages.

[BibT_eX]

[DOI]

Acta Informatica, 1998

1997

Refinement of Coloured Petri Nets.

[BibT_eX]

[DOI]

Thomas Thielke

Proceedings of the Fundamentals of Computation Theory, 11th International Symposium, 1997

Partial Order and SOS Semantics for Linear Constraint Programs.

[BibT_eX]

[DOI]

Frank S. de Boer

Catuscia Palamidessi

Proceedings of the Coordination Languages and Models, Second International Conference, 1997

Orthogonal Transformations for Coloured Petri Nets.

[BibT_eX]

[DOI]

Thomas Thielke

Proceedings of the Application and Theory of Petri Nets 1997, 1997

1996

Some Major Dichotomies Relating to Future Research in Concurrency.

[BibT_eX]

[DOI]

ACM Comput. Surv., 1996

PEP - More than a Petri Net Tool.

[BibT_eX]

[DOI]

Bernd Grahlmann

Proceedings of the Tools and Algorithms for Construction and Analysis of Systems, 1996

Partial order verification with PEP.

[BibT_eX]

[DOI]

Proceedings of the Partial Order Methods in Verification, Proceedings of a DIMACS Workshop, 1996

Linear Constraint Systems as High-Level Nets.

[BibT_eX]

[DOI]

Catuscia Palamidessi

Proceedings of the CONCUR '96, 1996

Petri Nets, Process Algebras and Concurrent Programming Languages.

[BibT_eX]

[DOI]

Proceedings of the Lectures on Petri Nets II: Applications, 1996

Semantics of sequential and parallel programs.

[BibT_eX]

Prentice Hall International series in computer science, Prentice Hall, ISBN: 978-0-13-460643-9, 1996

1995

Using net refinement to compute the fixpoint of a recursive.

[BibT_eX]

[DOI]

Proceedings of the Joint COMPUGRAPH/SEMAGRAPH Workshop on Graph Rewriting and Computation, 1995

An M-net Semantics of B(PN)2.

[BibT_eX]

[DOI]

Proceedings of the International Workshop on Structures in Concurrency Theory, 1995

CALIBAN - Esprit Basic Research WG 6067.

[BibT_eX]

[DOI]

Proceedings of the International Workshop on Structures in Concurrency Theory, 1995

Solving Recursive Net Equations.

[BibT_eX]

[DOI]

Proceedings of the Automata, Languages and Programming, 22nd International Colloquium, 1995

Concurrent Constraint Programming with Information Removal.

[BibT_eX]

Frank S. de Boer

Catuscia Palamidessi

Proceedings of the First International Workshop on Concurrent Constraint Programming, 1995

A Refined View of the Box Algebra.

[BibT_eX]

[DOI]

Proceedings of the Application and Theory of Petri Nets 1995, 1995

A Class of Composable High Level Petri Nets with an Application to the Semantics of B(PN)<sup>2</sup>.

[BibT_eX]

[DOI]

Proceedings of the Application and Theory of Petri Nets 1995, 1995

Semantik - Theorie sequentieller und paralleler Programmierung.

[BibT_eX]

Lehrbuch Informatik, Vieweg, ISBN: 978-3-528-05431-1, 1995

1994

A Memory Module Specification Using Composable High-Level Petri Nets.

[BibT_eX]

[DOI]

Proceedings of the Formal Systems Specification, 1994

Operational Semantics for the Petri Box Calculus.

[BibT_eX]

[DOI]

Proceedings of the CONCUR '94, 1994

1993

General Refinement and Recursion Operators for the Petri Box Calculus.

[BibT_eX]

[DOI]

Proceedings of the STACS 93, 1993

B(PN)<sup>2</sup> - a Basic Petri Net Programming Notation.

[BibT_eX]

[DOI]

Richard P. Hopkins

Proceedings of the PARLE '93, 1993

Compositional Process Semantics of Petri Boxes.

[BibT_eX]

[DOI]

Hans-Günther Linde-Göers

Proceedings of the Mathematical Foundations of Programming Semantics, 1993

1992

Petri Net Semantics of Priority Systems.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 1992

Traps Characterize Home States in Free Choice Systems.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 1992

Results of the esprit basic research action 3148 demon (design methods based on nets).

[BibT_eX]

[DOI]

Microprocess. Microprogramming, 1992

Compositional Generation of Home States in Free Choice Nets.

[BibT_eX]

[DOI]

Ludmila Cherkasova

Formal Aspects Comput., 1992

The box calculus: a new causal algebra with multi-label communication.

[BibT_eX]

[DOI]

Jon G. Hall

Proceedings of the Advances in Petri Nets 1992, The DEMON Project, 1992

Esprit Basic Research Action 3148 DEMON (design methods based on nets).

[BibT_eX]

[DOI]

Proceedings of the Advances in Petri Nets 1992, The DEMON Project, 1992

1991

Concurrent Bisimulations in Petri Nets.

[BibT_eX]

[DOI]

Acta Informatica, 1991

Compositional Generation of Home States in Free Choice Systems.

[BibT_eX]

[DOI]

Ludmila Cherkasova

Proceedings of the STACS 91, 1991

Overview of the Results of the Esprit Basic Research Action DEMON - Design Methods Based on Nets.

[BibT_eX]

[DOI]

Proceedings of the Fourth International Workshop on Petri Nets and Performance Models, 1991

Model Checking of Persistent Petri Nets.

[BibT_eX]

[DOI]

Proceedings of the Computer Science Logic, 5th Workshop, 1991

1990

Partial Order Behaviour and Structure of Petri Nets.

[BibT_eX]

[DOI]

Formal Aspects Comput., 1990

Partial Order Semantics of Concurrent Programs (Abstract).

[BibT_eX]

[DOI]

Proceedings of the CONCUR '90, 1990

1989

Semantic Independence.

[BibT_eX]

[DOI]

Christian Lengauer

Sci. Comput. Program., 1989

1988

Nonsequential Processes - A Petri Net View

[BibT_eX]

[DOI]

César Fernández

EATCS Monographs on Theoretical Computer Science 13, Springer, ISBN: 978-3-642-73483-0, 1988

Weighted Basic Petri Nets.

[BibT_eX]

[DOI]

Proceedings of the Concurrency 88: International Conference on Concurrency, 1988

Design Methods Based on Nets, Esprit Basic Research Action DEMON.

[BibT_eX]

[DOI]

Proceedings of the Advances in Petri Nets 1989, 1988

Kausale Semantik nichtsequentieller Programme.

[BibT_eX]

PhD thesis, 1988

1987

Sequential and Concurrent Behaviour in Petri Net Theory.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 1987

Interleaving and partial orders in concurrency: a formal comparison.

[BibT_eX]

Proceedings of the Formal Description of Programming Concepts - III: Proceedings of the IFIP TC 2/WG 2.2 Working Conference on Formal Description of Programming Concepts, 1987

1986

Structure Theory of Petri Nets: the Free Choice Hiatus.

[BibT_eX]

[DOI]

Proceedings of the Petri Nets: Central Models and Their Properties, 1986

COSY: Its Relation to Nets and CSP.

[BibT_eX]

[DOI]

Proceedings of the Petri Nets: Central Models and Their Properties, 1986

1985

Comments on "Self-Stabilizing Programs: The Fault-Tolerant Capability of Self-Checking Programs".

[BibT_eX]

[DOI]

Flaviu Cristian

IEEE Trans. Computers, 1985

1984

Fairness and Conspiracies.

[BibT_eX]

[DOI]

Inf. Process. Lett., 1984

Free Choice Systems Have Home States.

[BibT_eX]

[DOI]

Klaus Voss

Acta Informatica, 1984

Formale Methoden zur Erstellung robuster Software.

[BibT_eX]

[DOI]

Proceedings of the Software-Fehlertoleranz und -Zuverlässigkeit, 1984

Concurrent Behaviour: Sequences, Processes and Axioms.

[BibT_eX]

[DOI]

Proceedings of the Seminar on Concurrency, 1984

Frozen tokens and D-continuity: A study in relating system properties to process properties.

[BibT_eX]

[DOI]

Agathe Merceron

Proceedings of the Advances in Petri Nets 1984, 1984

Concurrency axioms and D-continuous posets.

[BibT_eX]

[DOI]

Agathe Merceron

Proceedings of the Advances in Petri Nets 1984, 1984

1983

Discreteness, k-density and d-continuity of occurrence nets.

[BibT_eX]

[DOI]

Agathe Merceron

Proceedings of the Theoretical Computer Science, 1983

Some Equivalence Results for Free Choice Nets and Simple Nets and on the Periodicity of Live Free Choice Nets.

[BibT_eX]

[DOI]

M. W. Shields

Proceedings of the CAAP'83, 1983

1982

Adequacy Properties of Path Programs.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 1982

Relational Semantics of Concurrent Programs (With Some Applications).

[BibT_eX]

Proceedings of the Formal Description of Programming Concepts : Proceedings of the IFIP Working Conference on Formal Description of Programming Concepts- II, 1982

1981

Systematic Detection of Exception Occurrences.

[BibT_eX]

[DOI]

Flaviu Cristian

Sci. Comput. Program., 1981

A Formal Model of Atomicity in Asynchronous Systems.

[BibT_eX]

[DOI]

Brian Randell

Acta Informatica, 1981

Information Flow in Nets.

[BibT_eX]

[DOI]

Proceedings of the Application and Theory of Petri Nets, 1981

Overview on Topic 3: Information Flow and Concurrency.

[BibT_eX]

[DOI]

Proceedings of the Application and Theory of Petri Nets, 1981

1980

A theorem on the characteristics of nonsequential processes.

[BibT_eX]

Fundam. Informaticae, 1980

Proof of a Concurrent Program Finding Euler Paths.

[BibT_eX]

[DOI]

Proceedings of the Mathematical Foundations of Computer Science 1980 (MFCS'80), 1980

1979

A Note on the Proof of a Concurrent Program.

[BibT_eX]

[DOI]

Inf. Process. Lett., 1979

Design & Analysis of Highly Parallel & Distributed Systems.

[BibT_eX]

[DOI]

Peter E. Lauer

M. W. Shields

Proceedings of the Abstract Software Specifications, 1979 Copenhagen Winter School, January 22, 1979

Adequacy of Path Programs.

[BibT_eX]

[DOI]

Proceedings of the Net Theory and Applications, 1979

The Relative Strength of K-Density.

[BibT_eX]

[DOI]

Proceedings of the Net Theory and Applications, 1979

Atomicity of Activities.

[BibT_eX]

[DOI]

Proceedings of the Net Theory and Applications, 1979

1977

On the Problem of Achieving Adequacy of Concurrent Programs.

[BibT_eX]

Peter E. Lauer

Michael W. Shields

Proceedings of the Formal Description of Programming Concepts: Proceedings of the IFIP Working Conference on Formal Description of Programming Concepts, 1977

1975

Systems of Open Paths in Petri Nets.

[BibT_eX]

[DOI]

Hans Albrecht Schmid

Proceedings of the Mathematical Foundations of Computer Science 1975, 1975

Martierte Petrinetze und Sigma-Teilsysteme.

[BibT_eX]

[DOI]