Petr nets, algebras, morphisms, and compositionality
Information and Computation
Branching processes of Petri nets
Acta Informatica
Symbolic model checking: an approach to the state explosion problem
Symbolic model checking: an approach to the state explosion problem
Model checking using net unfoldings
TAPSOFT '93 Selected papers of the colloquium on Formal approaches of software engineering
Diagnosis of large active systems
Artificial Intelligence
Coordinated Decentralized Protocols for Failure Diagnosisof Discrete Event Systems
Discrete Event Dynamic Systems
A General Architecture for Decentralized Supervisory Control of Discrete-Event Systems
Discrete Event Dynamic Systems
An Improvement of McMillan's Unfolding Algorithm
Formal Methods in System Design
Event Structure Semantics for CCS and Related Languages
Proceedings of the 9th Colloquium on Automata, Languages and Programming
An Improvement of McMillan's Unfolding Algorithm
TACAs '96 Proceedings of the Second International Workshop on Tools and Algorithms for Construction and Analysis of Systems
A New Definition of Morphism on Petri Nets
STACS '84 Proceedings of the Symposium of Theoretical Aspects of Computer Science
Categories of Models for Concurrency
Seminar on Concurrency, Carnegie-Mellon University
Using Unfoldings to Avoid the State Explosion Problem in the Verification of Asynchronous Circuits
CAV '92 Proceedings of the Fourth International Workshop on Computer Aided Verification
Deadlock Checking Using Net Unfoldings
CAV '97 Proceedings of the 9th International Conference on Computer Aided Verification
WODES '02 Proceedings of the Sixth International Workshop on Discrete Event Systems (WODES'02)
Distributed Diagnosis for Qualitative Systems
WODES '02 Proceedings of the Sixth International Workshop on Discrete Event Systems (WODES'02)
Distributed Monitoring of Concurrent and Asynchronous Systems*
Discrete Event Dynamic Systems
Control of Safe Ordinary Petri Nets Using Unfolding
Discrete Event Dynamic Systems
Distributed diagnosis of discrete-event systems using Petri nets
ICATPN'03 Proceedings of the 24th international conference on Applications and theory of Petri nets
How much is worth to remember? a taxonomy based on petri nets unfoldings
PETRI NETS'11 Proceedings of the 32nd international conference on Applications and theory of Petri Nets
| Hi-index | 0.00 |
The unfolding of a concurrent system represents in a compact manner all possible runs of this system. Unfoldings are used in many applications, ranging from model-checking (offline) to failure diagnosis (on-line). Their factorization properties form the basis of modular/distributed algorithms to achieve these tasks. The trellis structure proposed here is an alternate and more compact representation for the trajectory set of a concurrent system. In this structure, time is unfolded, but not the conflict relations. Trellis nets are the generalization to concurrent systems of the usual notion of trellis for an automaton. As for unfoldings, factorization properties are evidenced on trellises, which makes these more compact structures a possible candidate for distributed model checking or diagnosis algorithms. As an example, we show how trellises can be used for diagnosis purposes in a distributed observation setting.