Skip to search form
Skip to main content
Skip to account menu
Semantic Scholar
Semantic Scholar's Logo
Search 227,741,305 papers from all fields of science
Search
Sign In
Create Free Account
Well-structured transition system
In computer science, specifically in the field of formal verification, well-structured transition systems (WSTSs) are a general class of infinite…
Expand
Wikipedia
(opens in a new tab)
Create Alert
Alert
Related topics
Related topics
4 relations
Computability
Computer science
Formal verification
Transition system
Papers overview
Semantic Scholar uses AI to extract papers important to this topic.
2016
2016
Ideal Decompositions for Vector Addition Systems (Invited Talk)
Jérôme Leroux
,
S. Schmitz
Symposium on Theoretical Aspects of Computer…
2016
Corpus ID: 37241749
Vector addition systems, or equivalently Petri nets, are one of the most popular formal models for the representation and the…
Expand
2014
2014
An algorithmic framework for checking coverability in well-structured transition systems
T. Strazny
Berichte aus dem Department für Informatik…
2014
Corpus ID: 46294391
Well-structured transition systems are an abstract class of infinite-state systems with transitions that are compatible with a…
Expand
2014
2014
Expressiveness of Dynamic Networks of Timed Petri Nets
María Martos-Salgado
,
Fernando Rosa-Velardo
Language and Automata Theory and Applications
2014
Corpus ID: 41397469
We study dynamic networks of infinite-state timed processes, where each process is a Petri net carrying a single real valued…
Expand
2013
2013
Dynamic Networks of Infinite-State Timed Processes
María Martos-Salgado
,
Fernando Rosa-Velardo
2013
Corpus ID: 15309246
We study dynamic networks of infinite-state timed processes. We model infinite-state processes as unbounded Petri nets. These…
Expand
2011
2011
Safety and Liveness for Well-Structured Petri Net Extensions
A. Finkel
2011
Corpus ID: 78087092
Ces notes reprennent et généralisent des parties des cours 4 et 5. Les problèmes de terminaison, couverture (coverability) et…
Expand
2010
2010
A Calculus for Component Evolvability (Extended Abstract)
M. Bravetti
,
C. Giusto
,
Jorge A. Pérez
,
G. Zavattaro
International Workshop on Formal Aspects of…
2010
Corpus ID: 17770875
We describe ongoing work on a formal framework for reasoning about dynamically evolvable aggregations of components. The…
Expand
2010
2010
Deciding safety properties in infinite-state pi-calculus via behavioural types I
Lucia Acciai
,
Michele Boreale
2010
Corpus ID: 267922123
In the pi-calculus, we consider decidability of safety properties expressed in a simple spatial logic. We first introduce a…
Expand
2006
2006
Decidability of Divergence for Catalytic P Systems
N. Busi
2006
Corpus ID: 14338528
P systems are a biologically inspired model introduced by Gheorghe Păun with the aim of representing the structure and the…
Expand
2006
2006
Model checking with abstraction refinement for well-structured systems
Rayna Dimitrova
,
A. Podelski
,
B. Finkbeiner
2006
Corpus ID: 12994245
Abstraction plays an important role in the verification of infinite-state systems. One of the most promising and popular…
Expand
2004
2004
Verifying Properties of Coordination by Well-Structured Transition Systems
Mirko Viroli
FOCLASA
2004
Corpus ID: 11597917
By clicking accept or continuing to use the site, you agree to the terms outlined in our
Privacy Policy
(opens in a new tab)
,
Terms of Service
(opens in a new tab)
, and
Dataset License
(opens in a new tab)
ACCEPT & CONTINUE