arXiv (All)
open access
Opacity of Parametric Discrete Event Systems: Models, Decidability, and Algorithms
Finite automata (FAs) model is a popular tool to characterize discrete event systems (DESs) due to its succinctness. However, for some complex systems, it is difficult to describe the necessary details by means of FAs model. In this paper, we consider a kind of extended finite automata (EFAs) in whi
Conceptio Open Archive
Analyze & explore related research in Conceptio
Connect this record directly into your research workflow or AI agent. Explore citations across open repositories, query full text, and export structured proof bundles.
This document is indexed with metadata only: full text is not available in the archive for this record. Open the official source ↗
Related documents
- The Admissibility → Observation Theorem: Why Observation Requires Structural Permission in the Paton System#74466
- Process as Structure: A Clarification of Interaction Beyond Counting#95340
- Understanding Digital Events: Process Philosophy and Causal Autonomy#746218
- MAS-ProVe: Understanding the process verification of multi-agent systems#368786
- Progression- vs Automata-based Anticipatory Monitoring of LTL over Finite Traces (Extended Version)#1117624
Record · ID 1458134
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Bring this data into your agent: Connect via MCP or API · 20 free credits to start · no card required
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive