


default search action
Fundamenta Informaticae, Volume 187
Volume 187, Number 1, 2022
- Stanislaw Kasjan, Damian Niwinski:
Daniel Simson Obituary. - Subhash Bhagat, Abhinav Chakraborty, Bibhuti Das, Krishnendu Mukhopadhyaya:
Gathering over Meeting Nodes in Infinite Grid*. 1-30 - Markus Redeker
:
Number Conservation via Particle Flow in One-dimensional Cellular Automata. 31-59 - Sizhong Zhou:
A Note of Generalization of Fractional ID-factor-critical Graphs. 61-69
Volume 187, Numbers 2-4, 2022
- Didier Buchs, Josep Carmona, Jetty Kleijn:
Preface. - Samy Abbes
:
Introduction to Probabilistic Concurrent Systems. 71-102 - Nicolas Amat, Bernard Berthomieu, Silvano Dal-Zilio:
A Polyhedral Abstraction for Petri Nets and its Application to SMT-Based Model Checking. 103-138 - Raymond R. Devillers, Ronny Tredup:
Synthesis of Pure and Impure Petri Nets with Restricted Place-environments: Complexity Issues. 139-165 - Raymond R. Devillers, Ronny Tredup:
Some Basic Techniques Allowing Petri Net Synthesis: Complexity and Algorithmic Issues. 167-196 - Javier Esparza, Mikhail A. Raskin
, Christoph Welzel:
Computing Parameterized Invariants of Parameterized Petri Nets. 197-243 - Sophie Wallner, Karsten Wolf:
Skeleton Abstraction for Universal Temporal Properties. 245-272

manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.