Raymond R. Devillers

Evgeny Erofeev

Trans. Petri Nets Other Model. Concurr., 2019

Analysis and Synthesis of Weighted Marked Graph Petri Nets: Exact and Approximate Methods.

[BibT_eX]

[DOI]

Fundam. Informaticae, 2019

Dynamic exploration of multi-agent systems with timed periodic tasks.

[BibT_eX]

[DOI]

Johan Arcile

CoRR, 2019

VerifCar: a framework for modeling and model checking communicating autonomous vehicles.

[BibT_eX]

[DOI]

Johan Arcile

Auton. Agents Multi Agent Syst., 2019

Synthesis of Weighted Marked Graphs from Circular Labelled Transition Systems.

[BibT_eX]

[DOI]

Evgeny Erofeev

Proceedings of the International Workshop on Algorithms & Theories for the Analysis of Event Data 2019 Satellite event of the conferences: 40th International Conference on Application and Theory of Petri Nets and Concurrency Petri Nets 2019 and 19th International Conference on Application of Concurrency to System Design ACSD 2019, 2019

Articulation of Transition Systems and Its Application to Petri Net Synthesis.

[BibT_eX]

[DOI]

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

2018

Pre-synthesis of Petri nets based on prime cycles and distance paths.

[BibT_eX]

[DOI]

Sci. Comput. Program., 2018

On Deadlockability, Liveness and Reversibility in Subclasses of Weighted Petri Nets.

[BibT_eX]

[DOI]

Fundam. Informaticae, 2018

Simultaneous Petri Net Synthesis.

[BibT_eX]

[DOI]

Sci. Ann. Comput. Sci., 2018

Factorisation of transition systems.

[BibT_eX]

[DOI]

Acta Informatica, 2018

Bounded choice-free Petri net synthesis: algorithmic issues.

[BibT_eX]

[DOI]

Uli Schlachter

Acta Informatica, 2018

Factorisation of Petri Net Solvable Transition Systems.

[BibT_eX]

[DOI]

Uli Schlachter

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

Analysis and Synthesis of Weighted Marked Graph Petri Nets.

[BibT_eX]

[DOI]

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

Synthesis of Weighted Marked Graphs from Constrained Labelled Transition Systems.

[BibT_eX]

[DOI]

Evgeny Erofeev

Proceedings of the International Workshop on Algorithms & Theories for the Analysis of Event Data 2018 Satellite event of the conferences: 39th International Conference on Application and Theory of Petri Nets and Concurrency Petri Nets 2018 and 18th International Conference on Application of Concurrency to System Design ACSD 2018, 2018

2017

Characterisation of the state spaces of marked graph Petri nets.

[BibT_eX]

[DOI]

Inf. Comput., 2017

A Graph-Theoretical Characterisation of State Separation.

[BibT_eX]

[DOI]

Uli Schlachter

Proceedings of the SOFSEM 2017: Theory and Practice of Computer Science, 2017

Modeling and checking robustness of communicating autonomous vehicles.

[BibT_eX]

[DOI]

Bozena Wozna-Szczesniak

Proceedings of the Distributed Computing and Artificial Intelligence, 2017

On Liveness and Deadlockability in Subclasses of Weighted Petri Nets.

[BibT_eX]

[DOI]

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

2016

Preface.

[BibT_eX]

[DOI]

Antti Valmari

Wojciech Penczek

Fundam. Informaticae, 2016

Minimal Elements for the Prime Numbers.

[BibT_eX]

[DOI]

Curtis Bright

Jeffrey O. Shallit

Exp. Math., 2016

Abstraction Strategies for Computing Travelling or Looping Durations in Networks of Timed Automata.

[BibT_eX]

[DOI]

Proceedings of the Formal Modeling and Analysis of Timed Systems, 2016

The Power of Prime Cycles.

[BibT_eX]

[DOI]

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

Products of Transition Systems and Additions of Petri Nets.

[BibT_eX]

[DOI]

Proceedings of the 16th International Conference on Application of Concurrency to System Design, 2016

2015

Synthesis of Live and Bounded Persistent Systems.

[BibT_eX]

[DOI]

Fundam. Informaticae, 2015

Indefinite waitings in MIRELA systems.

[BibT_eX]

[DOI]

Proceedings of the Proceedings 4th International Workshop on Engineering Safety and Security Systems, 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

Modelling and Analysing Mixed Reality Applications.

[BibT_eX]

[DOI]

Proceedings of the Man-Machine Interactions 4, 2015

Synthesis of Bounded Choice-Free Petri Nets.

[BibT_eX]

[DOI]

Proceedings of the 26th International Conference on Concurrency Theory, 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

Deadlock and Temporal Properties Analysis in Mixed Reality Applications.

[BibT_eX]

[DOI]

Proceedings of the 25th IEEE International Symposium on Software Reliability Engineering, 2014

Synthesis of Persistent Systems.

[BibT_eX]

[DOI]

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

2013

A Petri Net Interpretation of Open Reconfigurable Systems.

[BibT_eX]

[DOI]

Frédéric Peschanski

Fundam. Informaticae, 2013

Implementing Timed Automata Specifications: The "Sandwich" Approach.

[BibT_eX]

[DOI]

Jean-Yves Didier

Proceedings of the 13th International Conference on Application of Concurrency to System Design, 2013

2010

A Decidable Characterization of a Graphical Pi-calculus with Iterators

[BibT_eX]

[DOI]

Frédéric Peschanski

Proceedings of the Proceedings 12th International Workshop on Verification of Infinite-State Systems, 2010

2009

Efficient Reachability Graph Representation of Petri Nets With Unbounded Counters.

[BibT_eX]

[DOI]

Franck Pommereau

Proceedings of the Joint Proceedings of the 8th, 2009

2008

A compositional Petri net translation of general <i>pi</i> -calculus terms.

[BibT_eX]

[DOI]

Formal Aspects Comput., 2008

Power-Aware Real-Time Scheduling upon Identical Multiprocessor Platforms.

[BibT_eX]

[DOI]

Proceedings of the IEEE International Conference on Sensor Networks, 2008

Modeling and Analysis of Security Protocols Using Role Based Specifications and Petri Nets.

[BibT_eX]

[DOI]

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

2007

From MIN model to ordinary differential equations.

[BibT_eX]

[DOI]

J. Integr. Bioinform., 2007

Incremental and unifying modelling formalism for biological interaction networks.

[BibT_eX]

[DOI]

BMC Bioinform., 2007

FIFO Queuing of Constant Length Fully Synchronous Jobs.

[BibT_eX]

[DOI]

Vandy Berten

Guy Louchard

Proceedings of the Grid Service Engineering and Management: The 4th International Conference on Grid Service Engineering and Management, 2007

Modelling Mobility in High-level Petri Nets.

[BibT_eX]

[DOI]

Proceedings of the Seventh International Conference on Application of Concurrency to System Design (ACSD 2007), 2007

2006

Joint garbage collection and hard real-time scheduling.

[BibT_eX]

[DOI]

Maxime Van Assche

J. Embed. Comput., 2006

Boundedness undecidability for synchronized nets.

[BibT_eX]

[DOI]

Laurent Van Begin

Inf. Process. Lett., 2006

Petri Net Semantics of the Finite pi-calculus Terms.

[BibT_eX]

[DOI]

Fundam. Informaticae, 2006

A Petri Net Translation of <i>pi</i>-Calculus Terms.

[BibT_eX]

[DOI]

Proceedings of the Theoretical Aspects of Computing, 2006

2005

Synchronous and Asynchronous Communications in Composable Parameterized High-Level Petri Nets.

[BibT_eX]

[DOI]

Fundam. Informaticae, 2005

A Petri Net Semantics of a Simple Process Algebra for Mobility.

[BibT_eX]

[DOI]

Proceedings of the 12th Workshop on Expressiveness on Concurrency, 2005

2004

Petri Net Semantics of the Finite pi-Calculus.

[BibT_eX]

[DOI]

Proceedings of the Formal Techniques for Networked and Distributed Systems, 2004

Context-based Process Algebras for Mobility.

[BibT_eX]

[DOI]

Proceedings of the 4th International Conference on Application of Concurrency to System Design (ACSD 2004), 2004

2003

General parameterised refinement and recursion for the M-net calculus.

[BibT_eX]

[DOI]

Robert-C. Riemann

Theor. Comput. Sci., 2003

Asynchronous Box Calculus.

[BibT_eX]

[DOI]

Fundam. Informaticae, 2003

2002

The Box Algebra = Petri Nets + Process Expressions.

[BibT_eX]

[DOI]

Inf. Comput., 2002

An Algebra of Non-safe Petri Boxes.

[BibT_eX]

[DOI]

Proceedings of the Algebraic Methodology and Software Technology, 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

An Algebraic Box Calculus.

[BibT_eX]

[DOI]

Elisabeth Pelz

J. Autom. Lang. Comb., 2000

Liu and Layland's schedulability test revisited.

[BibT_eX]

[DOI]

Inf. Process. Lett., 2000

1999

General Response Time Computation for the Deadline Driven Scheduling of Periodic Tasks.

[BibT_eX]

[DOI]

Fundam. Informaticae, 1999

Feasibility Intervals for the Deadline Driven Scheduler with Arbitrary Deadlines.

[BibT_eX]

[DOI]

Proceedings of the 6th International Workshop on Real-Time Computing and Applications Symposium (RTCSA '99), 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

Recursive Nets in the Box Algebra.

[BibT_eX]

[DOI]

Proceedings of the 1st International Conference on Application of Concurrency to System Design (ACSD '98), 1998

1997

The Non-Optimality of the Monotonic Priority Assignments for Hard Real-Time Offset Free Systems.

[BibT_eX]

[DOI]

Real Time Syst., 1997

General Refinement for High Level Petri Nets.

[BibT_eX]

[DOI]

Robert-C. Riemann

Proceedings of the Foundations of Software Technology and Theoretical Computer Science, 1997

1996

Petri Boxes and Finite Precedence.

[BibT_eX]

[DOI]

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

1995

S-Invariant Analysis of General Recursive Petri Boxes.

[BibT_eX]

[DOI]

Acta Informatica, 1995

Refinement and Recursion in a High Level Petri Box Calculus.

[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

1993

Equality of Agent Expressions is preserved Under an Extension of the Universe of Actions.

[BibT_eX]

[DOI]

Thierry Massart

Formal Aspects Comput., 1993

General Refinement and Recursion Operators for the Petri Box Calculus.

[BibT_eX]

[DOI]

Javier Esparza

Proceedings of the STACS 93, 1993

Construction of S-invariants and S-components for Refined Petri Boxes.

[BibT_eX]

[DOI]

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

1992

Maximality Preserving Bisimulation.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 1992

Maximality preservation and the ST-idea for action refinements.

[BibT_eX]

[DOI]

Proceedings of the Advances in Petri Nets 1992, The DEMON Project, 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

1991

Concurrent Bisimulations in Petri Nets.

[BibT_eX]

[DOI]

Acta Informatica, 1991

1988

The semantics of capacities in P/T nets.

[BibT_eX]

[DOI]

Proceedings of the Advances in Petri Nets 1989, 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]